Related papers: Ideas for best teaching integrals: we're teaching …
We motivate and study an infinite sequence of binary operations on the ordinal numbers, extending the standard arithmetic on the ordinals to higher degrees of iteration. Connections to the hyperoperations on the natural numbers are…
The ability of a model to learn continually can be empirically assessed in different continual learning scenarios. Each scenario defines the constraints and the opportunities of the learning environment. Here, we challenge the current trend…
We resolve two problems pertaining to indefinite integral ternary quadratic forms, one highlighted by Margulis and the other initiated by Serre, both from 1990. To do so we develop tools for dealing with high ramification in problems…
We show some definite integrals connecting to infinite series, studied in Ramanujan's paper, titled "On question 330 of Professor Sanjana". We present few recursive methods to evaluate these definite integrals in various cases and we…
We develop a numerical method for solving a system of nonlinear integral equations involving two integral terms: at the current time t, one integral is taken from 0 to t, and a different integral is taken from t to infinity. We prove the…
Class-incremental learning deals with sequential data streams composed of batches of classes. Various algorithms have been proposed to address the challenging case where samples from past classes cannot be stored. However, selecting an…
Ambiguity is shown in the context of the differential calculus of several variables and with the help of the language of category theory, a way to solve it in its most general form is offered. It is also shown that this new definition is…
We study a specific convex maximization problem in the space of continuous functions defined on a semi-infinite interval. An unexplained connection to the discrete version of this problem is investigated.
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
A new heuristic method for the evaluation of definite integrals is presented. This method of brackets has its origin in methods developed for the evaluation of Feynman diagrams. The operational rules are described and the method is…
A complementary label (CL) simply indicates an incorrect class of an example, but learning with CLs results in multi-class classifiers that can predict the correct class. Unfortunately, the problem setting only allows a single CL for each…
Here we initiate a program to study relationships between finite groups and arithmetic-geometric invariants in a systematic way. To do this we first introduce a notion of optimal module for a finite group in the setting of holomorphic mock…
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…
Neural integral equations are deep learning models based on the theory of integral equations, where the model consists of an integral operator and the corresponding equation (of the second kind) which is learned through an optimization…
Grammatical inference is a classical problem in computational learning theory and a topic of wider influence in natural language processing. We treat grammars as a model of computation and propose a novel neural approach to induction of…
Notes used for a course held in 2016 in the School of Advances in Group Theory and Applications, for some lectures given in 2018 for the students of the Master in Mathematics of the Vrije Universiteit Brussels, a course for master and Ph.D.…
This paper frames calculus as a global, centuries-long development rather than a subject that began only with Newton and Leibniz. Drawing on ideas from Greek, Indian, Islamic, and later European mathematics, it highlights how concepts like…
Regularization-based approaches for injecting constraints in Machine Learning (ML) were introduced to improve a predictive model via expert knowledge. We tackle the issue of finding the right balance between the loss (the accuracy of the…
We address the problem of incremental sequence classification, where predictions are updated as new elements in the sequence are revealed. Drawing on temporal-difference learning from reinforcement learning, we identify a…
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…