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,742 papers · 148 categories

Trend · papers per month

8.6%17.1%25.7%34.3% · May 202619922001200920172026
48 results for synthetic lower bounds

Unified study of Riemannian and sub-Riemannian geometries with synthetic Ricci curvature bounds.

problem Unified framework for Riemannian and sub-Riemannian geometries.
method Study of gauge metric measure spaces.
result Unified synthetic Ricci curvature lower bounds for both Riemannian and sub-Riemannian structures.

Study compares synthetic and distributional Ricci curvature bounds.

problem Comparing synthetic and distributional approaches to lower Ricci curvature bounds.
method Analyzes synthetic via weak displacement convexity and distributional via non-negativity of Ricci-tensor.
result Distributional bounds imply entropy bounds for C1C^1 metrics and vice versa for C1,1C^{1,1} under convergence condition.

Study inradius collapsed manifolds with lower Ricci curvature bounds, proving properties of their limits.

problem Characterizing limits of inradius collapsed manifolds with lower Ricci curvature bounds.
method Analyzing families of manifolds with specific curvature and boundary conditions, proving properties of the limits.
result Limits of inradius collapsed manifolds have at most two boundary components and a lower Ricci curvature bound.

Study new Ricci bounds for metric measure spaces, preserving properties under time changes.

problem Extend Ricci bounds to non-synthetic spaces and understand their behavior under time changes.
method Introduce distribution-valued lower Ricci bounds BE1(κ,)_1(κ,\infty), prove equivalence with gradient estimates, and show preservation under time changes.
result Distribution-valued Ricci bounds BE1(κ,)_1(κ,\infty) are preserved under arbitrary time changes and imply sharp gradient estimates.

A new method uses randomized trials to estimate the strength of unobserved confounding.

problem Unobserved confounding compromises causal conclusions from non-randomized studies.
method Designs a statistical test to detect unobserved confounding strength and estimates a lower bound.
result Estimates an asymptotically valid lower bound on unobserved confounding strength.

Stability of timelike Ricci bounds in low-regularity spacetimes.

problem Stability of synthetic timelike Ricci curvature bounds under C0C^0-limits.
method Constructing smooth approximations and analyzing limiting behavior via Lorentzian optimal transport.
result Impulsive gravitational waves satisfy synthetic timelike Ricci curvature lower bounds.

Variational inference is a powerful tool for approximate inference. However, it mainly focuses on the evidence lower bound as variational objective and the development of other measures for variational inference is a promising area of research. This paper proposes a robust modification of evidence and a lower bound for…

2016-11-28abs ↗pdf ↗

The paper analyzes how synthetic data training degrades diffusion models, providing bounds and characterizing different drift regimes.

problem The degradation of performance in diffusion models trained on synthetic data.
method Theoretical analysis of score-based diffusion models, focusing on the accumulated divergence between generated and target distributions.
result Upper and lower bounds on the accumulated divergence, providing the first lower bound for diffusion models.

The paper explores sharp isoperimetric properties on non-compact spaces with Ricci bounds.

problem Sharp isoperimetric properties on non-compact spaces with Ricci bounds.
method Sharp isoperimetric comparison theorems and asymptotic isoperimetric properties.
result Almost regularity theorems and enhanced functional inequalities.

New method generates private synthetic data with optimal utility for smooth queries.

problem Achieving strong utility guarantees for meaningful downstream analysis of sensitive datasets.
method Proposes a polynomial-time algorithm for generating (ε,δ)(\varepsilon,δ)-differentially private synthetic data with minimax optimal error rates for smooth queries.
result Achieves a minimax error rate of Ok,d(nmin{1,kd})O_{k,d}(n^{-\min \{1, \frac{k}{d}\}}) for kk-smooth queries, up to a log(n)\log(n) factor.

Differentially private synthetic control estimates treatment effects while protecting privacy.

problem Estimating treatment effects on sensitive data without revealing individual information.
method Combines non-private synthetic control and differentially private empirical risk minimization.
result Private synthetic control produces accurate predictions with minimal privacy cost.

BILBO optimizes bilevel problems without repeated lower-level optimizations.

problem Challenges in bilevel optimization, especially in noisy, constrained, and derivative-free settings.
method BILevel Bayesian Optimization (BILBO) that optimizes both levels simultaneously, using confidence-bounds and function query selection.
result Theoretical and empirical evidence of BILBO's effectiveness on various problems.

Study fine Pólya-Szegő inequalities in metric spaces with applications.

problem Fine Pólya-Szegő rearrangement inequalities in metric spaces.
method Theory of Sobolev and BV functions, synthetic Ricci bounds, isoperimetric inequality.
result New geometric and functional inequalities under Ricci lower bounds.

Measure contraction property is a synthetic Ricci curvature lower bound for metric measure spaces. We consider Sasakian manifolds with non-negative Tanaka-Webster Ricci curvature equipped with the metric measure space structure defined by the sub-Riemannian metric and the Popp measure. We show that these spaces satisfy…

