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

160319479638 · Jun 202019922001200920172026
48 results for complexity regularization

Improved optimal regularity for harmonic almost complex structures.

problem Establishing optimal regularity for harmonic almost complex structures.
method Quantitative stratification method and rectifiability of singular strata.
result Optimal regularity theory for energy minimizing harmonic almost complex structures.

New measure shows various training techniques control model complexity.

problem Understanding how to control model complexity in deep learning.
method Developed geometric complexity measure and demonstrated its effectiveness.
result Many training techniques control geometric complexity, providing a unified framework.

Paper analyzes sample complexity of offline MABs with KL regularization.

problem Optimizing sample complexity for offline decision-making with KL-regularized metrics.
method Sharp analysis of KL-PCB, providing upper and lower bounds.
result Characterizes sample complexity for offline MABs with KL regularization.

Study of harmonic maps on 2D simplicial complexes, proving existence and regularity.

problem Existence and regularity of harmonic maps between 2D simplicial complexes.
method Extending previous work, study metrics conformal to flat or ideal hyperbolic, proving existence, uniqueness, and regularity of harmonic maps.
result Existence, uniqueness, and regularity results for harmonic maps between 2D simplicial complexes.

Researchers use estimated Kolmogorov complexity for better link prediction in graphs.

problem Improving link prediction accuracy in complex networks.
method Regularization based on an approximation of Kolmogorov complexity, which is differentiable and compatible with recent link prediction algorithms.
result The regularization method shows good performance on diverse real-world networks, but the success is likely due to an aggregation method rather than actual estimation of Kolmogorov complexity.

We describe a class (called regular) of invariant generalized complex structures on a real semisimple Lie group G. The problem reduces to the description of admissible pairs (\gk, ω), where \gk is an appropriate regular subalgebra of the complex Lie algebra \gg^{C} associated to G and ωis a closed 2-form on \gk, such t…

2010-09-06abs ↗pdf ↗

We extend the Newlander-Nirenberg theorem to manifolds with almost complex structures that have somewhat less than Lipschitz regularity. We also discuss the regularity of local holomorphic coordinates in the integrable case, with particular attention to Lipschitz almost complex structures.

2007-10-11abs ↗pdf ↗

We introduce the notion of regular finite decomposition complexity of a metric family. This generalizes Gromov's finite asymptotic dimension and is motivated by the concept of finite decomposition complexity (FDC) due to Guentner, Tessera and Yu. Regular finite decomposition complexity implies FDC and has all the perma…

2016-08-16abs ↗pdf ↗

Study shows how to balance memory and learning efficiency in continual learning.

problem Balancing memory and learning efficiency in continual learning.
method Structural regularization with Hessian-based regularization.
result Structural regularization improves statistical performance at the cost of increased memory complexity.

Within crystallization theory, two interesting PL invariants for dd-manifolds have been introduced and studied, namely {\it gem-complexity} and {\it regular genus}. In the present paper we prove that, for any closed connected PL 44-manifold MM, its gem-complexity k(M)\mathit{k}(M) and its regular genus $ \mathcal G(M)…

2015-04-03abs ↗pdf ↗

