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

65129194258 · Jun 202019922001200920172026
48 results for intrinsic assumptions

Paper infers intrinsic dimension from quasi-convex measurements.

problem Inferring intrinsic dimension from measurements by quasi-convex functions.
method Developed a method using filtration of Dowker complexes based on discrete data of point orderings.
result Correct intrinsic dimension can be inferred in the limit of large data under generic assumptions.

Study improves denoising score matching under relaxed manifold assumptions.

problem Improving denoising score matching under relaxed manifold assumptions.
method Model density with nonparametric Gaussian mixtures, relax manifold assumption, derive non-asymptotic bounds.
result Non-asymptotic bounds on approximation and generalization errors, rates of convergence determined by intrinsic dimension.

Generally accepted depreciation methods do not compute the intrinsic value of an asset, as they do not factor for the Time Value of Money, a key principle within financial theory. This is disadvantageous, as knowing the intrinsic value of an asset can assist with making effective purchase and sale decisions. By applyin…

2016-04-30abs ↗pdf ↗

Diffusion models learn multi-modal distributions with optimal efficiency.

problem Learning high-dimensional distributions with low-dimensional multi-modal structures.
method Score-based diffusion models, focusing on subgaussian distributions within subspaces.
result Diffusion models require O~(εk2)\widetilde{O}(\varepsilon^{-k \vee 2}) samples for 1-Wasserstein ε\varepsilon error, improving over prior guarantees.

This work proves intrinsic robustness bounds for natural image distributions.

problem Understanding the robustness of natural image distributions against adversarial attacks.
method Assumes natural image distributions are captured by conditional generative models and proves robustness bounds for classifiers.
result Shows a large gap between theoretical robustness limits and current state-of-the-art adversarial robustness.

The paper analyzes how much data points can be altered to change their rank in nearest neighbor searches.

problem Vulnerability of nearest neighbor search in high-dimensional data.
method Statistical analysis of perturbation needed to change neighbor rank.
result Derived statistical distribution of perturbation needed to modify neighbor rank.

Study finds rigidity of biconservative hypersurfaces in space forms without curvature assumptions.

problem Investigating biconservative hypersurfaces in space forms without scalar curvature assumptions.
method Introduced a novel divergence-free tensor to derive results without curvature assumptions.
result Rigidity results for biconservative hypersurfaces in space forms without scalar curvature assumptions.

Paper improves deep learning convergence rates for low-dimensional data.

problem Sub-optimal rates in deep learning due to unrealistic assumptions on intrinsic dimension.
method Introduced an entropic notion of intrinsic dimension for exponential families and demonstrated improved convergence rates.
result Test error scales as O~(n2β2β+dˉ2β(λ))\tilde{\mathcal{O}}\left(n^{-\frac{2β}{2β+ \bar{d}_{2β}(λ)}}\right), improving on best-known rates.

A new method uncovers intrinsic data structures for unsupervised domain adaptation.

problem Learning domain-aligned features can damage intrinsic target discrimination.
method Structurally Regularized Deep Clustering (H-SRDC) integrating structural source regularization.
result H-SRDC outperforms existing methods in image classification and semantic segmentation.

This paper introduces intrinsic time, a new measure of time for complex systems.

problem Traditional time measures fail to capture the dynamic nature of real-world phenomena.
method Intrinsic time uses an event-based, algorithmic framework to analyze time series data.
result Intrinsic time reveals novel structures and regularities in financial markets.

Inference-Time Scaling can be extended to domains prone to systematic failure using intrinsic statistics.

problem Scaling inference time in domains prone to systematic failure
method Intrinsic Selection (iS), Intrinsic Particle Filtering (iPF), and Particle Distillation (dPF)
result Intrinsic Selection improves engineering design selection by 20% and pass@1 by 6.1 points on average.

This paper classifies Kaehler submanifolds in hyperbolic space with low codimension.

