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

3797591,1381,517 · Jun 202019922001200920172026
48 results for general 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.

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 ↗

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 ↗

Paper develops efficient algorithms for zero-sum Markov games with general function classes.

problem Challenging settings in zero-sum Markov games with parameterized value functions or models.
method Developed new model-free and model-based algorithms for decoupled and coordinated settings.
result Improved sample complexity and regret bounds for various settings.

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 ↗

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 ↗

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.

The paper analyzes risk bounds and Rademacher complexity in batch RL.

problem Estimating/minimizing Bellman error with general value function approximation.
method Characterizes generalization performance using Rademacher complexities of function classes.
result Risk bounds and Rademacher complexities provide insights into batch RL.

Study dynamic risk measures and performance indices using distortion functions.

problem Investigate time consistency of dynamic risk measures and performance indices generated by distortion functions.
method Analyze dynamic coherent risk measures (DCRMs) and dynamic weighted value at risk measures, proving their equivalence. Establish properties of families of DCRMs generated by distortion functions and define corresponding dynamic coherent acceptability indices (DCAIs). Examine time consistency of DCRMs and DCAIs.
result DCRM generated by distortion functions are sub-martingale time consistent but not super-martingale time consistent and not weakly acceptance time consistent.

The paper provides a new uniform tail bound for empirical processes.

problem Developing a uniform tail bound for empirical processes indexed by a class of functions.
method Introducing a deflation step to the standard generic chaining argument, and using a natural seminorm based on Cramér functions.
result Established a new uniform tail bound for empirical processes.

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.

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.

Develops uniform convergence guarantees for a broad class of risk functionals in supervised learning.

problem Bounding generalization gaps for various risk functionals beyond the expectation.
method Establishes uniform convergence for Hölder risk functionals, providing guarantees for empirical risk minimization.
result First uniform convergence results for estimating the CDF of loss distributions, applicable to various risk functionals.

Paper calculates eigenvalue decay rates for neural network kernels on general domains.

problem Determining eigenvalue decay rates for neural network kernels on arbitrary domains.
method Proved dynamics of wide neural networks approximates NTK on general domains, used minimax optimality and interpolation spaces.
result Provided strategy to calculate eigenvalue decay rates for neural network kernels.

An elementary proof shows submodular functions can be represented as measure suprema.

problem Representing submodular functions as supremum of measures.
method Elementary proof using standard extension theorem of measures.
result Submodular functions can be expressed as supremum of measures.

Optimal algorithm for maximizing rewards in contextual bandits with resource constraints.

problem Maximizing rewards in contextual bandits with resource constraints.
method Proposed a universal and optimal algorithmic framework for CBwK by reducing it to online regression.
result Established the optimality of the proposed algorithm for various function classes.

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.

New algorithm reduces RL complexity with low switching costs.

problem Exploration-exploitation dilemma in RL with complex models.
method Monotonic Q-Learning with Upper Confidence Bound (MQL-UCB) for RL with general function approximation.
result Achieves minimax optimal regret of O(dHK)O(d\sqrt{HK}) and near-optimal policy switching cost.

We prove super-quadratic lower bounds for the growth of the filling area function of a certain class of Carnot groups. This class contains groups for which it is known that their Dehn function grows no faster than n2lognn^2\log n. We therefore obtain the existence of (finitely generated) nilpotent groups whose Dehn functio…

2010-04-16abs ↗pdf ↗

New insights on eluder dimension for function approximation in machine learning.

problem Complexity measure for online bandits and reinforcement learning with function approximation.
method Study the relationship between eluder dimension and generalized rank for different activation functions.
result Eluder dimension can be exponentially smaller or larger than generalized rank depending on the activation function.

We discuss a special class of solutions to the minimal surface system. These are vector-valued functions that "decrease area" and are natural generalization of scalar functions. After defining area-decreasing maps, we show several classical results for the minimal surface equation can be generalized. We also conjecture…

2003-03-04abs ↗pdf ↗

We present a simple generative framework for learning to predict previously unseen classes, based on estimating class-attribute-gated class-conditional distributions. We model each class-conditional distribution as an exponential family distribution and the parameters of the distribution of each seen/unseen class are d…

2017-07-25abs ↗pdf ↗

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 investigate classification results for general quadratic functions on torsion abelian groups. Unlike the previously studied situations, general quadratic functions are allowed to be inhomogeneous or degenerate. We study the discriminant construction which assigns, to an integral lattice with a distinguished characte…

2003-01-06abs ↗pdf ↗

The paper studies continuous submodular functions and their optimization.

problem Maximizing continuous submodular functions in poly. time.
method Characterization of continuous submodularity, operations preserving it, and algorithms for constrained maximization.
result Continuous submodularity is equivalent to a weak DR property, leading to continuous DR-submodular functions with the full DR property.

This paper establishes minimax rates for online regression with arbitrary classes of functions and general losses. We show that below a certain threshold for the complexity of the function class, the minimax rates depend on both the curvature of the loss function and the sequential complexities of the class. Above this…

2015-01-26abs ↗pdf ↗

New Zap Q-learning accelerates reinforcement learning with neural networks.

problem Accelerate convergence of reinforcement learning algorithms.
method Introduces a new framework for analysis of stochastic approximation algorithms, proving consistency under non-degeneracy assumption.
result Zap Q-learning with neural network function approximation converges quickly and is robust to function approximation architecture choice.

Paper proposes anomaly detection using Eigentraces and one-class classification.

problem Detect anomalies in system call trace data for Linux OS.
method One-class classification with Eigentraces feature extraction, Radial Basis Function neural network, and Random Forest.
result High performance in detecting anomalies and normal activities.

Topological twists for 4d N=2 theories depend on spacetime type, gerbe connections, and generalized spin-c structures.

problem Defining topologically twisted partition functions for 4d N=2 theories.
method Topological twisting for general 4d N=2 theories, introducing generalized spin-c structures.
result Topological partition functions depend on spacetime type, gerbe connections, and generalized spin-c structures.

Improved generalization bounds for CNNs using Rademacher complexity.

problem Establishing non-vacuous generalization bounds for deep learning models.
method Rademacher complexity framework with novel contraction lemmas for high-dimensional mappings.
result Enhanced generalization bounds for a broader class of activation functions.

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.

We derive bounds for a notion of adversarial risk, designed to characterize the robustness of linear and neural network classifiers to adversarial perturbations. Specifically, we introduce a new class of function transformations with the property that the risk of the transformed functions upper-bounds the adversarial r…

2018-10-22abs ↗pdf ↗

We start by studying the distribution of (cyclically reduced) elements of the free groups Fn with respect to their abelianization (or equivalently, their integer homology class. We derive an explicit generating function, and a limiting distribution, by means of certain results (of independent interest) on Chebyshev pol…

2011-06-24abs ↗pdf ↗

The Closest Point Method for solving partial differential equations (PDEs) posed on surfaces was recently introduced by Ruuth and Merriman [J. Comput. Phys. 2008] and successfully applied to a variety of surface PDEs. In this paper we study the theoretical foundations of this method. The main idea is that surface diffe…

2012-02-14abs ↗pdf ↗

Locally maximizing orbits studied in twist maps and billiards.

problem Characterize orbits in locally maximizing class for twist maps.
method Geometric and variational analysis of orbits in the cotangent bundle of a torus or ball bundle over a sphere.
result Two generating functions for the Birkhoff billiard map have the same class of locally maximizing orbits.