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,657 papers · 148 categories

Trend · papers per month

15294458 · Feb 202619922001200920172026
48 results for rigorous

This work develops rigorous theoretical basis for the fact that deep Bayesian neural network (BNN) is an effective tool for high-dimensional variable selection with rigorous uncertainty quantification. We develop new Bayesian non-parametric theorems to show that a properly configured deep BNN (1) learns the variable im…

2019-12-03abs ↗pdf ↗

Machine learning improves official statistics but needs rigorous validation.

problem Lack of methodological robustness in machine learning for official statistics.
method Total Machine Learning Error (TMLE) framework to validate ML models.
result TMLE addresses representativeness and measurement errors in ML models.

As machine learning systems become ubiquitous, there has been a surge of interest in interpretable machine learning: systems that provide explanation for their outputs. These explanations are often used to qualitatively assess other criteria such as safety or non-discrimination. However, despite the interest in interpr…

2017-02-28abs ↗pdf ↗

New rigorous uncertainty bounds for Gaussian Process regression.

problem Need for frequentist uncertainty bounds in applications like learning-based control.
method Introduce new uncertainty bounds that are rigorous and practically useful.
result New bounds are less conservative and more useful for practical applications.

Paper rigorously defines Feynman graph integrals on Kähler manifolds.

problem Establishing convergence of Feynman graph integrals on Kähler manifolds.
method Using Getzler's rescaling technique, graph integrands are extended to forms with divisorial-type singularities in the compactification of configuration spaces.
result Feynman graph integrals are rigorously defined as Cauchy principal value integrals.

We rigorously prove statistical physics predictions for non-convex GLMs in high dimensions.

problem Analyzing high-dimensional optimization problems in non-convex Generalized Linear Models.
method Developed a systematic framework using the Gaussian Min-Max Theorem and AMP to rigorously prove replica-symmetric formulas.
result Validated statistical physics predictions for non-convex GLMs, aligning with physicist's conjectures.

Spofe bridges statistical rigor and interpretability in feature extraction from tabular data.

problem Ensuring statistical rigor and interpretability in feature extraction from complex tabular data.
method Spofe combines kernel principal components and sparse polynomial functions with a multi-objective knockoff selection procedure.
result Spofe consistently outperforms other methods in feature selection for regression and classification tasks.

Lasso proves consistent model selection for high-dimensional Ising models.

problem Model selection consistency of Lasso for high-dimensional Ising models.
method Theoretical analysis of Lasso with and without post-thresholding for Ising models.
result Lasso without post-thresholding is model selection consistent in the whole paramagnetic phase with n=Ω(d3logp)n=Ω{(d^3\log{p})}.

Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual parameters that are often used as heuristic estimates of the marginal probabilities required in inference and learning. However these variational est…

2012-07-11abs ↗pdf ↗

New method for rolling bodies on inclined planes, with applications to rescue operations.

problem Constructing solid bodies rolling along curves on inclined planes.
method Rigorous existence theorems and connections to maritime rescue operations.
result Comprehensive existence theorems for rolling bodies on inclined planes.

Paper revisits Black-Scholes model, proving solution existence and measuring market uncertainty.

problem Proving existence of solution in inverse Black-Scholes model.
method Rigorous proof and empirical study using finite element method.
result New measure of market uncertainty developed.

Extends field theory foundations to infinitesimal spaces, simplifying complex concepts.

problem Develop rigorous foundations for field theory, especially for infinitesimal spaces.
method Formulates local Lagrangian field theory in a new category of thickened smooth sets.
result Establishes a firm foundation for field theory, including tangent bundles and perturbative considerations.

RealStats detects fake images rigorously, combining multiple detectors for robustness.

problem Detecting AI-generated images remains challenging due to evolving generative models.
method Combines training-free statistics to compute p-values and aggregate them for a unified real-image distribution.
result Framework produces interpretable probability scores for robust fake image detection.

The geometrical features of the (non-convex) loss landscape of neural network models are crucial in ensuring successful optimization and, most importantly, the capability to generalize well. While minimizers' flatness consistently correlates with good generalization, there has been little rigorous work in exploring the…

2019-11-15abs ↗pdf ↗

A framework integrates machine learning with robust control for safer, more reliable systems.

problem Combining machine learning with robust control for systems with stringent safety and reliability requirements.
method Integrates Gaussian Process Regression and state-of-the-art robust controller synthesis within a framework that provides rigorous guarantees.
result Demonstrated improved performance with more data while maintaining rigorous guarantees.

