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

122243365486 · Jun 202019922001200920172026
48 results for rigorous analysis

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.

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.

Into a geometric setting, we import the physical interpretation of index theorems via semi-classical analysis in topological quantum field theory. We develop a direct relationship between Fedosov's deformation quantization of a symplectic manifold X and the BV quantization of a one-dimensional sigma model with target X…

2015-07-07abs ↗pdf ↗

We recall the Chernoff-Marsden definition of weak symplectic structure and give a rigorous treatment of the functional analysis and geometry of weak symplectic Banach spaces. We define the Maslov index of a continuous path of Fredholm pairs of Lagrangian subspaces in continuously varying Banach spaces. We derive basic …

2013-01-30abs ↗pdf ↗

This work analyzes self-attention matrices using random matrix theory.

problem Understanding the theoretical behavior of self-attention layers in neural networks.
method Asymptotic spectral analysis of the attention matrix, Gaussian equivalence, and linearization.
result The singular value distribution of the attention matrix is asymptotically characterized by a linear model.

Paper formalizes multi-dimensional FSD using geometric methods.

problem Complex measure theory and calculus barriers to formalization in proof assistants.
method Geometric framework for first-order stochastic dominance in N dimensions.
result Geometric approach bypasses complex integration theory for direct comparison of survival probabilities.

Analyzes deep neural networks training errors with SGD and random init.

problem Lack of rigorous understanding of deep learning algorithms.
method Mathematical analysis of deep learning with SGD and random init.
result First full error analysis for deep learning with SGD and random init.

New HMC method uses asymmetrical momentum distributions and improves performance.

problem Rigorous convergence guarantees for HMC with Gaussian momentum distributions.
method New convergence analysis for HMC with general asymmetrical momentum distributions, proposing AD-HMC.
result AD-HMC exhibits geometric convergence in Wasserstein distance under certain conditions.

FA-HMC improves Bayesian federated learning with rigorous guarantees.

problem Parameter estimation and uncertainty quantification in non-iid distributed data.
method Federated Averaging stochastic Hamiltonian Monte Carlo (FA-HMC) with convergence guarantees.
result FA-HMC achieves better convergence and communication efficiency than existing methods.

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})}.

Efficient algorithm for clustering and classification using MBO scheme.

problem Data clustering and classification tasks.
method Introduces constraints on cluster size leading to a linear integer problem, proving it's induced by a novel order statistic. Develops exact and efficient algorithms based on variational viewpoint connecting to volume-preserving mean curvature flow.
result Estimates computational complexity better than state-of-the-art, proving rigorous analysis.

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.

sBayFDNN bridges deep learning and functional data analysis for complex, structured data.

problem Challenges in functional data analysis, especially for complex, continuously structured data.
method Sparse Bayesian functional deep neural network (sBayFDNN) that learns adaptive functional embeddings and interpretable region selection.
result First theoretical guarantees for a Bayesian deep functional model, ensuring reliability and statistical rigor.

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.

New algorithm maintains privacy while improving model performance in selective release.

problem Privacy degradation and slow convergence in DPSGD.
method Differentially Private Selective Release based on Clipped Gradients (DPSR-CG).
result Maintains strict privacy guarantees while achieving exceptional model performance.

This work establishes properties on diffeological structures for set-valued maps and measures.

problem Establish rigorous properties on diffeological structures for set-valued maps and measures.
method Using diffeologies, the authors link various structures including set-valued maps, relations, gradients, measures, and shape analysis.
result Established rigorous properties on sample diffeologies.

This dissertation contains a comprehensive study of the topology of 2-manifolds and a complementary analysis of the work done by Edwin E. Moise, L. V. Ahlfors and Ian Richards. Our aim is to study the well known classification of surfaces. Here we present the technical tools needed for proving rigorously the classifica…

2014-07-31abs ↗pdf ↗

This paper evaluates LLMs for technical market analysis, finding GPT-4 Turbo and FinGPT outperform passive benchmarks.

problem Evaluating LLMs for technical market analysis in financial markets.
method Structured evaluation of five LLMs (GPT-4 Turbo, Claude 3 Opus, Gemini 1.5 Pro, Llama 3 70B, FinGPT) on four tasks: candlestick pattern recognition, directional signal generation, backtesting, and financial report comprehension.
result GPT-4 Turbo and FinGPT outperform passive benchmarks in simulated backtesting, with GPT-4 Turbo achieving the highest annualized return and Sharpe ratio.

