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

188375563750 · Jun 202019922001200920172026
48 results for bounds estimation

New measure of robustness for estimators, with tight bounds for Gaussian mean estimation.

problem Developing robust statistical estimators for datasets with noise or outliers.
method Introducing empirical sensitivity as a new robustness measure and proving lower bounds for Gaussian mean estimation.
result Empirical sensitivity bounds for optimal estimators are tight, showing obstructions on mean and variance.

New lower bounds for private covariance estimation of Gaussian distributions are proven.

problem Proving tight lower bounds for private estimation tasks under differential privacy.
method Generalized fingerprinting method for exponential families and private Assouad method.
result Tight lower bounds for private covariance estimation in Frobenius and spectral norms.

Study non-asymptotic estimation bounds for LTI models with Gaussian noise.

problem Estimating parameters of LTI models with non-asymptotic error bounds.
method Sharp non-asymptotic lower bounds using Cramér-Rao and van Trees inequalities, concentration results, and differential geometric constructions.
result Sharp and rate-optimal lower bounds for mean square estimation risk.

Improves decision making by estimating bounds on potential outcomes.

problem Estimating individual treatment effects is complex and hard to estimate.
method Developed an algorithm to learn upper and lower bounds on potential outcomes that optimize an objective function defined by the decision maker.
result Our algorithm outperforms baselines, providing tighter, more reliable bounds.

Estimates for Schrödinger operators on manifolds with bounded Ricci curvature.

problem Quantifying unique continuation for Schrödinger operators on manifolds with specific curvature conditions.
method Proving quantitative unique continuation estimates for Schrödinger operators on manifolds with Ricci curvature bounded below.
result Upper bound for energy range and constant in terms of Ricci curvature and parameters of relatively dense set.

Improved bounds for discrete probability distribution estimation under the ℓ∞ norm.

problem Estimating discrete probability distributions under the ℓ∞ norm with improved bounds.
method Minimax bounds in expectation and high-probability tail bounds.
result Resolved open questions posed in Kontorovich and Painsky (JMLR, 2025), including a fully empirical tightest risk bound and identifying the worst-case extremal distribution.

The paper analyzes risk estimation methods and derives bounds for OCE risk.

problem Estimating the Optimized Certainty Equivalent (OCE) risk from samples.
method Derives mean-squared error and concentration bounds for SAA of OCE, and analyzes an efficient stochastic approximation-based estimator.
result Finite sample bounds and mis-identification probability bounds for the efficient estimator.

Lower bounds on private estimation of Gaussian covariance matrices.

problem Private estimation of Gaussian covariance matrices under various parameter regimes.
method Stein-Haff identity and fingerprinting lemma extensions.
result Lower bounds match existing upper bounds in the widest known parameters.

The paper provides gradient estimates for solutions on manifolds with integral Ricci bounds.

problem Global regularity estimates for solutions of Δu=fΔu = f on Riemannian manifolds.
method Proves LpL^p-gradient estimates under integral Ricci bounds and constructs a counterexample.
result Optimal constant lower bounds on Ricci curvature are shown in the pointwise sense.

We estimate risk measures in Markov cost processes with lower and upper bounds.

problem Estimating risk measures in infinite-horizon discounted costs within Markov processes.
method Truncation scheme and lower/upper bounds for CVaR and variance estimation.
result Upper and lower bounds for CVaR and variance estimation match up to logarithmic factors.

The study analyzes weighted manifolds with curvature bounds, proving eigenvalue estimates and inequalities.

problem Analyzing geometric properties of weighted manifolds under Ricci curvature bounds.
method Develops geometric analysis techniques on weighted Riemannian manifolds with lower 00-weighted Ricci curvature bounds.
result Proves eigenvalue estimates for Steklov and ABP inequalities on weighted manifolds.

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…

2012-07-11abs ↗pdf ↗

This work introduces a new data-driven estimator for the Bayesian Cramér-Rao bound using score matching.

problem Benchmarking the performance of statistical estimators and providing a principled metric for system design and optimization.
method Score matching technique to estimate the Bayesian Cramér-Rao bound from training data.
result Developed novel non-asymptotic bounds on the score matching error and the Bayesian CRB estimator.

The paper develops estimators for variance in graph structures using fused lasso.

problem Variance estimation in graph-structured problems.
method Developed linear time estimator for homoscedastic case and total variation regularization estimator for heteroscedastic case.
result Minimax rates and consistency for variance estimation in various graph structures.

Unified learning bound for covariate and concept shifts.

