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

4448881,3321,776 · Jun 202019922001200920172026
48 results for functional learning

Wide neural networks can learn complex functions like gravitational force law.

problem Learning complex functions like gravitational force law with neural networks.
method Extending theoretical bounds to analytic functions on the sphere using SGD and ReLU networks.
result Wide ReLU networks can learn analytic functions efficiently with proportional number of samples.

New approach to bilevel optimization for machine learning using functional methods.

problem Solving bilevel optimization problems in machine learning, especially with over-parameterized neural networks.
method Functional point of view, scalable and efficient algorithms for functional bilevel optimization.
result Demonstrates benefits of functional approach on instrumental regression and reinforcement learning tasks.

When fitting Bayesian machine learning models on scarce data, the main challenge is to obtain suitable prior knowledge and encode it into the model. Recent advances in meta-learning offer powerful methods for extracting such prior knowledge from data acquired in related tasks. When it comes to meta-learning in Gaussian…

2019-01-23abs ↗pdf ↗

Paper introduces a new curriculum generation method for reinforcement learning.

problem Improving reinforcement learning performance and speed through curriculum learning.
method The paper proposes a novel curriculum generation paradigm based on progression and mapping functions.
result Empirical results show the new approach outperforms state-of-the-art algorithms.

Develops methods to measure and set function-space learning rates in neural networks.

problem Measuring and optimizing changes in neural network output functions.
method Efficient methods to measure and set function-space learning rates, requiring minimal computational overhead.
result Demonstrates FLeRM (Function-space Learning Rate Matching) for hyperparameter transfer across model scales.

Learning a distance function or metric on a given data manifold is of great importance in machine learning and pattern recognition. Many of the previous works first embed the manifold to Euclidean space and then learn the distance function. However, such a scheme might not faithfully preserve the distance function if t…

2014-05-01abs ↗pdf ↗

Efficient offline reinforcement learning with neural networks using differentiable function approximation.

problem Statistical efficiency of offline reinforcement learning with function approximators.
method Pessimistic fitted Q-learning (PFQL) and differentiable function approximation.
result Provably efficient offline reinforcement learning with differentiable function approximation.

New algorithm learns value and advantage functions for continuous-time Markov processes without structural assumptions.

problem Learning value and advantage functions for continuous-time Markov processes without structural assumptions.
method Proposes Sobolev-prox fitted qq-learning algorithm based on Hilbert-space positive definiteness and boundedness properties of Bellman operators.
result Identifies ellipticity as a key structural property enabling reinforcement learning for Markov diffusions.

In this paper we consider the problems of supervised classification and regression in the case where attributes and labels are functions: a data is represented by a set of functions, and the label is also a function. We focus on the use of reproducing kernel Hilbert space theory to learn from such functional data. Basi…

2015-10-28abs ↗pdf ↗

Many applications that use empirically estimated functions face a curse of dimensionality, because the integrals over most function classes must be approximated by sampling. This paper introduces a novel regression-algorithm that learns linear factored functions (LFF). This class of functions has structural properties …

2014-12-19abs ↗pdf ↗

Proposes a neural network autoencoder for smoothing and representation learning of functional data.

problem Lack of sufficient nonlinear representations in existing methods for functional data analysis.
method Develops a neural network autoencoder architecture to process functional data directly, learning both smoothing and representation.
result Outperforms traditional methods in prediction, classification, and computational efficiency.

Adaptive neural networks learn functional data bases for improved performance.

problem Applying deep learning to functional data is challenging due to high dimensionality.
method Proposes adaptive neural networks with Basis Layers that learn relevant basis functions.
result Empirically outperforms other neural network approaches across various tasks.

Improves imitation learning in RL by learning reward function efficiently.

problem Lack of effective reward function approximation in AIRL for imitation tasks.
method Proposes Off-Policy AIRL that combines adversarial learning with efficient reward function approximation.
result Shows superior imitation performance and efficiency compared to state-of-the-art AIL algorithms.

Paper proposes a new loss function for PU learning without negative examples.

problem Traditional machine learning struggles with negative examples, leading to biased predictions.
method Developed a collective loss function (cPU) for positive and unlabeled data.
result The cPU consistently outperforms existing methods in PU learning benchmarks and real-world datasets.

A core operation in reinforcement learning (RL) is finding an action that is optimal with respect to a learned value function. This operation is often challenging when the learned value function takes continuous actions as input. We introduce deep radial-basis value functions (RBVFs): value functions learned using a de…

2020-02-05abs ↗pdf ↗

Develops hierarchical reinforcement learning value function approximators.

