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

61121182242 · Jun 202019922001200920172026
48 results for singular priors

Low-rank matrix estimation from incomplete measurements recently received increased attention due to the emergence of several challenging applications, such as recommender systems; see in particular the famous Netflix challenge. While the behaviour of algorithms based on nuclear norm minimization is now well understood…

2014-06-05abs ↗pdf ↗

ManifoldFlow relaxes fixed-spectrum Stiefel layers to learn a positive spectrum.

problem Fixed-spectrum Stiefel layers impose rigid spectral constraints.
method Introduces ManifoldFlow, a relaxation that learns a positive spectrum while keeping the basis on the Stiefel manifold.
result Learnable SPD spectrum improves performance in various settings.

Unified framework for convergence of discrete diffusion models without state space size dependence.

problem Fundamental limitations in existing convergence theory for discrete diffusion models, especially under singular priors and large vocabularies.
method Unified adjoint-equation-based framework that establishes dimension-free convergence guarantees in any integral probability metric (IPM).
result First dimension-free convergence bounds applicable to both masked and uniform priors, free of state space size SS.

A new algorithm improves posterior sampling for linear inverse problems.

problem Efficiently sampling from posterior distributions in noisy linear inverse problems.
method Proposes \pddim, a DDIM-type sampler that separately samples along singular directions of the measurement operator.
result The method converges to the Bayesian posterior conditioned on the measurements.

PAC-Bayes bounds for Gibbs posteriors derived via singular learning theory.

problem Generalization bounds for overparameterized models with data-dependent priors.
method Explicit non-asymptotic PAC-Bayes bounds using singular learning theory.
result Explicit posterior-averaged risk bounds for overparameterized models.

A new data-adaptive prior stabilizes kernel learning in operators.

problem Learning kernels in operators from data is ill-posed due to nonlocal dependence.
method Introduces a data-adaptive prior to stabilize the Bayesian posterior mean.
result The data-adaptive prior achieves a stable posterior with small noise limits.

The paper shows mean curvature flow keeps diameter bounded under certain conditions.

problem Proving the bounded diameter of hypersurfaces under mean curvature flow.
method Use of Lojasiewicz inequalities and solution of mean-convex neighbourhood conjecture.
result The intrinsic diameter stays uniformly bounded as the flow approaches the first singular time.

We study the concept of financial bubble in a market model endowed with a set of probability measures, typically mutually singular to each other. In this setting we introduce the notions of robust bubble and robust fundamental value in a consistent way with the existing literature in the case a unique prior exists. The…

2016-02-17abs ↗pdf ↗

Dropout, a stochastic regularisation technique for training of neural networks, has recently been reinterpreted as a specific type of approximate inference algorithm for Bayesian neural networks. The main contribution of the reinterpretation is in providing a theoretical framework useful for analysing and extending the…

2018-07-05abs ↗pdf ↗

A geometric account explains why 'The Dress' is ambiguous, predicting observable signatures in image processing.

problem Understanding and predicting ambiguity in image processing, particularly in intrinsic image decomposition.
method Geometric analysis of intrinsic image decomposition, focusing on the discontinuous switch in prior-mode sections.
result Predicted signatures in albedo Jacobian and Fernet curvature can be observed in various models and datasets.

We consider fundamental questions of arbitrage pricing arising when the uncertainty model is given by a set of possible mutually singular probability measures. With a single probability model, essential equivalence between the absence of arbitrage and the existence of an equivalent martingale measure is a folk theorem,…

2012-02-29abs ↗pdf ↗

A new geometric concept, the dead direction, bridges singular learning theory and information geometry.

problem The gap between singular learning theory and information geometry.
method Introducing the dead direction, a unit vector along degenerating Fisher metric, and showing its KL order can be recovered.
result The KL order of the dead direction can be recovered as the decay rate of the directional Fisher curvature, providing a handle on singular geometry.

Develops Bialynicki-Birula and Morse-Bott theory for complex analytic spaces.

problem Extending classical theories to complex analytic spaces with holomorphic C\mathbb{C}^* actions.
method Extends Bialynicki-Birula and Morse-Bott theories to non-compact complex manifolds and analytic spaces, proving existence and deriving geometric consequences.
result Existence of Bialynicki-Birula decompositions for C\mathbb{C}^*-invariant subspaces in complex manifolds.

Study on inventory management under uncertainty using smooth ambiguity preference.

problem Managing inventory under Knightian uncertainty with smooth ambiguity preference.
method Demonstrates continuous-time smooth ambiguity as the infinitesimal limit of Kalman-Bucy filtering with recursive robust utility. Solves forward-backward stochastic differential equations with quadratic growth to determine cost function. Derives value function and optimal control policy using variational inequalities and viscosity solutions. Transforms problem into two-dimensional singular control.
result Ambiguity drives decision-makers to act earlier, reducing the continuation region.

We show precompactness results for solutions to parabolic fourth order geometric evolution equations. As part of the proof we obtain smoothing estimates for these flows in the presence of a curvature bound, an improvement on prior results which also require a Sobolev constant bound. As consequences of these results we …

2011-03-21abs ↗pdf ↗

We exhibit a concentration-collapse decomposition of singularities of fourth order curvature flows, including the L2L^2 curvature flow and Calabi flow, in dimensions n4n \leq 4. The proof requires the development of several new a priori estimates. First, we develop a smoothing result for initial metrics with small ener…

2013-11-05abs ↗pdf ↗

