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

51102153204 · Jun 202019922001200920172026
48 results for Gaussian Mirror

CatNet controls FDR in LSTM models using SHAP feature importance and Gaussian mirrors.

problem Controlling False Discovery Rate (FDR) in LSTM models with feature selection.
method CatNet uses SHAP values for feature importance and Gaussian Mirror algorithm for FDR control. It introduces a kernel-based independence measure to handle feature correlations.
result CatNet reduces overfitting and improves model interpretability on simulated and real-world data.

NGMs create mirrored features to assess neural network feature importance.

problem Lack of feature relevance information in DNNs limits their applicability.
method Structured perturbation and kernel-based conditional dependence measure for feature importance evaluation.
result Controls feature selection error rate and maintains high selection power with correlated features.

Paper accelerates Bayesian few-shot classification using mirror descent.

problem Non-conjugate inference in Bayesian few-shot classification.
method Integrates mirror descent-based variational inference into Gaussian process-based few-shot classification.
result Accelerated convergence and improved uncertainty quantification.

Sharp risk bounds for early-stopping in Gaussian linear regression are derived.

problem Minimizing in-sample mean squared error in high-dimensional Gaussian linear regression.
method Early-stopped mirror descent (ESMD) with local Gaussian width bounds.
result Sharp risk bounds extend to early-stopped mirror descent for least squares estimator (LSE).

New method improves generative modeling on convex domains using regularized mirror maps and Student-t priors.

problem Challenges in generative modeling on convex domains with heavy-tailed targets.
method Mirror Flow Matching with regularized mirror maps and Student-t priors.
result Empirically outperforms baselines and achieves competitive sample quality.

Continuous-time mirror descent solves sparse phase retrieval efficiently.

problem Recovering sparse signals from magnitude-only measurements.
method Continuous-time mirror descent applied to unconstrained empirical risk minimization problem.
result Mirror descent recovers kk-sparse vectors with minimum non-zero entry order of x2/k\| \mathbf{x}^\star \|_2/\sqrt{k} from k2k^2 Gaussian measurements.

The paper develops efficient algorithms for variational inference with mixtures of isotropic Gaussians.

problem Efficiently approximating multimodal Bayesian posteriors.
method Develops a variational framework and efficient algorithms for mixtures of isotropic Gaussians.
result The approach provides accurate approximations of multimodal Bayesian posteriors while being memory and computationally efficient.

Paper uses Stochastic Mirror Descent for large-scale sparse recovery problems.

problem Statistical estimation of high-dimensional sparse parameters.
method Non-Euclidean Composite Stochastic Mirror Descent (CSMD) algorithm for solving penalized stochastic optimization problems.
result The proposed algorithm achieves optimal convergence in sparse Generalized Linear Regression problems.

Paper studies early-stopped mirror descent for noisy sparse phase retrieval.

problem Recovering a sparse signal from noisy quadratic measurements.
method Early-stopped mirror descent with hyperbolic entropy mirror map.
result Achieves nearly minimax-optimal rate of convergence for kk-sparse signals.

Proposes a new algorithm for robust learning in Schrödinger bridge problems.

problem Uncertainty in estimated learning signals in Schrödinger bridge problems.
method Variational Online Mirror Descent (OMD) framework for Schrödinger bridge problems.
result Formally proves convergence and a regret bound for the OMD formulation of Schrödinger bridge acquisition.

The MAP estimate's log-likelihood sub-optimality is hard to bound in general.

problem Bounding the expected log-likelihood sub-optimality of MAP for exponential families.
method Interpreting MAP as stochastic mirror descent and analyzing convergence rates.
result Current convergence results do not apply to standard examples of exponential families.

Bayesian methods are appealing in their flexibility in modeling complex data and ability in capturing uncertainty in parameters. However, when Bayes' rule does not result in tractable closed-form, most approximate inference algorithms lack either scalability or rigorous guarantees. To tackle this challenge, we propose …

2015-06-09abs ↗pdf ↗

Deep Gaussian Processes with polynomial kernels can collapse rapidly without proper hyperparameter tuning.

problem The collapse of Deep Gaussian Processes with polynomial kernels without careful hyperparameter tuning.
method Analysis using the Berry-Esseen Theorem and observation of prior behavior.
result The prior of a Deep Gaussian Process collapses rapidly towards zero or places negligible mass on low norm functions without proper hyperparameter tuning.

EM algorithm converges in KL divergence for exponential families via mirror descent.

problem Lack of understanding of EM's non-asymptotic convergence properties.
method Viewing EM as a mirror descent algorithm, showing convergence rates in KL divergence.
result KL divergence rates for EM in exponential families, invariant to parametrization.

DistGP models multi-robot mapping with distributed Gaussian process learning.

problem Collaborative mapping by multiple robots with limited local data.
method Sparse Gaussian process with factorisation and distributed training via GBP.
result DistGP achieves superior accuracy and robustness compared to DiNNO.