problem Estimating long-term returns in reinforcement learning with multiple goals.
method Introduces hierarchical universal value function approximators (H-UVFAs) using the options framework.
result Demonstrates generalization and improved performance of H-UVFAs over UVFAs.

New algorithms improve distributional TD learning with linear approximations.

problem Estimating return distributions in reinforcement learning.
method Fine-grained analysis of linear-categorical Bellman equation, variance reduction techniques.
result Tight sample complexity bounds for distributional TD learning with linear approximations.

New neural network models learn symmetric functions of varying input sizes.

problem Learning symmetric functions with varying input sizes.
method Functional perspective on neural networks, treating symmetric functions as functions over probability measures.
result Established approximation and generalization bounds for shallow architectures that extend across input sizes.

New algorithms learn sparse set functions in non-orthogonal Fourier bases.

problem Learning sparse set functions in non-orthogonal Fourier bases.
method Novel algorithms using non-orthogonal Fourier transforms.
result At most nkklog2k+knk - k \log_2 k + k queries for kk non-zero Fourier coefficients.

This paper proposes a new global optimization algorithm using deep learning.

problem Developing efficient algorithms for global optimization of non-convex functions.
method Two-phase approach: minimization phase with model-driven deep learning, escaping phase with reinforcement learning.
result The proposed algorithm significantly outperforms classical optimization methods and handles ill-posed functions.

Proposes a method to learn both constraints and objective functions from data.

problem Data-driven inverse optimization for mixed-integer linear programs (MILPs).
method Two-stage approach: first learns constraints, then estimates objective-function weights conditioned on learned constraints.
result Proposes and validates a method for learning both objective functions and constraints from data.

The paper explores transferring functions from one data space to another.

problem Approximating a function on a new data set using a learned function from an old data set.
method Transfer learning from one data space to another, focusing on subsets of the target data space.
result Local smoothness of the function and its lifting are related.

Study nonparametric covariance function estimation for noisy data.

problem Estimating covariance function from discrete noisy data in high dimensions.
method Adaptive learning-based estimators, including deep learning.
result Established oracle inequality and convergence rates for deep learning estimators.

Temporal difference methods enable efficient estimation of value functions in reinforcement learning in an incremental fashion, and are of broader interest because they correspond learning as observed in biological systems. Standard value functions correspond to the expected value of a sum of discounted returns. While …

2019-07-05abs ↗pdf ↗

A new framework learns system design using neural features in function space.

problem Learning system design with neural feature extractors.
method Introduces feature geometry in function space, nesting technique for optimal feature approximation.
result Optimal features found from data samples using off-the-shelf architectures and optimizers.

Deep neural networks perform well on local tasks but struggle with global tasks.

problem Understanding the limitations of overparameterized deep neural networks in learning global functions.
method Introduced kk-local and kk-global functions to study the interplay between depth and function locality.
result Depth is beneficial for learning local functions but detrimental to learning global functions.

Study on distributional TD learning with linear approximations for better return estimation.

problem Estimating the return distribution of a policy in reinforcement learning.
method Finite-sample analysis of distributional TD learning with linear function approximation, using the linear-categorical Bellman equation and exponential stability arguments for products of random matrices.
result Sample complexity of linear distributional TD learning matches that of classic linear TD learning, indicating similar difficulty in estimating return distribution versus its expectation.

Proposes a new neural network architecture combining MLP and basis functions.

problem Function approximation and operator learning in scientific machine learning.
method Combines robust MLP inner functions with flexible basis functions outer functions.
result KKAN outperforms MLPs and KANs in function approximation and operator learning tasks.

Learn low-degree functions with few random queries.

problem Learning low-degree functions from limited random queries.
method Learn bounded functions f:{1,1}no[1,1]f:\{-1,1\}^n o[-1,1] of degree at most dd with L2L_2-accuracy ε\varepsilon and confidence 1δ1-δ from log(fracnδ)εd1Cd3/2logd\log( frac{n}δ)\,\varepsilon^{-d-1} C^{d^{3/2}\sqrt{\log d}} random queries.
result Learn low-degree functions efficiently with logarithmic number of random queries.

FOCaL meta-learner estimates functional treatment effects robustly.

problem Estimating heterogeneous treatment effects from functional outcomes.
method Doubly robust meta-learner FOCaL integrating functional regression.
result Direct and robust estimation of F-CATE.

Paper develops an online learning algorithm for functional data models.

problem Recovering slope functions or predictors in functional data models.
method Online regularized learning algorithm in reproducing kernel Hilbert spaces with polynomially decaying step-size.
result Established fast convergence rates for estimation error without capacity assumption.