Survey on rigorous construction of supersymmetric path integral.
problem Rigorous construction of supersymmetric path integral.
method Construction based on joint work with collaborators.
result Rigorous construction of supersymmetric path integral.
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,742 papers · 148 categories
Trend · papers per month
48 results for “rigor”
Paper provides a rigorous proof of the index theorem for economists.
problem Lack of a rigorous proof in textbooks for economists.
method Constructs a readable proof of the index theorem under specific assumptions.
result Provides a gap-free proof of the index theorem.
Deep Bayesian neural networks effectively select variables with rigorous uncertainty quantification.
problem High-dimensional variable selection with uncertainty.
method Developed new Bayesian non-parametric theorems for deep BNNs.
result BNNs can learn variable importance effectively in high dimensions and rigorously quantify uncertainty.
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.
In simulations of some economic gas-like models, the asymptotic regime shows an exponential wealth distribution, independently of the initial wealth distribution given to the system. The appearance of this statistical equilibrium for this type of gas-like models is explained in a rigorous analytical way.
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…
The authors advocate for more rigorous unsupervised cross-lingual learning methods.
problem Lack of parallel data for many languages.
method Review of unsupervised cross-lingual learning approaches and methodological issues.
result A scenario without parallel data and abundant monolingual data is unrealistic.
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.
A Rigorous Construction of the Supersymmetric Path Integral Associated to a Compact Spin Manifoldmath.DG
We give a rigorous construction of the path integral in N=1/2 supersymmetry as an integral map for differential forms on the loop space of a compact spin manifold. It is defined on the space of differential forms which can be represented by extended iterated integrals in the sense of Chen and Getzler-Jones-Petrack. Via…
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.
Develops a rigorous theory for conditional mean embeddings.
problem Efficient conditioning of probability distributions in RKHSs.
method Mathematical theory for both centred and uncentred covariance operators.
result Significantly weakens conditions for applicability of CMEs.
Explains curves and surfaces in differential geometry.
problem Understanding smooth curves and surfaces in differential geometry.
method Problem-centered, elementary, visual approach focusing on essential techniques.
result Provides a solid foundation for further study in differential geometry.
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 .
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…
Defines crisis transitions in pure exchange economies rigorously.
problem Understanding crises in economic equilibrium models.
method Uses mathematical concepts like branching, envelopes, and intrinsic derivative.
result Establishes criteria to distinguish crises from other equilibria.
Enhanced binary classifier uses Urysohn's Lemma of Topology.
problem Binary classification challenges.
method Utilizes Urysohn's Lemma of Topology to construct separating functions.
result Exceptional performance in numerical experiments (95% to 100%).
On the non-slippery slope: Some observations on a recent paper on rolling bodies published in Naturemath.DG
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.
These notes introduce key techniques in differential geometry for curves and surfaces.
problem Understanding the basics of differential geometry for curve and surface analysis.
method Problem-centered, elementary, visual approach to teaching essential techniques.
result Provides a solid foundation for further study in differential geometry.
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.
We discuss the chiral anomaly for a Weyl field in a curved background and show that a novel index theorem for the Lorentzian Dirac operator can be applied to describe the gravitational chiral anomaly. A formula for the total charge generated by the gravitational and gauge field background is derived in a mathematically…
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 with one-dimensional slow variable . Our validation procedure is based on topological tools called isolatin…
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…
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.
We introduce a general constructive setting of the density ratio estimation problem as a solution of a (multidimensional) integral equation. In this equation, not only its right hand side is known approximately, but also the integral operator is defined approximately. We show that this ill-posed problem has a rigorous …
Clustering of solutions in the symmetric binary perceptroncond-mat.dis-nn
The study finds dense clusters of solutions in a simple neural network model, providing bounds for their existence.
problem Exploring the existence of minimizers in a simple neural network model with binary weights.
method Formulating the learning problem as a constraint satisfaction problem and computing moment bounds for the existence of solutions.
result First rigorous steps toward proving the existence of dense clusters of solutions in certain parameter regimes.
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…
We give a rigorous analysis of the statistical behavior of gradients in a randomly initialized fully connected network N with ReLU activations. Our results show that the empirical variance of the squares of the entries in the input-output Jacobian of N is exponential in a simple architecture-dependent constant beta, gi…
A Complete Derivation of Complex Circle Manifold (CCM) Riemannian manifold Optimization Equationsmath.OC
Derives key CCM manifold equations for optimization.
problem Lack of rigorous derivation for CCM manifold equations.
method Systematic and rigorous proof of CCM properties.
result Unified reference for CCM Manifold Optimization.
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 …
Machine learning should incorporate maximum likelihood for better estimation.
problem Lack of rigorous foundational theory in machine learning.
method Integrate maximum likelihood estimation into machine learning models.
result Foundationally rigorous machine learning models have greater practical impact.
Survey on finite dimensional Lie groups over real numbers.
problem Lack of rigorous proofs for Lie groups using tangent space formalism.
method Formalism of tangent space via chart and vector methods, curve and derivation methods.
result Rigorous proofs of Lie groups facts with this formalism.
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. …
In a rigorous construction of the path integral for supersymmetric quantum mechanics on a Riemann manifold, based on Bär and Pfäffle's use of piecewise geodesic paths, the kernel of the time evolution operator is the heat kernel for the Laplacian on forms. The path integral is approximated by the integral of a form on …
Nash's theorem proved with Günther's trick
problem Proving Nash's smooth embedding theorem
method Using Günther's trick
result Nash's theorem proved
Skeins on Branesmath.SG
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 …
Stacks in Poisson Geometrymath.DG
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…
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 …
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.
Rough SABR Forward Market Modelq-fin.MF
Enhances swaption modeling with rough stochastic volatility.
problem Modeling swaption volatility in post-LIBOR markets.
method Introduces rough stochastic volatility into FMM and rigorously justifies the freezing approximation.
result Establishes a new framework connecting FMM to rough Bergomi for forward swap rates.
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.
No free lunch theorem formalized for tensor network models.
problem Understanding limitations of tensor network machine learning models.
method Formalized rigorous no-free-lunch theorem for specific tensor network models.
result Revealed intrinsic limitations of tensor network-based learning models.