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

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for function class

Estimates fat-shattering dimension of aggregated function classes.

problem Understanding the complexity of aggregated function classes.
method Analyzes fat-shattering dimension of kk-fold aggregations of real-valued function classes.
result Provides upper and lower bounds on fat-shattering dimension for linear and affine function classes.

Adaptive model selection for RL with unknown function classes.

problem Model selection for RL with unknown function classes.
method Proposed adaptive algorithms that adapt to the smallest function class containing the true model.
result Cumulative regret matches that of an oracle with known function classes.

Study convexity of Mabuchi functional in big cohomology classes.

problem Convexity of Mabuchi functional in big cohomology classes.
method Defined an invariant related to transcendental Fujita approximations and established convexity under vanishing of this invariant.
result Established almost convexity along weak geodesics in big cohomology classes.

Deep networks can learn functions approximated by shallow networks, but not all functions.

problem The learnability of functions by deep neural networks and the approximation capacity of simpler classes.
method Study the connection between learnability and approximation capacity of functions by deep neural networks and simpler classes.
result A necessary condition for a function to be learnable by deep neural networks is to be approximable by shallow networks.

Symmetrizes loss functions to improve neural network robustness against noisy labels.

problem Designing robust loss functions for noisy labels in neural networks.
method Symmetrization of multi-class loss functions, focusing on cross-entropy and unhinged loss.
result The multi-class unhinged loss is the unique convex symmetric loss under suitable assumptions.

Exploits class similarity for better machine learning models with confidence labels and projective loss functions.

problem Poor model performance due to confusing similar classes.
method Exploits class similarity with confidence labels and projective loss functions.
result Improved model performance on noisy labels.

Enhances Random Forest for imbalanced functional data classification.

problem Challenges in classifying imbalanced functional data.
method Functional Random Forest with Adaptive Cost-Sensitive Splitting (FRF-ACS).
result Significantly improves minority class recall and predictive performance.

Study robust regression learning under adversarial attacks.

problem Understanding which function classes are learnable in the presence of adversarial attacks.
method Introduced a novel agnostic sample compression scheme and used fat-shattering dimension to construct adversarially robust sample compression schemes.
result Finite fat-shattering dimension classes are learnable in both realizable and agnostic settings.

New particle-based VI algorithm expands function class and improves scalability.

problem Limited function class in particle-based VI algorithms restricts flexibility and scalability.
method Introduces a functional regularization term to expand the function class and proposes PFG algorithm.
result Proposed PFG algorithm has larger function class, improved scalability, better adaptation to ill-conditioned distributions, and provable convergence.

In this paper, we focus on the separability of classes with the cross-entropy loss function for classification problems by theoretically analyzing the intra-class distance and inter-class distance (i.e. the distance between any two points belonging to the same class and different classes, respectively) in the feature s…

2019-09-16abs ↗pdf ↗

The paper proves neural networks' consistency and optimal convergence rates for various function classes.

problem Proving neural networks' consistency and optimal convergence rates for diverse function classes.
method Analyzes wide and deep ReLU neural networks trained on logistic loss and Kolmogorov-Donoho optimal function classes.
result Proves universal consistency and minimax optimal convergence rates for neural networks.

Paper proposes a loss extension for neural networks to improve OSR performance.

problem Open set recognition problem, distinguishing known and unknown classes.
method Introduces a loss function extension to find more discriminative polar representations.
result Significantly improves performance on datasets from different domains.

New model classes for function approximation by neural networks defined on domains.

problem Defining novel model classes for function approximation on bounded domains.
method Introducing weighted variation spaces to define new model classes on domains.
result New model classes are strictly larger than classical ones but maintain the same NNA rates.

We derive a class of variational functionals which arise naturally in conformal geometry. In the special case when the Riemannian manifold is locally conformal flat, the functional coincides with the well studied functional which is the integration over the manifold of the k-symmetric function of the Schouten tensor of…

2008-03-03abs ↗pdf ↗

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.

Deep networks adapt to function regularity and data distribution.

