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

4081121161 · Jun 202019922001200920172026
48 results for High-dimensional expanders

Expander graphs have been a focus of attention in computer science in the last four decades. In recent years a high dimensional theory of expanders is emerging. There are several possible generalizations of the theory of expansion to simplicial complexes, among them stand out coboundary expansion and topological expand…

2014-08-27abs ↗pdf ↗

Expander graphs have been, during the last five decades, the subject of a most fruitful interaction between pure mathematics and computer science, with influence and applications going both ways (cf. [Lub94], [HLW06], [Lub12] and the references therein). In the last decade, a theory of "high dimensional expanders" has …

2017-12-07abs ↗pdf ↗

Explicitly constructed 3XOR instances hard for Sum-of-Squares hierarchy.

problem Hard instances for Sum-of-Squares hierarchy.
method Based on high-dimensional expanders (LSV complexes), using cosystolic expansion and local isoperimetric inequality.
result Constructs explicit 3XOR instances hard for O(logn)O(\sqrt{\log n}) levels of Sum-of-Squares hierarchy.

We investigate the high-dimensional regression problem using adjacency matrices of unbalanced expander graphs. In this frame, we prove that the 2\ell_{2}-prediction error and the 1\ell_{1}-risk of the lasso and the Dantzig selector are optimal up to an explicit multiplicative constant. Thus we can estimate a high-dim…

2010-10-12abs ↗pdf ↗

In this work we present a new local to global criterion for proving a form of high dimensional expansion, which we term cosystolic expansion. Applying this criterion on Ramanujan complexes, yields for every dimension, an infinite family of bounded degree complexes with the topological overlapping property. This answer …

2015-10-03abs ↗pdf ↗

New groups algebraically fibre with high-dimensional hyperbolic groups.

problem Finding new quasi-isometry classes of hyperbolic groups.
method Constructing infinitely many hyperbolic groups as finite-index subgroups of right-angled Coxeter groups.
result Groups algebraically fibre with finitely presented kernels, expanding finiteness properties.

Researchers expand on best subset selection theory, identifying key complexities.

problem Understanding model selection performance in high-dimensional sparse linear regression.
method Analyzing residualized signals, orthogonality, and spurious projections to establish margin conditions.
result Established necessary and sufficient margin conditions for BSS model consistency.

Expands learning paradigm to stochastic orders using Choquet-Toland distance and Variational Dominance Criterion.

problem Learning high-dimensional distributions with stochastic orders.
method Introduces Choquet-Toland distance and Variational Dominance Criterion, uses input convex maxout networks (ICMNs).
result Proposes surrogates for Choquet-Toland distance and Variational Dominance Criterion with parametric rates.

In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and prove that similar connections exist between the combinatorial expansion of a compl…

2012-07-03abs ↗pdf ↗

DIVI clusters noisy high-dimensional data with stable feature gating.

problem Challenging clustering in high-dimensional noisy data.
method Data-informed variational clustering framework combining global feature gating and adaptive structure growth.
result DIVI performs competitively under severe feature noise and remains computationally feasible.

PROBE algorithm efficiently solves sparse high-dimensional linear regression.

problem Sparse high-dimensional linear regression models with complex parameter spaces.
method Partitioned empirical Bayes ECM algorithm for computationally efficient MAP estimation.
result PROBE algorithm provides robust and efficient coordinate-wise optimization.

Proposes MIGE for accurate MI gradient estimation in high-dimensional settings.

problem Intractability of MI in continuous and high-dimensional settings.
method Score estimation of implicit distributions for gradient estimation of MI.
result MIGE provides tight and smooth gradient estimation of MI in high-dimensional settings.

New degree theory proves existence of solitons on 4D manifolds.

problem Existence of gradient expanding solitons on 4D manifolds.
method Developed new degree theory for 4D, asymptotically conical gradient expanding solitons.
result Existence of solitons asymptotic to any cone over S^3 with non-negative scalar curvature.

Improved sampling from complex distributions with reduced bias.