problem Generalization under distribution shift in machine learning.
method Support-agnostic definitions of covariate and concept shifts using entropic optimal transport, leading to a unified error bound applicable to various loss functions and label spaces.
result Development of estimators for shifts with concentration guarantees and the DataShifts algorithm for quantifying and estimating the error bound.

KSG mutual information estimator, which is based on the distances of each sample to its k-th nearest neighbor, is widely used to estimate mutual information between two continuous random variables. Existing work has analyzed the convergence rate of this estimator for random variables whose densities are bounded away fr…

2018-10-27abs ↗pdf ↗

Novel stability bounds for OT maps improve density estimation.

problem Estimating optimal transport maps between probability distributions.
method Developed novel stability bounds for OT maps, reducing the problem to density estimation.
result Stability bounds allow for sharper guarantees without smoothness assumptions.

New research sets the minimax lower bound for KSD estimation at sqrt(n).

problem Estimating goodness-of-fit using Kernel Stein Discrepancy (KSD) on high-dimensional spaces.
method Two complementary results proving the minimax lower bound of KSD estimation.
result The minimax lower bound of KSD estimation is n^(-1/2), indicating exponential difficulty with dimensionality.

Sharp bounds on ATE with unmeasured confounders, valid even when misspecified.

problem Bounding average treatment effects with unmeasured confounders.
method Distributionally robust optimization, double sharpness, double validity.
result Proposes estimators with robustness properties for valid bounds.

Study geometric and topological properties of Finsler manifolds with weighted Ricci curvature bounds.

problem Geometric and topological properties of Finsler metric measure manifolds with integral weighted Ricci curvature bounds.
method Establish Laplacian comparison theorem, volume comparison theorems, volume growth estimate, Gromov pre-compactness, local Dirichlet isoperimetric constant estimate.
result First Dirichlet eigenvalue estimate and gradient estimate for harmonic functions.

Improved estimator for least squares using random projections achieves smaller error.

problem Improving the accuracy of least squares solutions for large-scale problems.
method James-Stein estimator applied to Gaussian sketching of least squares problems.
result Upper and lower bounds match when SNR is small and data matrix is well-conditioned.

Eigenvalue estimates for Beltrami-Laplacian under specific curvature conditions.

problem Estimating eigenvalues of the Beltrami-Laplacian on manifolds with Bakry-Émery Ricci curvature.
method Using Bakry-Émery Ricci curvature conditions, the paper derives lower bounds for eigenvalues of the Beltrami-Laplacian.
result Lower bounds for eigenvalues of the Beltrami-Laplacian depend on curvature, gradient bounds, dimension, and diameter of the manifold.

The paper improves curvature estimates for Ricci flow solutions with bounded scalar curvature.

problem Proving curvature estimates for Ricci flow solutions with bounded scalar curvature.
method Localised weighted curvature integral estimates for solutions to Ricci flow.
result Integral curvature estimates imply a uniform bound on the spatial L2L^2 norm of the Riemannian curvature tensor.

Estimates the first eigenvalue for embedded hypersurfaces in manifolds with Ricci curvature bounds.

problem Estimating the first eigenvalue for embedded hypersurfaces in manifolds with Ricci curvature bounds.
method Establishes a lower bound for the first nonzero eigenvalue of the Laplacian on embedded hypersurfaces in a closed oriented Riemannian manifold under Ricci curvature and sectional curvature bounds.
result The estimate depends on ambient curvature bounds, normal injectivity radius, and geometry of the hypersurface.

Estimates lower bounds for isoperimetric profiles and improves on previous estimates for specific manifolds.

problem Estimating lower bounds for isoperimetric profiles of specific Riemannian manifolds.
method Explicit lower bounds for isoperimetric profiles of Riemannian product manifolds.
result Improved lower bounds for isoperimetric profiles and Yamabe constants.

Vapnik-Chervonenkis (VC) dimension is a fundamental measure of the generalization capacity of learning algorithms. However, apart from a few special cases, it is hard or impossible to calculate analytically. Vapnik et al. [10] proposed a technique for estimating the VC dimension empirically. While their approach behave…

2011-11-15abs ↗pdf ↗

We obtain a local Sobolev constant estimate for integral Ricci curvature, which enables us to extend several important tools such as the maximal principle, the gradient estimate, the heat kernel estimate and the L2L^2 Hessian estimate to manifolds with integral Ricci lower bounds, without the non-collapsing conditions.

2016-01-29abs ↗pdf ↗