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

94189283377 · Jun 202019922001200920172026
48 results for mean independence

New framework extends ICA for non-independent variables, identifying pairwise mean independence.

problem Non-independent variables complicating ICA recovery.
method Algebraic recovery algorithm based on least-squares optimization over the orthogonal group.
result Pairwise mean independence is identifiable, robust to independence constraints.

Paper relaxes independence assumption for non-centered data.

problem Failing to account for dependencies in data leads to model failures.
method Proposes 'Kronecker-sum-structured mean' assumption to relax zero-mean requirement.
result Models with nonconvex but unimodal log-likelihoods can be solved efficiently.

Paper optimizes approximating high-dimensional diffusions by independent coordinates.

problem Optimizing approximations of high-dimensional diffusions by independent coordinates.
method Introduces independent projection as optimal for two criteria.
result Independent projection is optimal for two criteria related to entropy and convergence.

Randomly initialized wide neural networks with zero-mean activations are nearly independent, potentially solving AI interpretability limits.

problem Measuring the limits of AI interpretability.
method Randomly initialized neural networks with large width and zero-mean activation functions.
result Neural networks with zero-mean activations are nearly independent, solving the computational no-coincidence conjecture.

This work develops a non-parametric test for relational independence in non-i.i.d. data.

problem Testing independence in relational systems where data samples are not i.i.d.
method Kernel mean embedding for relational variables, consistent non-parametric scalable kernel test.
result Empirically validated effectiveness compared to state-of-the-art tests.

New method tests CMI using deep neural networks for high-dimensional data.

problem Testing conditional mean independence in high-dimensional settings.
method Population CMI measure and bootstrap-based testing with deep generative neural networks.
result Strong empirical performance and versatility in various scenarios.

Develops a computationally tractable high-dimensional differential privacy estimator.

problem Differential privacy in high dimensions is computationally intractable.
method Combines high-dimensional robust statistics with differential privacy techniques.
result A computationally tractable algorithm with dimension-independent privacy loss.

The new notion of maturity-independent risk measures is introduced and contrasted with the existing risk measurement concepts. It is shown, by means of two examples, one set on a finite probability space and the other in a diffusion framework, that, surprisingly, some of the widely utilized risk measures cannot be used…

2007-10-20abs ↗pdf ↗

Faster convergence of kernel mean embeddings using variance information.

problem Speeding up the convergence rate of kernel mean embeddings.
method Leveraging variance information in reproducing kernel Hilbert space and estimating variance from data.
result Efficiently estimate variance information from data to achieve distribution-agnostic convergence bounds.

Policy mirror ascent achieves Nash equilibrium in mean field games without a population generative model.

problem Achieving Nash equilibrium in mean field games without a population generative model.
method Policy mirror ascent, contractive operator, single-path TD learning.
result Policy mirror ascent converges to Nash equilibrium within O~(ε2)\widetilde{\mathcal{O}}(\varepsilon^{-2}) samples.

We study inverse mean curvature flows of starshaped, mean convex hypersurfaces in warped product manifolds with a positive warping factor φ(r)\varphi(r). If φ(r)>0\varphi'(r)>0 and φ(r)0\varphi''(r)\geq 0, we show that these flows exist for all times, remain starshaped and mean convex. Plus the positivity of φ(r)\varphi''(r) and …

2016-09-30abs ↗pdf ↗

BBVI converges nearly dimensionally independent for log-concave targets.

problem Efficiently optimizing variational parameters in high-dimensional spaces.
method Proved convergence rate of BBVI with reparametrization gradient for log-concave targets.
result BBVI converges with nearly independent dimension dependence for log-concave targets.

New insights into CI tests reveal key factors for practical performance.

problem Understanding and improving CI tests in practical applications.
method Investigation of the Kernel-based Conditional Independence (KCI) test and analysis of its practical behavior.
result Errors in conditional mean embedding estimates and appropriate conditioning kernel selection are crucial for CI tests.

This paper extends the MAB problem to consider risk-reward tradeoffs.

problem Maximizing reward while accounting for risk in multi-armed bandit problems.
method Introduced the Risk Aware Lower Confidence Bound (RALCB) algorithm to solve the mean-variance MAB problem.
result The RALCB algorithm performs better than the algorithm in Sani et al. (2012) in both independent and dependent scenarios.

Develops a dynamic mean field theory for reinforcement learning.

problem Finite state and action Bayesian reinforcement learning in large state spaces.
method Analogies with statistical physics, interpreting probabilities as couplings and values as spins, solving mean field equations.
result State-action values are statistically independent in the asymptotic state space limit, with exact or approximate equations for computation.

Estimates mean dimension of neural networks to reveal interaction effects.