We consider complexity of Deep Neural Networks (DNNs) and their associated massive over-parameterization. Such over-parametrization may entail susceptibility to adversarial attacks, loss of interpretability and adverse Size, Weight and Power - Cost (SWaP-C) considerations. We ask if there are methodical ways (regulariz…

2019-05-31abs ↗pdf ↗

Paper analyzes sample complexity for offline ff-divergence-regularized contextual bandits.

problem Lack of tight analyses for sample complexity in offline reinforcement learning.
method Novel pessimism-based analysis for reverse KL divergence, establishing ildeO(ε1) ilde{O}(ε^{-1}) sample complexity.
result Achieves ildeO(ε1) ilde{O}(ε^{-1}) sample complexity for reverse KL divergence, surpassing existing bounds.

A Jacobi structure JJ on a line bundle LML\to M is weakly regular if the sharp map J:J1LDLJ^\sharp : J^1 L \to DL has constant rank. A generalized contact bundle with regular Jacobi structure possess a transverse complex structure. Paralleling the work of Bailey in generalized complex geometry, we find condition on a pair …

2018-06-27abs ↗pdf ↗

Improved TD learning with neural nets reduces sample complexity and overparameterization.

problem Temporal difference learning with neural networks in large state spaces.
method Projection-free and max-norm regularized Neural TD learning, with Lyapunov drift analysis.
result Max-norm regularization significantly improves TD learning's sample complexity and overparameterization.

New bounds on ReLU networks for low-regular functions.

problem Bounding approximation error for ReLU networks on low-regular functions.
method Complexity analysis of Fourier features residual networks to ReLU networks.
result Approximation error bound proportional to target function norm and inversely proportional to network width and depth.

We show that, for a closed orientable n-manifold, with n not congruent to 3 modulo 4, the existence of a CR-regular embedding into complex (n-1)-space ensures the existence of a totally real embedding into complex n-space. This implies that a closed orientable (4k+1)-manifold with non-vanishing Kervaire semi-characteri…

2018-03-22abs ↗pdf ↗

Paper analyzes NAC with neural networks for efficient policy optimization.

problem Improving sample and iteration complexity in policy optimization.
method Entropy regularization, averaging, neural network approximation, and optimization techniques.
result Entropy regularization and averaging ensure stability and sharp sample complexity bounds.

We formulate a principle for classification with the knowledge of the marginal distribution over the data points (unlabeled data). The principle is cast in terms of Tikhonov style regularization where the regularization penalty articulates the way in which the marginal density should constrain otherwise unrestricted co…

2012-10-19abs ↗pdf ↗

New iterative regularization method tackles non-smooth, non-strongly convex functionals.

problem Tackles non-smooth, non-strongly convex functionals in regularization problems.
method Primal-dual algorithm with convergence and stability analysis.
result First iterative regularization procedure for non-smooth, non-strongly convex functionals.

In this article, we describe symplectic and complex toric spaces associated to the five regular convex polyhedra. The regular tetrahedron and the cube are rational and simple, the regular octahedron is not simple, the regular dodecahedron is not rational and the regular icosahedron is neither simple nor rational. We re…

2016-11-30abs ↗pdf ↗

Unified theory for representation learning using learnable functions.

problem Insufficient theoretical understanding of unsupervised and self-supervised learning.
method Discriminative theoretical framework for analyzing sample complexity.
result Learnable regularization functions can reduce the amount of labeled data needed.

Sharp Hölder regularity found for complex Frobenius theorem coordinates.

problem Finding optimal Hölder-Zygmund regularity for complex Frobenius theorem coordinates.
method Analyzing necessary and sufficient conditions for coordinate charts achieving the theorem's structure.
result The optimal Hölder-Zygmund regularity for coordinate charts is shown to be αα.

It is known that a tube over a Kahler submanifold in a complex form is a Hopf hypersurface. In some sense the reverse statement is true: a connected compact generic immersed C^(2n-1) regular Hopf hypersurface in the complex projective plane is a tube iver an irreducible algebraic variety. In the complex hyperbolic spac…

2008-03-27abs ↗pdf ↗

Researchers compute determinants and torsions of Rumin complex in specific Lie group representations.

problem Computing determinants and torsions of Rumin complex in specific Lie group representations.
method Analyzing Schrodinger and generic representations of the (2,3,5) nilpotent Lie group.
result Computed the spectrum and zeta regularized determinant of Rumin differentials in Schrodinger representations and evaluated their alternating product in generic representations.

We expand Topological Field Theory on some special CW-complexes (brane complexes). This Brane Topological Field Theory one-to-one corresponds to infinite dimensional Frobenius Algebras, graduated by CW-complexes of lesser dimension. We define general and regular Hurwitz numbers of brane complexes and prove that they ge…

2009-04-01abs ↗pdf ↗