We provide a rigorous numerical computation method to validate periodic, homoclinic and heteroclinic orbits as the continuation of singular limit orbits for the fast-slow system x=f(x,y,ε),y=εg(x,y,ε)x' = f(x,y,ε), y' = εg(x,y,ε) with one-dimensional slow variable yy. Our validation procedure is based on topological tools called isolatin…

2015-07-06abs ↗pdf ↗

Study examines solutions to Jang equation on anti-de Sitter spacetimes.

problem Existence and properties of solutions to the generalized Jang equation.
method Rigorous analysis in asymptotically anti-de Sitter setting.
result Provides solutions for a broad class of asymptotic conditions.

In this paper, we propose a simple, versatile model for learning the structure and parameters of multivariate distributions from a data set. Learning a Markov network from a given data set is not a simple problem, because Markov networks rigorously represent Markov properties, and this rigor imposes complex constraints…

2012-06-17abs ↗pdf ↗

Develops a validated trading framework for market microstructure signals.

problem Overfitting and lookahead bias in algorithmic trading.
method Interpretable hypothesis-driven signal generation, reinforcement learning, strict out-of-sample testing.
result Modest annualized returns with strong downside protection and market-neutral characteristics.

In this paper we address some problems concerning an approximate Dirichlet domain. We show that under some assumptions the approximate Dirichlet domain can work equally well as an exact Dirichlet domain. In particular, we consider a problem of tiling a hyperbolic ball with copies of the Dirichlet domain. This problem a…

2017-03-07abs ↗pdf ↗

Conditional mean embeddings (CMEs) have proven themselves to be a powerful tool in many machine learning applications. They allow the efficient conditioning of probability distributions within the corresponding reproducing kernel Hilbert spaces (RKHSs) by providing a linear-algebraic relation for the kernel mean embedd…

2019-12-02abs ↗pdf ↗

We provide faster algorithms for the problem of Gaussian summation, which occurs in many machine learning methods. We develop two new extensions - an O(Dp) Taylor expansion for the Gaussian kernel with rigorous error bounds and a new error control scheme integrating any arbitrary approximation method - within the best …

2012-06-27abs ↗pdf ↗

It has been known for a long time that the classical spherical perceptrons can be used as storage memories. Seminal work of Gardner, \cite{Gar88}, started an analytical study of perceptrons storage abilities. Many of the Gardner's predictions obtained through statistical mechanics tools have been rigorously justified. …

2013-06-17abs ↗pdf ↗

We study 1-parameter families of holomorphic curves with Lagrangian boundary in Calabi-Yau 3-folds. We show that the expected codimension one phenomena can be organized to match the HOMFLYPT skein relations from quantum topology. It follows that counting holomorphic curves by the class of their boundaries in the skein …

2019-01-23abs ↗pdf ↗

This thesis is divided into four chapters. The first chapter discusses the relationship between stacks on a site and groupoids internal to the site. It includes a rigorous proof of the folklore result that there is an equivalence between the bicategory of internal groupoids and the bicategory of geometric stacks. The s…

2018-06-05abs ↗pdf ↗

This is a simple mathematical introduction into Feynman diagram technique, which is a standard physical tool to write perturbative expansions of path integrals near a critical point of the action. I start from a rigorous treatment of a finite dimensional case (which actually belongs more to multivariable calculus than …

2004-06-12abs ↗pdf ↗

Paper connects free-energy and low-degree hardness in high-dimensional statistics.

problem High-dimensional statistical inference problems are computationally hard.
method Defines a free-energy criterion and connects it to low-degree hardness.
result Establishes connection between free-energy and low-degree hardness for Gaussian models.

A rigorous ML pipeline for binary classification in biomedical studies, focusing on pancreatic cancer.

problem Handling bias in ML models for complex biomedical data.
method Customizable ML analysis pipeline with 9 algorithms, hyperparameter optimization, and thorough evaluation.
result Comparison of ML algorithms to ExSTraCS, highlighting interpretability and bias handling.

Paper explores Fisher-Rao gradient flows and their kernel approximations.

problem Understanding and analyzing approximations of Fisher-Rao gradient flows.
method Rigorous investigation of Fisher-Rao and Wasserstein type gradient flows, focusing on kernel approximations.
result Proves evolutionary Γ-convergence for kernel-approximated Fisher-Rao flows, providing theoretical guarantees.