problem Local classification of Kaehler submanifolds in hyperbolic space with low codimension.
method Intrinsic assumptions and extrinsic product of two-dimensional umbilical spheres in S^3n-1.
result Generalization of results for spherical submanifolds to hyperbolic ambient space.

Generates counterfactuals in target domain from source domain observations.

problem Cross-domain learning with domain shifts and lack of parallel datasets.
method Unsupervised, Neural Causal Models, Joint Causal Graphs, Effect-Intrinsic vs Domain-Intrinsic Variables.
result Framework generates counterfactuals that closely match ground truth.

In this paper we address the relationship between Gromov-Hausdorff limits and intrinsic flat limits of complete Riemannian manifolds. In \cite{SormaniWenger2010, SormaniWenger2011}, Sormani-Wenger show that for a sequence of Riemannian manifolds with nonnegative Ricci curvature, a uniform upper bound on diameter, and n…

2014-05-13abs ↗pdf ↗

Deep networks can adapt to intrinsic dimensionality beyond domain constraints.

problem Approximating functions on low-dimensional manifolds with high-dimensional data.
method Two-layer compositions with ReLU activation, using dimensionality reducing feature maps.
result Near optimal approximation rates depend on the complexity of the dimensionality reducing map, not the ambient dimension.

New theory shows deep networks adapt to data's intrinsic dimensionality even when data isn't on a low-dimensional manifold.

problem Existing theories on deep nonparametric regression assume data lie on a low-dimensional manifold, which is often not the case in real-world applications.
method Introduces effective Minkowski dimension to characterize the intrinsic dimension of data subsets and proves sample complexity depends on this new complexity notation.
result Deep neural networks can adapt to the effective Minkowski dimension of data, circumventing the curse of dimensionality for moderate sample sizes.

The paper proposes a least squares method for binary compressive sampling with low intrinsic dimension signals.

problem Recovering signals from binary measurements with noise and sign flips.
method Least squares decoder for signals with low generative intrinsic dimension.
result The least squares decoder achieves a sharp estimation error of O(klog(Ln)m)O(\sqrt{\frac{k\log (Ln)}{m}}) under certain conditions.

Paper establishes fast convergence theory for diffusion models under minimal assumptions.

problem Establish theoretical guarantees for diffusion models under minimal assumptions.
method Developed a convergence theory for denoising diffusion probabilistic models (DDPM) under minimal assumptions.
result Achieved convergence rate of O(d/T) for target distributions with finite first-order moment.