problem Reducing bias in high-dimensional sampling algorithms.
method Hierarchical entropy analysis to weaken assumptions and expand scope.
result Bias reduction in low-dimensional marginals scales with lower dimension, not full dimension.

We consider high-dimensional quadratic classifiers in non-sparse settings. The target of classification rules is not Bayes error rates in the context. The classifier based on the Mahalanobis distance does not always give a preferable performance even if the populations are normal distributions having known covariance m…

2015-03-16abs ↗pdf ↗

Study on the spectrum of drift Laplacian on Ricci expanders.

problem Analyzing the spectrum of the drift Laplacian on Ricci expanders.
method Investigation of discrete spectrum under proper potential function, asymptotic behavior of potential function, and computation of eigenvalues.
result Discrete spectrum of the drift Laplacian on Ricci expanders with bounded Ricci curvature.

The paper classifies expanding gradient Yamabe solitons based on scalar curvature.

problem Classifying expanding gradient Yamabe solitons based on scalar curvature.
method Rigorous analysis of scalar curvature in both cases: greater than and less than the soliton constant.
result Complete classification of nontrivial complete expanding gradient Yamabe solitons.

Study of complete space-like self-expanders in Minkovski space.

problem Characterize complete space-like self-expanders in Minkovski space.
method Use of maximum principle of Omori-Yau type to prove rigidity theorems.
result Classification of 2-dimensional complete space-like self-expanders with constant squared norm of the second fundamental form.

We derive a sharp lower bound for the scalar curvature of non-flat and non-compact expanding gradient Ricci soliton provided that the scalar curvature is non-negative and the potential function is proper. We also give an upper bound for the scalar curvature of noncompact expander when the Ricci curvature is nonpositive…

2020-01-30abs ↗pdf ↗

We give a cohomological characterisation of expander graphs, and use it to give a direct proof that expander graphs do not have Yu's property A.

2011-08-31abs ↗pdf ↗

Study classifies 4D Ricci solitons with specific curvature conditions.

problem Classifying 4D gradient steady and expanding Ricci solitons with given curvature properties.
method Asymptotically cylindrical and conical assumptions; half-harmonic and half-nonnegative isotropic curvature conditions.
result Partial classification of 4D gradient expanding Ricci solitons with half-nonnegative isotropic curvature.

We define a way of approximating actions on measure spaces using finite graphs; we then show that in quite general settings these graphs form a family of expanders if and only if the action is expanding in measure. This provides a somewhat unified approach to construct expanders. We also show that the graphs we obtain …

2016-10-19abs ↗pdf ↗

Efficiently generates models resistant to falsification.

problem Creating models that cannot be disproven by tests.
method Exploits connections between high-dimensional multicalibration and expected variational inequality problems to develop an efficient algorithm.
result First to efficiently produce online outcome indistinguishable generative models resistant to infinite classes of tests.

Study self-expanding solutions of mean curvature flow in various dimensions.

problem Characterize complete mean convex self-expanding hypersurfaces and their properties.
method Analyzing the function A2/H2|A|^2/|H|^2 and Aξ2/H2|A^ξ|^2/|H|^2 to understand the structure of self-expanders.
result Complete mean convex self-expanders are products of self-expanding curves and flat subspaces under certain conditions.

We define a relative entropy for two expanding solutions to mean curvature flow of hypersurfaces, asymptotic to the same cone at infinity. Adapting work of White and using recent results of Bernstein and Bernstein-Wang, we show that expanders with vanishing relative entropy are unique in a generic sense. This also impl…

2018-12-20abs ↗pdf ↗

This paper optimizes high-dimensional oblique splits for decision trees, enhancing performance and computational efficiency.

problem Enhancing decision tree performance and computational efficiency in high-dimensional data.
method Established Sufficient Impurity Decrease (SID) convergence for s0s_0-sparse oblique splits, proposing progressive trees for iterative refinement.
result Demonstrated that SID function class expands with s0s_0-sparsity, enabling capture of complex data-generating processes.