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

3416811,0221,362 · Jun 202019922001200920172026
48 results for data processing inequalities

Data processing inequalities link Fisher information to local differential privacy constraints.

problem Understanding how Fisher information scales with local differential privacy constraints.
method Developed data processing inequalities for Fisher information under local differential privacy.
result Implications for private estimation with optimal bounds and error rates.

Study introduces new Bernstein inequalities for dependent data in Hilbert spaces.

problem Learning from non-independent and non-identically distributed data.
method Data-dependent Bernstein inequalities tailored for vector-valued processes in Hilbert space.
result Achieved novel risk bounds for covariance operator estimation and operator learning.

Paper develops a new inequality for non-causal machine learning.

problem Current concentration inequalities cannot be applied to non-causal machine learning.
method Develops a framework for non-causal random fields and proves a Hoeffding-type inequality.
result Obtains a Hoeffding-type concentration inequality for non-causal random fields.

New statistical inference method for high-dimensional Hawkes processes.

problem Uncertainty evaluation of network estimates in high-dimensional point process data.
method Develops a new statistical inference procedure using concentration inequalities and martingale central limit theory.
result Characterizes the convergence rate of test statistics for high-dimensional Hawkes processes.

Develops inequalities for high-dimensional linear processes with dependent innovations.

problem Estimating high-dimensional VAR(p) systems and HAC covariance estimation.
method Concentration inequalities for ll_\infty norm of vector linear processes with sub-Weibull, mixingale innovations.
result Obtained concentration bounds for the maximum entrywise norm of lag-hh autocovariance matrices.

The data processing inequality doesn't always hold in practice, showing benefits in low-level tasks.

problem The data processing inequality suggests no benefit in pre-processing for classification.
method Theoretical and empirical study of binary classification setup with deep neural networks.
result Pre-classification processing can improve classification accuracy for any finite number of training samples.

Study hypothesis testing under quantized samples with communication constraints, achieving near-optimal sample complexity.

problem Optimizing hypothesis testing with quantized samples and communication constraints.
method Developed a polynomial-time algorithm achieving near-optimal sample complexity under communication constraints.
result Achieved near-optimal sample complexity under communication constraints, with a logarithmic factor increase over unconstrained setting.

We consider the Harnack inequality for harmonic functions with respect to three types of infinite dimensional operators. For the infinite dimensional Laplacian, we show no Harnack inequality is possible. We also show that the Harnack inequality fails for a large class of Ornstein-Uhlenbeck processes, although functions…

2012-09-07abs ↗pdf ↗

Paper sets fundamental limits for distributed covariance estimation with constrained communication.

problem Estimating high-dimensional covariance matrices in a feature-split setting with limited communication.
method Developed a Conditional Strong Data Processing Inequality (C-SDPI) to establish minimax lower bounds and an optimal estimation protocol.
result Achieved nearly optimal estimation protocol with sample and communication requirements matching lower bounds up to logarithmic factors.

The paper analyzes convergence rates of Langevin dynamics and Proximal Sampler using ΦΦ-divergence.

problem Analyzing convergence rates of Langevin dynamics and Proximal Sampler.
method Extending mixing time analyses to ΦΦ-divergence, using strong data processing inequalities.
result Convergence of ΦΦ-divergence to 0 exponentially fast along Unadjusted Langevin Algorithm and Proximal Sampler.

Study of diffusion annealed Langevin dynamics for generative models.

problem Theoretical efficiency of score-based diffusion processes.
method Rigorous construction and analysis of diffusion processes with Poincaré and logarithmic Sobolev inequalities.
result Improvement in efficiency of diffusion processes through Poincaré and logarithmic Sobolev inequalities.

The paper proves concentration inequalities for diffusion processes.

problem Proving concentration inequalities for diffusion processes.
method Analysis via the Poisson equation for a broad class of subexponentially ergodic processes.
result Demonstrates power of concentration inequalities in validating conditions for Lasso estimation and sampling algorithms.

New approach shows data memorization trade-offs in large models.

problem Data memorization in large language models and its privacy implications.
method Developed a new approach using strong data processing inequalities to prove lower bounds on memorization.
result Proved that Ω(d)Ω(d) bits of training data information must be memorized for O(1)O(1) examples, decaying with example growth.

New measures generalize existing ones, linking information and risk.

problem Linking information measures and risk in statistical decision problems.
method Introducing new families of divergence measures and deriving an information processing equality.
result Extension of variational φφ-divergence representation to multiple distributions.

Improved analysis of UCRL2 with empirical Bernstein inequality reduces exploration-exploitation regret.

problem Exploration-exploitation in communicating Markov Decision Processes.
method Analysis of UCRL2 with Empirical Bernstein inequalities (UCRL2B).
result Regret bound of O~(DΓSAT)\widetilde{O}(\sqrt{DΓS A T}) for UCRL2B.

Paper improves risk bound for MTL with graph-dependent data.

problem Sub-optimal risk bound in multi-task learning with graph-dependent data.
method Proposes a new Bennett-type inequality and develops new Talagrand-type inequality and local fractional Rademacher complexity.
result Derives a sharper risk bound of O(lognn)O(\frac{\log n}{n}).