problem Understanding interaction effects in neural networks.
method Estimation procedure for mean dimension from datasets, analyzing layer-by-layer evolution and impact of activation functions.
result Mean dimension reveals differences in interaction magnitude across neural network architectures.

Kernelized cumulants improve statistical analysis in high-dimensional spaces.

problem Statistical analysis in high-dimensional spaces with low variance estimators.
method Extending cumulants to RKHS using tensor algebra and kernel trick.
result Kernelized cumulants provide new all-purpose statistics with computational tractability.

The paper explores how semantic independence can be captured in text embeddings using partial orthogonality.

problem Capturing semantic independence in text embeddings.
method Developed a theory and methods based on partial orthogonality to demonstrate semantic independence.
result Partial orthogonality captures semantic independence in text embeddings.

The paper develops robust tests for detecting independence in synchronous stochastic systems with finite sample guarantees.

problem Detecting independence in synchronous stochastic systems with finite sample guarantees.
method Combines confidence region estimates with permutation tests and dependence measures to detect nonlinear dependence.
result Consistent hypothesis tests for detecting independence under mild assumptions.

We study the problem of estimating the mean of a random vector XX given a sample of NN independent, identically distributed points. We introduce a new estimator that achieves a purely sub-Gaussian performance under the only condition that the second moment of XX exists. The estimator is based on a novel concept of a…

2017-02-01abs ↗pdf ↗

The paper extends mean field results to three-layer neural networks using SGD.

problem Understanding the dynamics of training three-layer neural networks with SGD.
method Extending mean field results from two-layer networks to three-layer networks with two hidden layers, using non-linear partial differential equations.
result The distributions of weights in the two hidden layers are independent.

The paper tests semantic importance in opaque models using betting.

problem Precise statistical guarantees for semantic concepts in black-box models.
method Formalizes global and local statistical importance via conditional independence and SKIT.
result Shows effectiveness and flexibility of the framework on various models.

The Lloyd-Max algorithm is a classical approach to perform K-means clustering. Unfortunately, its cost becomes prohibitive as the training dataset grows large. We propose a compressive version of K-means (CKM), that estimates cluster centers from a sketch, i.e. from a drastically compressed representation of the traini…

2016-10-27abs ↗pdf ↗

Maximum mean discrepancy (MMD), also called energy distance or N-distance in statistics and Hilbert-Schmidt independence criterion (HSIC), specifically distance covariance in statistics, are among the most popular and successful approaches to quantify the difference and independence of random variables, respectively. T…

2017-08-28abs ↗pdf ↗

In this paper, we first study the behavior of inverse mean curvature flow in Schwarzschild manifold. We show that if the initial hypersurface ΣΣ is strictly mean convex and star-shaped, then the flow hypersurface ΣtΣ_t converges to a large coordinate sphere as tt\rightarrow \infty exponentially. We also describe an a…

2012-12-18abs ↗pdf ↗

Discretizations of the mean curvature and extrinsic curvature components are constructed on piecewise flat simplicial manifolds, giving approximations for smooth curvature values in a mostly mesh-independent way. These constructions are given in combinatoric form in terms of the extrinsic hinge angles, the intrinsic st…

2016-12-22abs ↗pdf ↗

In the limit of infinite number of nodes (agents), the Itô-reduced Bouchaud-Mézard network model of economic exchange has a time-independent mean and a steady-state inverse gamma distribution. We show that for a finite number of nodes the mean is actually distributed as a time-dependent lognormal and inverse gamma is q…

2017-04-07abs ↗pdf ↗

The Freund family of distributions becomes a Riemannian 4-manifold with Fisher information as metric; we derive the induced αα-geometry, i.e., the αα-curvature, αα-Ricci curvature with its eigenvales and eigenvectors, the αα-scalar curvature etc. We show that the Freund manifold has a positive constant 0-scalar cur…

2003-11-06abs ↗pdf ↗

We give a new proof of Brakke's partial regularity theorem up to C^{1,ς} for weak varifold solutions of mean curvature flow by utilizing parabolic monotonicity formula, parabolic Lipschitz approximation and blow-up technique. The new proof extends to a general flow whose velocity is the sum of the mean curvature and an…

2011-11-03abs ↗pdf ↗

Variational Bayes (VB), also known as independent mean-field approximation, has become a popular method for Bayesian network inference in recent years. Its application is vast, e.g. in neural network, compressed sensing, clustering, etc. to name just a few. In this paper, the independence constraint in VB will be relax…

2018-03-29abs ↗pdf ↗

We present an operator-free, measure-theoretic approach to the conditional mean embedding (CME) as a random variable taking values in a reproducing kernel Hilbert space. While the kernel mean embedding of unconditional distributions has been defined rigorously, the existing operator-based approach of the conditional ve…

2020-02-10abs ↗pdf ↗