Research
On-device research index

arXiv research

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.

168,695 papers · 148 categories

Trend · papers per month

82164246328 · Jun 202019922001200920172026
48 results for experimental mathematics

Mathematical framework for differential machine learning in finance.

problem Theoretical assumptions in financial models and their impact on machine learning algorithms.
method Rigorous mathematical framework for differential machine learning in finance.
result Theoretical grounding enhances the predictive capabilities of neural networks in financial applications.

Operator learning approximates complex mappings for PDEs and experimental data.

problem Approximating mappings between infinite-dimensional function spaces for scientific computing.
method Formalizing operator learning as function-to-function regression and incorporating physical constraints.
result Development of rigorous uncertainty quantification frameworks for operator learning.

We give a survey of our joint ongoing work with Ali Chamseddine, Slava Mukhanov and Walter van Suijlekom. We show how a problem purely motivated by "how geometry emerges from the quantum formalism" gives rise to a slightly noncommutative structure and a spectral model of gravity coupled with matter which fits with expe…

2017-03-07abs ↗pdf ↗

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…

2018-12-14abs ↗pdf ↗

New model captures complex relationships from experimental data.

problem Capturing intricate feature interactions in empirical data.
method Shape Arithmetic Expressions (SHAREs) combining GAMs and mathematical expressions.
result SHAREs model captures complex feature interactions.

MAD framework learns operators from physics-embedded data efficiently.

problem Data-driven methods require costly labeled datasets and model-driven techniques face efficiency-accuracy trade-offs.
method Integrates physical laws with data-driven learning to generate physics-embedded analytical solutions and synthetic data.
result Eliminates dependence on experimental or simulated training data, enabling efficient operator learning across multi-parameter systems.
On ΛΛ-Elasticaphysics.class-ph

In this paper, we investigate a transition from an elastica to a piece-wised elastica whose connected point defines the hinge angle φ0φ_0; we refer the piece-wised elastica Λφ0Λ_{φ_0}-elastica or ΛΛ-elastica. The transition appears in the bending beam experiment; we compress elastic beams gradually and then suddenly du…

2019-09-04abs ↗pdf ↗

In this study we introduce a new technique for symbolic regression that guarantees global optimality. This is achieved by formulating a mixed integer non-linear program (MINLP) whose solution is a symbolic mathematical expression of minimum complexity that explains the observations. We demonstrate our approach by redis…

2017-10-29abs ↗pdf ↗

Language models help text classification tasks by predicting next words.

problem Lack of theoretical understanding of why language models perform well on downstream tasks.
method Mathematical study of the connection between next word prediction and text classification, formalizing it and quantifying the benefit.
result Language models that are ε-optimal in cross-entropy learn features that can solve classification tasks with linear approximation.

Study evaluates different mathematical models for three case studies using statistical fitting.

problem Estimating outcomes in population dynamics, temperature variations, and market equilibrium.
method Applied various statistical equations (e.g., fractional exponential, sinusoidal) to three case studies.
result Optimal models differ by case study (fractional exponential for population dynamics, sinusoidal for temperature and market equilibrium).

This paper provides a mathematical framework for time-delay reservoir computing.

problem Lack of rigorous mathematical foundations for reservoir computing properties.
method Control-theoretic framework, formal definitions of separation and fading memory, explicit lower bound derivation.
result Established formal definitions and connections to stability notions for time-delay systems.

Experimental life sciences like biology or chemistry have seen in the recent decades an explosion of the data available from experiments. Laboratory instruments become more and more complex and report hundreds or thousands measurements for a single experiment and therefore the statistical methods face challenging tasks…

2014-03-12abs ↗pdf ↗

We use deep reinforcement learning to optimize experimental designs efficiently.

problem Optimizing sequential experimental designs with limited exploration and black-box models.
method Reduced the optimal design problem to an MDP and solved it with deep reinforcement learning.
result Our approach achieves state-of-the-art performance on both continuous and discrete design spaces.

The paper examines Gaussian process means under misspecified likelihoods and smoothness.

problem Accuracy of Gaussian process approximations under misspecified smoothness and likelihood.
method Analysis of Gaussian process properties under misspecified conditions.
result The accuracy of Gaussian process approximations is influenced by experimental design and kernel choice.

