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

Trend · papers per month

4998147196 · Jun 202019922001200920172026
48 results for Natarajan dimension

This research sets limits on how complex multi-class learning problems can be.

problem Understanding the complexity of multi-class classification problems.
method Established upper bounds on Natarajan dimensions for specific function classes.
result Upper bounds on Natarajan dimensions for multi-class decision trees, random forests, and neural networks.

Characterizes learnability of forgiving 0-1 loss functions in multiclass settings.

problem Understanding when multiclass learning with forgiving 0-1 loss functions is possible.
method Introduces a new combinatorial dimension based on Natarajan Dimension to determine learnability.
result A hypothesis class is learnable if and only if the Generalized Natarajan Dimension is finite.

New bounds show agnostic multiclass learning depends on two dimensions: Natarajan and Daniely-Shalev-Shwartz.

problem Understanding sample complexity in multiclass classification with agnostic learning.
method Developed a novel online procedure based on a self-adaptive multiplicative-weights algorithm.
result Agnostic sample complexity bounds are in the form of DS^(1.5)/ε + Nat/ε^2, nearly tight up to a √DS factor.

Characterizes statistical complexity of realizable regression in PAC and online learning.

problem Understanding the statistical complexity of realizable regression in both PAC and online learning settings.
method Introduces minimax instance optimal learners, novel and combinatorial dimensions to characterize learnability.
result Characterizes which classes of real-valued predictors are learnable and provides necessary conditions for learnability.

In classic fair division problems such as cake cutting and rent division, envy-freeness requires that each individual (weakly) prefer his allocation to anyone else's. On a conceptual level, we argue that envy-freeness also provides a compelling notion of fairness for classification tasks. Our technical focus is the gen…

2018-09-23abs ↗pdf ↗

Sine activation functions enable two-layer neural networks to learn modular addition more efficiently.

problem Learning modular addition with two-layer neural networks.
method Introduced and analyzed sine activation functions, providing theoretical and empirical evidence.
result Sine activation functions allow for constant-width network realizations of modular addition, whereas ReLU networks require linear width scaling.

New bounds using samplewise evaluated CMI for deep neural networks.

problem Improving generalization bounds for deep neural networks.
method Introduced a new family of information-theoretic generalization bounds using samplewise evaluated conditional mutual information (CMI).
result The new bounds can be tighter than previous ones for deep neural networks.

The predict-then-optimize framework is fundamental in many practical settings: predict the unknown parameters of an optimization problem, and then solve the problem using the predicted values of the parameters. A natural loss function in this environment is to consider the cost of the decisions induced by the predicted…

2019-05-27abs ↗pdf ↗

Many real-world decision problems are characterized by multiple conflicting objectives which must be balanced based on their relative importance. In the dynamic weights setting the relative importance changes over time and specialized algorithms that deal with such change, such as a tabular Reinforcement Learning (RL) …

2018-09-20abs ↗pdf ↗

In supervised learning one wishes to identify a pattern present in a joint distribution PP, of instances, label pairs, by providing a function ff from instances to labels that has low risk EP(y,f(x))\mathbb{E}_{P}\ell(y,f(x)). To do so, the learner is given access to nn iid samples drawn from PP. In many real world problem…

2015-04-01abs ↗pdf ↗

New algorithms reduce sample complexity for multiclass contextual bandits.

problem Designing efficient algorithms for multiclass contextual bandits with sparse rewards.
method Two complementary approaches: decision-estimation coefficient analysis and low-variance exploration.
result Achieved optimal sample complexity bounds for multiclass contextual bandits.

Smoothed analysis shows that many classes become learnable from positive-only samples.

problem Learning from positive-only samples is challenging due to negative results in worst-case settings.
method Smoothed analysis of positive-only learning, assuming samples from a reference distribution smooth with respect to the true distribution.
result All VC classes become learnable in the smoothed model with O(VC/ε2)O(VC/ε^2) positive samples for εε classification error.

Defines and classifies Thurston geometries and connects simplicial volume to Kodaira dimension.

problem Classifying Thurston geometries and understanding their properties.
method Introduces an axiomatic definition for the Kodaira dimension and studies its compatibility with traditional notions.
result Establishes a connection between the simplicial volume and the holomorphic Kodaira dimension, showing implications for smooth Kähler 3-folds.

Paper relates asymptotic dimension to cofinal dimension using coarse proximities.

problem Relating asymptotic dimension to cofinal dimension in metric spaces.
method Introducing coarse proximities and inverse limit constructions.
result Asymptotic dimension is bounded by coarse cofinal dimension and cofinal dimension of Higson corona.

Our goal in this paper is to develop an effective estimator of fractal dimension. We survey existing ideas in dimension estimation, with a focus on the currently popular method of Grassberger and Procaccia for the estimation of correlation dimension. There are two major difficulties in estimation based on this method. …

2013-12-09abs ↗pdf ↗

We introduce a new quasi-isometry invariant of metric spaces called the hyperbolic dimension, hypdim, which is a version of the Gromov's asymptotic dimension, asdim. The hyperbolic dimension is at most the asymptotic dimension, however, unlike the asymptotic dimension, the hyperbolic dimension of any Euclidean space R^…