State-space models are used in a wide range of time series analysis formulations. Kalman filtering and smoothing are work-horse algorithms in these settings. While classic algorithms assume Gaussian errors to simplify estimation, recent advances use a broader range of optimization formulations to allow outlier-robust e…

2018-03-07abs ↗pdf ↗

Generalizes randomized SVD for better matrix approximations using Gaussian vectors.

problem Computing accurate rank-k approximations of matrices with limited data.
method Extends randomized SVD to multivariate Gaussian vectors, incorporating prior knowledge and using Gaussian processes.
result Demonstrates improved accuracy in approximating matrices and Hilbert-Schmidt operators.

A novel kernel-based test detects equality versus singularity of two probability measures.

problem Detecting equality versus singularity of two probability distributions.
method Combines kernel mean and kernel covariance embeddings to construct a likelihood ratio test statistic.
result The test statistic satisfies a '0/\infty' law, vanishing under the null and diverging under the alternative.

Improved graph neural network bounds using graph diffusion matrix.

problem Empirical performance of graph neural networks on real-world graphs.
method Unified model of graph neural networks, focusing on feature diffusion matrix stability.
result Generalization bounds scale with largest singular value of feature diffusion matrix, smaller than prior bounds.

A fast method estimates Gaussian mixture components without iterative fitting.

problem Estimating the number of components in high-dimensional Gaussian mixtures.
method Center data, compute singular values, and count above a threshold.
result The estimator consistently recovers the true number of components under mild separation condition.

Let XX be a canonically polarized variety, i.e. a complex projective variety such that its canonical class KXK_{X} defines an ample $\Q-$line bundle, and satisfying the conditions G1G_1 and S2S_2. Our main result says that XX admits a Kähler-Einstein metric iff XX has semi-log canonical singularities i.e. iff XX is…

2013-04-08abs ↗pdf ↗

We extend topological recursion to twisted Higgs bundles with singularities.

problem Computing Taylor expansions of period matrices for twisted Higgs bundles.
method We introduce a twisted topological recursion on the spectral curve of a twisted Higgs bundle, encoding singularities and performing the recursion explicitly.
result The g=0g=0 twisted Eynard-Orantin differentials compute the Taylor expansion of the spectral curve's period matrix, independent of the ambient space.

We consider the wave equation on a product cone and find a joint asymptotic expansion for solutions near null and future infinities. The rates of decay seen in the expansion at future infinity are the resonances of a hyperbolic cone and were computed by the authors in a previous paper. The expansion treats an asymptoti…

2019-06-11abs ↗pdf ↗

A new method selects regions of interest in GC-MS data without prior target selection.

problem Challenges in GC-MS data analysis due to fragmentation and shared fragment ions.
method Uses a pseudo F-ratio moving window (ψψFRMV) to automatically select regions of interest.
result Algorithm can accurately identify signal regions in GC-MS data.

Learning the "blocking" structure is a central challenge for high dimensional data (e.g., gene expression data). Recently, a sparse singular value decomposition (SVD) has been used as a biclustering tool to achieve this goal. However, this model ignores the structural information between variables (e.g., gene interacti…

2016-03-19abs ↗pdf ↗

We revisit the landscape of the simple matrix factorization problem. For low-rank matrix factorization, prior work has shown that there exist infinitely many critical points all of which are either global minima or strict saddles. At a strict saddle the minimum eigenvalue of the Hessian is negative. Of interest is whet…

2020-02-27abs ↗pdf ↗

In this paper, we prove the mean-convex neighborhood conjecture for neck singularities of the mean curvature flow in Rn+1\mathbb{R}^{n+1} for all n3n\geq 3: we show that if a mean curvature flow {Mt}\{M_t\} in Rn+1\mathbb{R}^{n+1} has an Sn1×RS^{n-1}\times \mathbb{R} singularity at (x0,t0)(x_0,t_0), then there exists an $\varepsilon…

2019-10-01abs ↗pdf ↗

Adaptive PINNs improve accuracy by adding points where solutions are uncertain.

problem Inadequate sampling in PINNs leads to inaccurate solutions, especially near singularities.
method FI-PINNs use failure probability to dynamically add points, improving numerical accuracy.
result FI-PINNs achieve better accuracy through adaptive sampling, as proven by rigorous error bounds.

In this paper we introduce a sublinear conditional expectation with respect to a family of possibly nondominated probability measures on a progressively enlarged filtration. In this way, we extend the classic reduced-form setting for credit and insurance markets to the case under model uncertainty, when we consider a f…

2017-07-14abs ↗pdf ↗

Resolves conjecture on cylindrical mean curvature flows in all dimensions.

problem Mean Convex Neighborhood Conjecture for cylindrical singularities.
method Complete classification of ancient, asymptotically cylindrical flows; refined asymptotic analysis; leading mode condition; induction over thresholds.
result Establishes mean-convex neighborhood for cylindrical singularities; provides local models and canonical families.

We prove that if a family of metrics, gig_i, on a compact Riemannian manifold, MnM^n, have a uniform lower Ricci curvature bound and converge to gg_\infty smoothly away from a singular set, SS, with Hausdorff measure, Hn1(S)=0H^{n-1}(S) = 0, and if there exists connected precompact exhaustion, WjW_j, of MnSM^n \setminus S s…

2012-10-03abs ↗pdf ↗

Sparse Singular Value Decomposition (SVD) models have been proposed for biclustering high dimensional gene expression data to identify block patterns with similar expressions. However, these models do not take into account prior group effects upon variable selection. To this end, we first propose group-sparse SVD model…

2018-07-28abs ↗pdf ↗