Researchers compute large quantum invariants for 3-manifolds.

problem Computing large values of Turaev-Viro invariants for 3-manifolds.
method Optimized backtracking algorithm, lattice point counting, preprocessing strategy, multi-precision arithmetics.
result Experimentally verified improvements over state-of-the-art implementations, supporting volume conjecture.

New method improves experimental design under model misspecification.

problem Improving experimental design under time and budget constraints with model misspecification.
method Developed a new acquisition function (R-IDeA) that targets representativeness, informativeness, and de-amplification.
result The new method outperforms methods focusing on representativeness or informativeness alone.

A new optimizer, Grad-Avg, converges faster than SGD and improves classification task performance.

problem Optimizing error functions in regression and classification tasks.
method Grad-Avg optimizer based on gradient averaging, with mathematical convergence proof and parameter scaling for classification.
result Grad-Avg converges faster than other optimizers for classification tasks on benchmark datasets.

DisCoPyro combines category theory with machine learning for program learning.

problem Applying category theory to machine learning tasks.
method Introducing DisCoPyro, a framework combining categorical structures with amortized variational inference.
result DisCoPyro can be applied in program learning for variational autoencoders and potentially contributes to AGI.

Bayesian sOED uses PG reinforcement learning for efficient experiment design.

problem Optimizing sequential experiments for nonlinear models with limited data.
method Formulated as POMDP, solved via PG methods with neural network parameterization.
result Demonstrated advantages over batch and greedy designs in contaminant source inversion.

Study proposes curvature flow model for Drosophila dorsal closure.

problem Modeling and understanding Drosophila dorsal closure during embryonic development.
method Curvature-based mathematical model, analysis of maximum-principle and integral-estimates, numerical approximation scheme.
result Established global existence and convergence for the model.

In this paper, we present a new statistical approach to the problem of incorporating experimental observations into a mathematical model described by linear partial differential equations (PDEs) to improve the prediction of the state of a physical system. We augment the linear PDE with a functional that accounts for th…

2014-05-29abs ↗pdf ↗

We consider the existence of simple closed geodesics or "geodesic knots" in finite volume orientable hyperbolic 3-manifolds. Previous results show that at least one geodesic knot always exists [Bull. London Math. Soc. 31(1) (1999) 81-86], and that certain arithmetic manifolds contain infinitely many geodesic knots [J. …

2009-06-30abs ↗pdf ↗

We propose Mish\textit{Mish}, a novel self-regularized non-monotonic activation function which can be mathematically defined as: f(x)=xtanh(softplus(x))f(x)=x\tanh(softplus(x)). As activation functions play a crucial role in the performance and training dynamics in neural networks, we validated experimentally on several well-known benchmarks…

2019-08-23abs ↗pdf ↗

New method controls posterior collapse in VAEs without network architecture constraints.

problem Posterior collapse in VAEs reduces diversity of generated samples.
method Introduces Latent Reconstruction (LR) loss to control posterior collapse.
result Controls posterior collapse on various datasets without architectural constraints.

Unified approach for learning state representations from streaming data.

problem Learning reusable state representations from high-dimensional, non-stationary data.
method Unified mathematical formulation for learning latent relations, enabling flexible and principled shaping of latent space.
result Improved understanding and evaluation of existing unsupervised learning approaches.

Study reduces complexity and uncertainty in human atrial cell models.

problem Uncertainty in parameter estimates from gating kinetics models.
method Approximate Bayesian computation to re-calibrate models, investigate two approaches: more complete datasets and less complex formulations.
result Less complex model with fewer parameters gives better fit and lower uncertainty.

The Turaev-Viro invariants are a powerful family of topological invariants for distinguishing between different 3-manifolds. They are invaluable for mathematical software, but current algorithms to compute them require exponential time. The invariants are parameterised by an integer r3r \geq 3. We resolve the question …

2015-03-13abs ↗pdf ↗

Reliable training of generative adversarial networks (GANs) typically require massive datasets in order to model complicated distributions. However, in several applications, training samples obey invariances that are \textit{a priori} known; for example, in complex physics simulations, the training data obey universal …

2019-06-04abs ↗pdf ↗