We describe mirror symmetry on higher dimensional tori, paying special attention to the behaviour of D-branes under mirror symmetry. To find the mirror D-branes the description of mirror symmetry on D-branes due to Ooguri, Oz en Yin is used. This method allows us to deal with the coisotropic D-branes recently introduce…

2001-11-06abs ↗pdf ↗

Study homological mirror symmetry for Hirzebruch surfaces using Morse homotopy.

problem Homological mirror symmetry for Hirzebruch surfaces Fk\mathbb{F}_k.
method Using Strominger-Yau-Zaslow construction and Morse homotopy.
result Homological mirror symmetry holds for Hirzebruch surfaces Fk\mathbb{F}_k.

This paper deforms complex tori and their mirrors using gerbes.

problem Deforming complex tori and their mirror partners.
method Using flat gerbes to deform complex tori and their mirrors, constructing holomorphic line bundles over deformed objects.
result Deformed complex tori and their mirrors can be studied using flat gerbes.

We study mirror symmetry of type II strings on manifolds with the exceptional holonomy groups G2G_2 and Spin(7). Our central result is a construction of mirrors of Spin(7) manifolds realized as generalized connected sums. In parallel to twisted connected sum G2G_2 manifolds, mirrors of such Spin(7) manifolds can be fou…

2019-05-04abs ↗pdf ↗

New analysis shows GMD can converge linearly under PL-like conditions.

problem Establishing linear convergence for generalized mirror descent.
method PL-based analysis for time-dependent mirrors, Taylor-series approach for stochastic GMD.
result Linear convergence of stochastic GMD under PL-like conditions.

In this article we explore some finer properties of equi-areal mirrors and introduce techniques for developing new mirror surfaces that simultaneously minimize angular and areal distortion.

2014-10-24abs ↗pdf ↗

A standard introduction to online learning might place Online Gradient Descent at its center and then proceed to develop generalizations and extensions like Online Mirror Descent and second-order methods. Here we explore the alternative approach of putting Exponential Weights (EW) first. We show that many standard meth…

2018-02-21abs ↗pdf ↗

Inference in Gaussian process (GP) models is computationally challenging for large data, and often difficult to approximate with a small number of inducing points. We explore an alternative approximation that employs stochastic inference networks for a flexible inference. Unfortunately, for such networks, minibatch tra…

2019-05-27abs ↗pdf ↗

Mirror flow optimizes separable data problems, converging to a maximum margin classifier.

problem Optimizing classification problems with separable data using mirror flow.
method Examine mirror flow on linearly separable classification problems, focusing on the horizon function of the mirror potential.
result Mirror flow converges to a maximum margin classifier for separable data under certain conditions.

Reparameterizes mirror descent as gradient descent for efficient sparse learning.

problem Efficiently training small sparse networks with mirror descent.
method Develops a framework to convert mirror descent updates into gradient descent updates on different parameters.
result Mirror descent can be reparameterized as gradient descent on modified parameters, facilitating standard backpropagation.

This paper focuses on a topological version on the Strominger-Yau-Zaslow mirror symmetry conjecture. Roughly put, the SYZ conjecture suggests that mirror pairs of Calabi-Yau manifolds are related by the existence of dual special Lagrangian torus fibrations. We explore this conjecture without reference to the special La…

1999-09-02abs ↗pdf ↗

Optimal classifiers derived from GMMs are approximated by deep neural networks.

problem Binary classification of high-dimensional overlapping Gaussian mixtures.
method Closed-form expressions for Bayes optimal decision boundaries derived from GMMs' eigenstructure. Empirical validation through synthetic and real-world data.
result Deep neural networks approximate optimal classifiers for GMMs, with decision thresholds related to covariance eigenvectors.

Find first (0,2) mirror symmetry examples on Hopf surfaces.

problem Find (0,2) mirror symmetry on compact non-Kähler manifolds.
method Use Borisov's approach with vertex algebras and chiral de Rham complex. Study Killing spinors on quadratic Lie algebras and embeddings of superconformal vertex algebras.
result Construct first (0,2) mirror pairs of Hopf surfaces.

The paper discusses a solution to homological mirror symmetry for complex tori, especially when the matrix is singular.

problem Homological mirror symmetry for complex tori, particularly when the matrix is singular.
method Proposes a new approach to define a mirror partner for complex tori of dimension n2n \geq 2 when the matrix is singular.
result Proposes a method to avoid the problem of defining a mirror partner for complex tori of higher dimensions when the matrix is singular.

Inspired by the paper on quantum knots and knot mosaics [23] and grid diagrams (or arc presentations), used extensively in the computations of Heegaard-Floer knot homology [2,3,7,24], we construct the more concise representation of knot mosaics and grid diagrams via mirror-curves. Tame knot theory is equivalent to knot…

2011-06-19abs ↗pdf ↗