Kernel methods are studied in a mean field limit for high-dimensional data.

problem Analyzing kernel methods in high-dimensional data with many variables.
method Investigation of kernel methods in the mean field limit of interacting particle systems.
result Rigorous mean field limit of kernels and detailed analysis of the limiting reproducing kernel Hilbert space.

A spin network is a cubic ribbon graph labeled by representations of SU(2)\mathrm{SU}(2). Spin networks are important in various areas of Mathematics (3-dimensional Quantum Topology), Physics (Angular Momentum, Classical and Quantum Gravity) and Chemistry (Atomic Spectroscopy). The evaluation of a spin network is an integ…

2009-02-18abs ↗pdf ↗

Neural networks are increasingly deployed in real-world safety-critical domains such as autonomous driving, aircraft collision avoidance, and malware detection. However, these networks have been shown to often mispredict on inputs with minor adversarial or even accidental perturbations. Consequences of such errors can …

2018-09-19abs ↗pdf ↗

Deep generative priors are a powerful tool for reconstruction problems with complex data such as images and text. Inverse problems using such models require solving an inference problem of estimating the input and hidden units of the multi-layer network from its output. Maximum a priori (MAP) estimation is a widely-use…

2019-03-01abs ↗pdf ↗

Recently, a number of learning-based optimization methods that combine data-driven architectures with the classical optimization algorithms have been proposed and explored, showing superior empirical performance in solving various ill-posed inverse problems, but there is still a scarcity of rigorous analysis about the …

2019-05-15abs ↗pdf ↗

A rigorous formulation of Vessiot's vector field approach to the analysis of general systems of partial differential equations is provided. It is shown that this approach is equivalent to the formal theory of differential equations and that it can be carried through if, and only if, the given system is involutive. As a…

2009-09-25abs ↗pdf ↗

SmartDCA improves investment returns by adjusting purchases based on prices.

problem Inefficiency of Dollar-Cost Averaging (DCA) in volatile markets.
method Developed SmartDCA, a more efficient investment strategy that adjusts purchases based on price levels, and analyzed its performance using mathematical inequalities and mean definitions.
result SmartDCA outperforms DCA in long-term investments, with higher performance gains for higher power values of ρρ.

Diagonal linear networks converge to lasso regularization path during training.

problem Understanding the regularization behavior of diagonal linear networks.
method Analyzing the training trajectory of diagonal linear networks and comparing it to the lasso regularization path.
result The training trajectory of diagonal linear networks is closely related to the lasso regularization path.

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 consider an enlarged dimension reduction space in functional inverse regression. Our operator and functional analysis based approach facilitates a compact and rigorous formulation of the functional inverse regression problem. It also enables us to expand the possible space where the dimension reduction functions bel…

2015-03-12abs ↗pdf ↗

In shape analysis, the concept of shape spaces has always been vague, requiring a case-by-case approach for every new type of shape. In this paper, we give a general definition for an abstract space of shapes in a manifold. This notion encompasses every shape space studied so far in the literature, and offers a rigorou…

2015-04-07abs ↗pdf ↗

A statistical toolbox for analyzing model performance in medical imaging.

problem Analyzing model performance by patient and recording properties, especially in medical imaging.
method Selection of appropriate performance metrics, correction of multiple comparisons, and finding interesting subgroups.
result Enables rigorous assessment of model performance for potential subgroup disparities.

We prove the Goldman-Parker Conjecture: A complex hyperbolic ideal triangle group is directly embedded in PU(2,1) if and only if the product of its three standard generators is not elliptic. We also prove that such a group is indiscrete if the product of its three standard generators is elliptic. A novel feature of thi…

2001-05-01abs ↗pdf ↗

We rigorously prove a central limit theorem for neural network models with a single hidden layer. The central limit theorem is proven in the asymptotic regime of simultaneously (A) large numbers of hidden units and (B) large numbers of stochastic gradient descent training iterations. Our result describes the neural net…

2018-08-28abs ↗pdf ↗