problem Understanding deep learning's adaptability to function regularity and data distribution.
method Developed nonparametric approximation and estimation theories for a broad class of functions using deep ReLU networks.
result Deep neural networks are adaptive to different regularity of functions and nonuniform data distributions.

We study the smooth structure of convex functions by generalizing a powerful concept so-called self-concordance introduced by Nesterov and Nemirovskii in the early 1990s to a broader class of convex functions, which we call generalized self-concordant functions. This notion allows us to develop a unified framework for …

2017-03-14abs ↗pdf ↗

In this paper, we provide near-optimal accelerated first-order methods for minimizing a broad class of smooth nonconvex functions that are strictly unimodal on all lines through a minimizer. This function class, which we call the class of smooth quasar-convex functions, is parameterized by a constant γ(0,1]γ\in (0,1], wher…

2019-06-27abs ↗pdf ↗

The vicinal risk minimization (VRM) principle, first proposed by \citet{vapnik1999nature}, is an empirical risk minimization (ERM) variant that replaces Dirac masses with vicinal functions. Although there is strong numerical evidence showing that VRM outperforms ERM if appropriate vicinal functions are chosen, a compre…

2018-11-11abs ↗pdf ↗

The paper computes characteristic classes for Lie group representations.

problem Computing characteristic classes for Lie group representations.
method The paper outlines a procedure to compute characteristic classes of irreducible representations of Lie groups, expressing them as polynomial functions in the highest weight.
result The paper expresses characteristic classes of Lie group representations as polynomial functions in the highest weight.

The mixture of experts (MoE) model is a popular neural network architecture for nonlinear regression and classification. The class of MoE mean functions is known to be uniformly convergent to any unknown target function, assuming that the target function is from Sobolev space that is sufficiently differentiable and tha…

2016-02-11abs ↗pdf ↗

New algorithms solve complex function optimization problems.

problem Optimizing unknown functions in competitive learning models.
method Proposed F-LCB algorithm based on UCB-type methods for nonlinear optimization.
result Regret upper bounds for the F-LCB algorithm derived from base algorithms' convergence rates.

We consider the class of all conformal mappings from a compact Riemann surface into the threedimensional or fourdimensional Euclidean space. A sequence in this class with bounded Willmore functional is shown to have a sequence of conformal transformations of the target space, such that a subsequence of the transformed …

2004-03-18abs ↗pdf ↗

Study gauged supergravity, M5-branes, and class R theories, constraining supergravity coefficients and calculating partition functions.

problem Constraints and calculations in higher-derivative supergravity and related theories.
method Holography, Chern-Simons theory, 3d-3d correspondence, wrapped M5-branes.
result Constrained coefficients in supergravity Lagrangian, calculated partition functions for class R theories.

On four-dimensional closed manifolds we introduce a class of canonical Riemannian metrics, that we call weak harmonic Weyl metrics, defined as critical points in the conformal class of a quadratic functional involving the norm of the divergence of the Weyl tensor. This class includes Einstein and, more in general, harm…

2018-10-16abs ↗pdf ↗

We study a Boltzmann's type entropy functional (which appeared in existing literature) defined on Kähler metrics of a fixed Kähler class. The critical points of this functional are gradient Kähler-Ricci solitons, and the functional was known to be monotonically increasing along the Kähler-Ricci flow in the canonical cl…

2016-05-25abs ↗pdf ↗

Study stabilizers of smooth functions on surfaces, focusing on Morse-Bott functions.

problem Understanding the homotopy type of stabilizers of smooth functions on surfaces.
method Analyzing the homotopy properties of stabilizers for a specific class of smooth functions.
result The homotopy type of the connected component of the identity map of the stabilizer is completely described for Morse-Bott functions.

It is well known that quasi-isometric embeddings of Gromov hyperbolic spaces induce topological embeddings of their Gromov boundaries. A more general question is to detect classes of functions between Gromov hyperbolic spaces that induce continuous maps between their Gromov boundaries. In this paper we introduce the cl…

2015-06-27abs ↗pdf ↗