2004-04-29abs ↗pdf ↗

In the first part of the paper we show how to relate several dimension theories (asymptotic dimension with Higson property, asymptotic dimension of Gromov, and capacity dimension of Buyalo \cite{Buyalo1}) to Nagata-Assouad dimension. This is done by applying two functors on the Lipschitz category of metric spaces: micr…

2006-01-10abs ↗pdf ↗

This paper studies three aspects around dimension datum: (1), a generalization of the dimension datum, which we call the tau-dimension datum; (2), dimension data of disconnected subgroups; (3), compactness of isospectral sets of normal homogeneous spaces.

2018-03-16abs ↗pdf ↗

Random walks on Fuchsian Schottky groups have harmonic measures with lower dimension.

problem Understanding the dimensionality of harmonic measures for random walks.
method Analyzing finite range random walks on Fuchsian Schottky groups.
result Harmonic measures have dimension strictly less than the limit set's Hausdorff dimension.

Given a metric space XX of finite asymptotic dimension, we consider a quasi-isometric invariant of the space called dimension function. The space is said to have asymptotic Assouad-Nagata dimension less or equal nn if there is a linear dimension function in this dimension. We prove that if XX is a tree-graded space …

2009-10-13abs ↗pdf ↗

The study finds limits on dimensions of certain scales and fields for conformal manifolds.

problem Limits on dimensions of almost Einstein scales and normal conformal Killing fields for conformal manifolds.
method Analyzes the submaximal dimensions of spaces of almost Einstein scales and normal conformal Killing fields for connected conformal manifolds, considering different signatures and dimensions.
result Upper bounds on dimensions of almost Einstein scales and normal conformal Killing fields are determined, with examples provided for submaximal dimensions.

Model complexity is an important factor to consider when selecting among graphical models. When all variables are observed, the complexity of a model can be measured by its standard dimension, i.e. the number of independent parameters. When hidden variables are present, however, standard dimension might no longer be ap…

2012-12-12abs ↗pdf ↗

Many 0/1 datasets have a very large number of variables; on the other hand, they are sparse and the dependency structure of the variables is simpler than the number of variables would suggest. Defining the effective dimensionality of such a dataset is a nontrivial problem. We consider the problem of defining a robust m…

2019-02-04abs ↗pdf ↗

We prove that for geometrically finite groups cohomological dimension of the direct product of a group with itself equals 2 times the cohomological dimension dimension of the group.

2019-02-08abs ↗pdf ↗

Estimates dimension of subsets from random samples, proving consistency.

problem Estimating the dimension of a compact subset from random samples.
method Consistency proofs for Minkowski, correlation, and pointwise dimensions using empirical volume function.
result Statistical consistency of estimators for various dimension notions.

The action dimension of a group G is the minimal dimension of a contractible manifold that G acts on properly discontinuously. We show that if G acts properly and cocompactly on a thick Euclidean building, then the action dimension is bounded below by twice the dimension of the building. We also compute the action dime…

2017-03-02abs ↗pdf ↗

We discuss a variation of Gromov's notion of asymptotic dimension that was introduced and named Nagata dimension by Assouad. The Nagata dimension turns out to be a quasisymmetry invariant of metric spaces. The class of metric spaces with finite Nagata dimension includes in particular all doubling spaces, metric trees, …

2004-10-04abs ↗pdf ↗

We study piecewise linear co-dimension two embeddings of closed oriented manifolds in Euclidean space, and show that any such embedding can always be isotoped to be a closed braid as long as the ambient dimension is at most five, extending results of Alexander (in ambient dimension three), and Viro and independently Ka…

2017-03-24abs ↗pdf ↗

Proves a theorem for Assouad dimension with applications to distance sets and radial projections.

problem Problems related to Assouad dimension and distance sets.
method General nonlinear projection theorem for Assouad dimension.
result Sharp estimates for sets with Assouad dimension less than 1 and exceptional set estimates.

We prove the dimension of any asymptotic cone over a metric space X does not exceed the asymptotic Assouad-Nagata dimension of X. This improves a result of Dranishnikov and Smith who showed that dim(Y) does not exceed asymptotic Assouad-Nagata dimension of X for all separable subsets Y of special asymptotic cones of X …

2006-10-10abs ↗pdf ↗

Computes dimensions of representation and character varieties for 2 and 3-dimensional orbifolds.

problem Computing dimensions of representation and character varieties for orbifolds.
method Analyzes varieties of representations and characters of hyperbolic and non-hyperbolic orbifolds, provides tools for computation.
result Shows that the dimension of a specific component of characters equals half the dimension of the variety of characters of the boundary.

Let K be a 2-dimensional finite flag complex. We study the CAT(0) dimension of the `Bestvina-Brady group', or `Artin kernel', Gamma_K. We show that Gamma_K has CAT(0) dimension 3 unless K admits a piecewise Euclidean metric of non-positive curvature. We give an example to show that this implication cannot be reversed. …

2002-11-07abs ↗pdf ↗

This survey reviews dimension estimation methods for datasets.

problem Understanding the intrinsic dimension of high-dimensional datasets.
method Categorizes dimension estimation methods by geometric information: tangential, parametric, and topological.
result Many dimension estimation methods may overfit and not generalize well.