In this paper, we study the spectrum of quantum tubes. Under certain intrinsic assumptions of the asymptotically flat submanifold of the Euclidean space, we prove the existence of the ground state of the quantum tube. The work is a generalization of Duclos, Exner and Krejcirik (CMP, 223(1), 13-28, 2001) and ourselves(m…

2006-01-10abs ↗pdf ↗

New defense mechanism detects and mitigates poisoned regression data.

problem Vulnerability of regression models to targeted data poisoning attacks.
method Introduces N-LID, a measure of local intrinsic dimensionality to distinguish poisoned samples.
result N-LID based defense outperforms state-of-the-art methods in prediction accuracy and runtime.

Study on metric spaces with properties (ETR), (LBD) and their convergence.

problem Understanding orientability and convergence of metric measure spaces.
method Analysis of Gromov-Hausdorff and intrinsic flat convergence for spaces satisfying (ETR), (LBD).
result The pointed Gromov-Hausdorff limit coincides with the local flat limit.

We propose a novel framework for combining datasets via alignment of their intrinsic geometry. This alignment can be used to fuse data originating from disparate modalities, or to correct batch effects while preserving intrinsic data structure. Importantly, we do not assume any pointwise correspondence between datasets…

2018-09-30abs ↗pdf ↗

New method estimates deep neural network's intrinsic dimension for better generalization.

problem Estimating intrinsic dimension of deep neural networks for generalization.
method Topological data analysis (TDA) and persistent homology (PHD).
result Efficient algorithm to estimate PHD in deep neural networks.

Improved sampling for diffusion models and log-concave distributions.

problem Efficient sampling for diffusion models and log-concave distributions.
method Algorithms for sampling with δδ-error in polylog(1/δ)\mathrm{polylog}(1/δ) steps using accurate score estimates.
result Exponential improvement in complexity over previous results.

The null distance for Lorentzian manifolds was recently introduced by Sormani and Vega. Under mild assumptions on the time function of the spacetime, the null distance gives rise to an intrinsic, conformally invariant metric that induces the manifold topology. We show when warped products of low regularity and globally…

2019-09-10abs ↗pdf ↗

We derive high-probability finite-sample uniform rates of consistency for kk-NN regression that are optimal up to logarithmic factors under mild assumptions. We moreover show that kk-NN regression adapts to an unknown lower intrinsic dimension automatically. We then apply the kk-NN regression rates to establish new …

2017-07-19abs ↗pdf ↗

BDDMs eliminate noise conditioning in diffusion models, simplifying training and sampling.

problem Noise conditioning in diffusion models is ad hoc and requires unprincipled noise embeddings.
method Introduce blind denoising diffusion models (BDDMs) that do not require noise conditioning.
result BDDMs simplify training and sampling by eliminating noise conditioning.

Paper proves rigidity of convex hypersurfaces in various spaces.

problem Proving the uniqueness of convex hypersurfaces in multidimensional spaces.
method Generalizing Senkin's theorem to higher dimensions and constant curvature spaces.
result Rigidity of convex hypersurfaces in En+1E^{n+1}, n3n \ge 3.

Let MM be a closed oriented manifold of dimension nn and ωω a closed 1-form on it. We discuss the question whether there exists a Riemannian metric for which ωω is co-closed. For closed 1-forms with nondegenerate zeros the question was answered completely by Calabi in 1969. The goal of this paper is to give an answ…

2007-06-15abs ↗pdf ↗

Introduces intrinsic Hopf-Lax semigroup linking to intrinsic slope.

problem Understanding intrinsic Hopf-Lax semigroup and its relation to intrinsic slope.
method Introduces and proves the link between intrinsic Hopf-Lax semigroup and intrinsic slope.
result Intrinsic Hopf-Lax semigroup is a subsolution of Hamilton-Jacobi type equality.

Given a constant mean curvature surface that bounds a compact manifold with nonnegative scalar curvature, we obtain intrinsic conditions on the surface that guarantee the positivity of its Hawking mass. We also obtain estimates of the Bartnik mass of such surfaces, without assumptions on the integral of the squared mea…

2018-09-11abs ↗pdf ↗

Sharp estimates for mean curvature flow confirm bounded diameter conjecture.

problem Bounding the diameter of mean curvature flow in 3D.
method Quantitative estimates on second fundamental form and singular set.
result Uniform boundedness of intrinsic diameter and sharp estimates on flow properties.

Metric learning seeks a transformation of the feature space that enhances prediction quality for the given task at hand. In this work we provide PAC-style sample complexity rates for supervised metric learning. We give matching lower- and upper-bounds showing that the sample complexity scales with the representation di…

2015-05-11abs ↗pdf ↗

We prove a general essential self-adjointness criterion for sub-Laplacians on complete sub-Riemannian manifolds, defined with respect to singular measures. As a consequence, we show that the intrinsic sub-Laplacian (i.e. defined w.r.t. Popp's measure) is essentially self-adjoint on the equiregular connected components …

2017-08-31abs ↗pdf ↗

A new method estimates Schrödinger bridges without iterative simulations or neural networks.

problem Estimating the time-dependent drift between two probability distributions.
method Solving the static entropic optimal transport problem and modifying the potentials.
result The Sinkhorn bridge method provably estimates Schrödinger bridges with a rate of convergence dependent on the target measure's intrinsic dimensionality.