A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Attribute-aware CF models aims at rating prediction given not only the historical rating from users to items, but also the information associated with users (e.g. age), items (e.g. price), or even ratings (e.g. rating time). This paper surveys works in the past decade developing attribute-aware CF systems, and discover…
We give a mathematical computation of the number of solutions of Apollonius problem, by use of Lie Sphere Geometry. Unlike in higher dimensions, the number of solutions depends only on the topology of the configuration of the 3 objects. It appears that our classification is non redundant, and far simpler than those obt…
We give an alternative to Postnikov's homotopy classification of maps from 3-dimensional CW-complexes to homogeneous spaces G/H of Lie groups. It describes homotopy classes in terms of lifts to the group G and is suitable for extending the notion of homotopy to Sobolev maps. This is required for applications to variati…
Distance metric learning is a branch of machine learning that aims to learn distances from the data, which enhances the performance of similarity-based algorithms. This tutorial provides a theoretical background and foundations on this topic and a comprehensive experimental analysis of the most-known algorithms. We sta…
We provide a computer-assisted proof of the holomorphy of the quartic and the octic meromorphic differentials arising in the main Theorem 4.11 of our paper 'The Classification of Branched Willmore spheres in the 3-Sphere and the 4-Sphere' (arXiv:1706.01405), using the free mathematical software Sage.
Motivated by the physical concept of special geometry two mathematical constructions are studied, which relate real hypersurfaces to tube domains and complex Lagrangean cones respectively. Me\-thods are developed for the classification of homogeneous Riemannian hypersurfaces and for the classification of linear transit…
Multilayered artificial neural networks are becoming a pervasive tool in a host of application fields. At the heart of this deep learning revolution are familiar concepts from applied and computational mathematics; notably, in calculus, approximation theory, optimization and linear algebra. This article provides a very…
Estimating the difficulty level of math word problems is an important task for many educational applications. Identification of relevant and irrelevant sentences in math word problems is an important step for calculating the difficulty levels of such problems. This paper addresses a novel application of text categoriza…
Chemical networks outperform spiking neural networks in classification tasks.
problem Learning tasks with spiking neural networks require hidden layers, which are computationally expensive.
method Used deterministic mass-action kinetics to prove chemical reaction networks without hidden layers can solve tasks previously solved by spiking neural networks.
result A chemical reaction network without hidden layers outperforms a spiking neural network with hidden layers in a handwritten digit classification task.
Recently, machine learning (ML) has established itself in various worldwide benchmarking competitions in computational biology, including Critical Assessment of Structure Prediction (CASP) and Drug Design Data Resource (D3R) Grand Challenges. However, the intricate structural complexity and high ML dimensionality of bi…
This paper reviews recent advances in the field of optimization under uncertainty via a modern data lens, highlights key research challenges and promise of data-driven optimization that organically integrates machine learning and mathematical programming for decision-making under uncertainty, and identifies potential r…
Graph classification has recently received a lot of attention from various fields of machine learning e.g. kernel methods, sequential modeling or graph embedding. All these approaches offer promising results with different respective strengths and weaknesses. However, most of them rely on complex mathematics and requir…
Mathematical conditions and practical computations for adversarial robustness measures are established.
problem Existence, uniqueness, and scalability of adversarial robustness measures for AI classifiers.
method Formulated and proven mathematical conditions for existence, uniqueness, and explicit analytical computation of minimal adversarial paths and distances. Practical computation demonstrated on various AI tools and synthetic benchmarks.
result Explicit mathematical conditions and practical computations for adversarial robustness measures are established.
A mixture of shifted asymmetric Laplace distributions is introduced and used for clustering and classification. A variant of the EM algorithm is developed for parameter estimation by exploiting the relationship with the general inverse Gaussian distribution. This approach is mathematically elegant and relatively comput…
First steps towards a mathematical theory of deep convolutional neural networks for feature extraction were made---for the continuous-time case---in Mallat, 2012, and Wiatowski and Bölcskei, 2015. This paper considers the discrete case, introduces new convolutional neural network architectures, and proposes a mathemati…
Data driven classification that relies on neural networks is based on optimization criteria that involve some form of distance between the output of the network and the desired label. Using the same mathematical analysis, for a multitude of such measures, we can show that their optimum solution matches the ideal likeli…
Deep convolutional networks provide state of the art classifications and regressions results over many high-dimensional problems. We review their architecture, which scatters data with a cascade of linear filter weights and non-linearities. A mathematical framework is introduced to analyze their properties. Computation…
In this paper we give the stable classification of ordered, pointed, oriented multi-component curves on surfaces with minimal crossing number less than or equal to 2 such that any equivalent curve has no simply closed curves in its components. To do this, we use the theory of words and phrases which was introduced by V…
GCN and GPCA are mathematically connected, leading to improved node classification performance.
problem Improving node classification performance in semi-supervised settings.
method Established a mathematical connection between GCN and GPCA, demonstrating their equivalence and using this to design an effective initialization strategy.
result GPCA paired with a simple MLP achieves similar or better performance than GCN on semi-supervised node classification tasks.
We describe simply connected compact exceptional simple Lie groups in very elementary way. We first construct all simply connected compact exceptional Lie groups G concretely. Next, we find all involutive automorphisms of G, and determine the group structures of the fixed points subgroup. They correspond to the classif…