2015-11-30abs ↗pdf ↗

Develops optimal transport in Lorentzian spaces with synthetic curvature bounds.

problem Synthetic curvature bounds for Lorentzian spaces.
method Optimal transport, convexity analysis of entropy functionals.
result Synthetic notion of timelike Ricci curvature lower bounds.

Sharp inequality for Lorentzian spaces with timelike Ricci bounds.

problem Establishing bounds on achronal hypersurfaces in Lorentzian spaces.
method Optimal transport and synthetic TCDpe(K,N)\mathsf{TCD}^e_p(K,N) spaces.
result Sharp isoperimetric-type inequality for Lorentzian spaces.

This paper considers the quantification of the prediction performance in Gaussian process regression. The standard approach is to base the prediction error bars on the theoretical predictive variance, which is a lower bound on the mean square-error (MSE). This approach, however, does not take into account that the stat…

2016-06-13abs ↗pdf ↗

Estimates watermarked content proportions in mixed-source texts.

problem Optimally estimating the proportion of watermarked content in texts with mixed sources.
method Casting the problem as estimating a proportion parameter in a mixture model based on pivotal statistics.
result Proposes efficient estimators for watermark proportion and shows their accuracy through evaluations.

Estimates sparse topic models with improved efficiency and adaptability.

problem Estimating sparse topic models with unknown sparsity and number of topics.
method Proposes a new algorithm for efficient estimation of sparse topic models with non-negative matrices.
result Upper bound matches minimax lower bound, demonstrating optimal performance.

This work sets a universal lower bound for learning causal DAGs with atomic interventions.

problem Learning causal DAGs using only observational data results in a Markov equivalence class, requiring interventions to fully orient.
method Developed CBSP orderings and used them to prove a universal lower bound on the number of single-node interventions needed.
result The universal lower bound is within a factor of two of the minimum number of single-node interventions required to fully orient a given Markov equivalence class.

Measure contraction properties MCP(K,N)MCP(K,N) are synthetic Ricci curvature lower bounds for metric measure spaces which do not necessarily have smooth structures. It is known that if a Riemannian manifold has dimension NN, then MCP(K,N)MCP(K,N) is equivalent to Ricci curvature bounded below by KK. On the other hand, it was ob…

2014-12-14abs ↗pdf ↗

LinFACT identifies all ε-best arms in linear bandits with near-optimal efficiency.

problem Efficiently identifying multiple optimal candidates in high trial-and-error cost tasks.
method LinFACT algorithm designed for linear bandits, with information-theoretic lower bound and upper bound derivation integration.
result LinFACT achieves instance optimality, matching lower bound up to a logarithmic factor.

Study robust best-arm identification in linear bandits with lower bounds and algorithms.

problem Identify a near-optimal robust arm in linear bandits with adversarial actions.
method Propose instance-dependent lower bounds and both static and adaptive bandit algorithms.
result Sample complexity matches the lower bound and algorithms effectively identify robust arms.

We discuss various characterizations of synthetic upper Ricci bounds for metric measure spaces in terms of heat flow, entropy and optimal transport. In particular, we present a characterization in terms of semiconcavity of the entropy along certain Wasserstein geodesics which is stable under convergence of mm-spaces. A…

2017-11-06abs ↗pdf ↗

The study improves harmonic map theory for metric spaces with curvature bounds.

problem Harmonic maps between specific metric spaces with curvature constraints.
method Synthetic geometry, Optimal Transport, Heat Flow, viscosity theory.
result Established Lipschitz continuity and Bochner-Eells-Sampson inequality.

The paper tackles rested bandits with non-decreasing and concave rewards, deriving lower bounds and an efficient algorithm.

problem Studying the sample complexity and optimal strategies for rested bandits with specific reward properties.
method Deriving regret lower bounds and designing an efficient algorithm R-ed-UCB with theoretical and empirical analysis.
result An efficient algorithm R-ed-UCB with a regret bound of O~(T23)\widetilde{\mathcal{O}}(T^{\frac{2}{3}}) under certain conditions.

We consider the problem of accurately estimating the reliability of workers based on noisy labels they provide, which is a fundamental question in crowdsourcing. We propose a novel lower bound on the minimax estimation error which applies to any estimation procedure. We further propose Triangular Estimation (TE), an al…

2016-06-01abs ↗pdf ↗

Measuring Mutual Information (MI) between high-dimensional, continuous, random variables from observed samples has wide theoretical and practical applications. Recent work, MINE (Belghazi et al. 2018), focused on estimating tight variational lower bounds of MI using neural networks, but assumed unlimited supply of samp…

2019-05-08abs ↗pdf ↗

We present the first framework for Gaussian-process-modulated Poisson processes when the temporal data appear in the form of panel counts. Panel count data frequently arise when experimental subjects are observed only at discrete time points and only the numbers of occurrences of the events between subsequent observati…

2018-03-12abs ↗pdf ↗