New sparse Gaussian process method tackles unconstrained regression problems.

problem Dealing with physical systems that satisfy inequality constraints.
method Extends constrained Gaussian process by redefining hat basis functions.
result Reduces computational complexity from O(n3)O(n^{3}) to O(nm2)O(nm^{2}).

The paper proves concentration inequalities for two-sample rank processes and applies them to ranking performance criteria.

problem Measuring the performance of ranking statistics between two populations.
method Proves concentration inequalities for two-sample rank processes indexed by VC classes of scoring functions.
result Generalization capacity of empirical maximizers of ranking performance criteria is investigated.

In this paper, we propose a novel framework to analyze the theoretical properties of the learning process for a representative type of domain adaptation, which combines data from multiple sources and one target (or briefly called representative domain adaptation). In particular, we use the integral probability metric t…

2014-01-02abs ↗pdf ↗

Let $({\M}, g(t))$ be a Kähler Ricci flow with positive first Chern class. We prove a uniform isoperimetric inequality for all time. In the process we also prove a Cheng-Yau type log gradient bound for positive harmonic functions on $({\M}, g(t))$, and a Poincaré inequality without assuming the Ricci curvature is bound…

2012-03-07abs ↗pdf ↗

Quantum states can be learned efficiently using gentle measurements.

problem Efficiently learning quantum states with minimal measurements.
method Introducing α-LGM measurements and proving strong quantum DPI.
result The number of states needed for accurate learning is of order 1/(ε^2 α^2).

Study improves self-normalized bounds for vector-valued processes beyond sub-Gaussianity.

problem Limited understanding of self-normalized concentration for vector-valued processes outside sub-Gaussian frameworks.
method Developed concentration inequalities for self-normalized processes with light tails (e.g., Bennett, Bernstein bounds) for vector-valued data.
result Provided new insights and bounds for self-normalized processes with non-sub-Gaussian distributions.

Microstructure of market dynamics is studied through analysis of tick price data. Linear trend is introduced as a tool for such analysis. Trend arbitrage inequality is developed and tested. The inequality sets limiting relationship between trend, bid-ask spread, market reaction and average update frequency of price inf…

2006-07-10abs ↗pdf ↗

We prove structure theorems for complete manifolds satisfying both the Ricci curvature lower bound and the weighted Poincaré inequality. In the process, a sharp decay estimate for the minimal positive Green's function is obtained. This estimate only depends on the weight function of the Poincaré inequality, and yields …

2007-01-24abs ↗pdf ↗

Develops robust MDPs for unknown disturbances with performance guarantees.

problem Unknown disturbance distribution in MDPs.
method Empirical distribution, sublevel set of distance function, weak convergence, concentration inequality.
result Robust optimal value function converges to true optimal value function with increasing sample sizes.

Probability distributions of money, income, and energy consumption per capita are studied for ensembles of economic agents. The principle of entropy maximization for partitioning of a limited resource gives exponential distributions for the investigated variables. A non-equilibrium difference of money temperatures betw…

2009-12-24abs ↗pdf ↗

New approach to concentration inequalities for unbounded state space dynamical systems.

problem Concentration inequalities for unbounded state space dynamical systems.
method Functional analytic framework, transport-entropy inequality.
result Exponential concentration inequalities for sampling from stationary distribution.

We improve bounds for stochastic processes, especially those with heavy tails.

problem Bounding the concentration of sub-ψψ processes with heavy tails.
method Variational approach to concentration, focusing on sub-Gaussian and other tail conditions.
result First dimension-free self-normalized empirical Bernstein inequality.

We investigate properties of estimators obtained by minimization of U-processes with the Lasso penalty in high-dimensional settings. Our attention is focused on the ranking problem that is popular in machine learning. It is related to guessing the ordering between objects on the basis of their observed predictors. We p…

2015-12-17abs ↗pdf ↗

New method detects changes in high-dimensional Markov processes without explicit likelihood evaluation.

problem Quickest change detection in Markov processes with unknown transition kernels.
method Learn conditional score from sample pairs, develop score-based CUSUM procedure.
result Exponential lower bounds on mean time to false alarm and asymptotic upper bounds on detection delay.

We prove a uniform Sobolev inequality along the Sasaki-Ricci flow. In the process, we develop the theory of basic Lebesgue and Sobolev function spaces, and prove some general results about the decomposition of the heat kernel for a class of elliptic operators on a Sasaki manifold.

2011-04-06abs ↗pdf ↗

Study non-Gaussian measures' concentration properties in metric spaces.

problem Concentration properties for non-linear Gaussian functionals with non-Gaussian tails.
method Prove generalised Transportation-Cost Inequalities (TCIs) for specific functionals.
result Extended TCIs for rough volatility and Parabolic Anderson Model.

Paper analyzes statistical efficiency of TD learning in Hilbert spaces with Freedman's inequality.

problem Statistical efficiency of distributional TD learning in Hilbert spaces.
method Non-parametric distributional TD (NTD) and variance-reduced variants of NTD and CTD.
result Sharp statistical rates achieved through novel Freedman's inequality in Hilbert spaces.