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

3897781,1661,555 · Jun 202019922001200920172026
48 results for realizable learning

Study compares adaptive vs fixed query learning methods.

problem Comparing adaptive and fixed query learning methods for task approximation.
method Examined in-context and agentic learning in two settings: unrestricted and realizable.
result Adaptivity does not hinder performance in unrestricted setting but can in realizable setting.

New active learning framework for multiclass classification beyond realizability assumption.

problem Active learning in non-realizable settings with convex model classes.
method Surrogate risk minimization, epoch-based fitting, aggregation of models.
result Achieves label and sample complexity comparable to prior work in non-realizable settings.

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 this paper we formulate a regression problem to predict realized volatility by using option price data and enhance VIX-styled volatility indices' predictability and liquidity. We test algorithms including regularized regression and machine learning methods such as Feedforward Neural Networks (FNN) on S&P 500 Index a…

2019-09-22abs ↗pdf ↗

The study compares econometric and deep learning models for forecasting COMEX copper futures volatility.

problem Forecasting volatility of COMEX copper futures across different time intervals.
method Econometric models (GARCH, HAR) and deep learning models (RNN, LSTM, GRU) applied to daily and hourly data.
result Deep learning models outperform econometric models in hourly data, but HAR remains the best overall for daily data.

Study of loss functions for learning to defer, proving consistency.

problem Learning to defer in machine learning.
method Introduced a family of surrogate losses parameterized by ΨΨ and proved their consistency.
result Proved realizable HH-consistency and Bayes-consistency of specific surrogate losses.

New algorithms estimate Q-functions under partial coverage and realizability, improving offline RL guarantees.

problem Offline RL with limited exploration and assumptions about data coverage and Q-function realizability.
method Proposes minimax learning algorithms to estimate soft or vanilla Q-functions with L2L^2-convergence guarantees.
result PAC guarantees for offline RL under partial coverage and realizability conditions.

We consider the problem of learning a realization for a linear time-invariant (LTI) dynamical system from input/output data. Given a single input/output trajectory, we provide finite time analysis for learning the system's Markov parameters, from which a balanced realization is obtained using the classical Ho-Kalman al…

2018-06-14abs ↗pdf ↗

New DP algorithms achieve near-optimal regret bounds for online learning problems.

problem Online learning problems with zero-loss solutions and differential privacy constraints.
method Developed new Differentially Private algorithms with near-optimal regret bounds.
result Achieved near-optimal regret bounds for various online prediction and convex optimization problems.

New RL method learns to skip states in linearly qπq^π-realizable MDPs, simplifying to linear MDPs.

problem Online RL in episodic MDPs with linearly qπq^π-realizable action-values.
method Derives a novel algorithm that learns to skip states and applies a linear MDP algorithm.
result First polynomial-sample-complexity online RL algorithm for linearly qπq^π-realizable MDPs.

Paper proposes a deep learning method for better covariance matrix forecasting.

problem Suboptimal predictive performance in traditional matrix volatility forecasting.
method Riemannian-geometry-aware deep learning framework for symmetric positive definite matrices.
result Our method outperforms traditional approaches in predictive accuracy.

New offline RL method works with limited data and function approximators.

problem Sample efficiency with limited data and weak function approximators.
method Pessimistic algorithm based on version space formed by marginalized importance sampling (MIS), with gap assumption.
result Guarantees sample efficiency for simple algorithm under specific assumptions.

New algorithms for interactive learning match minimax bounds efficiently.

problem Interactive learning in the realizable setting with computational efficiency.
method General framework, computationally efficient algorithms, Monte Carlo hit-and-run sampling.
result Sample complexities quantifiable in terms of combinatorial quantities, computationally efficient.

New algorithms improve label complexity for active multi-distribution learning.

problem Active multi-distribution learning with improved label complexity.
method Developed new algorithms for active multi-distribution learning and established improved label complexity upper and lower bounds.
result Improved label complexity upper and lower bounds for active multi-distribution learning.

Lower bounds on Bayes risk for realizable models derived using information theory.

problem Deriving lower bounds on Bayes risk for realizable machine learning models.
method Information-theoretic analysis using rate-distortion theory and mutual information.
result Lower bounds on Bayes risk for realizable models, matching known bounds up to logarithmic factors.

GEEN uses deep learning to estimate unobserved variables from observed data.

problem Estimating unobserved variables in latent variable models.
method GEEN uses deep learning with Kullback-Leibler distance to map observed measurements to latent variable realizations.
result GEEN provides a method to identify and estimate latent variables in a class of models.

New method efficiently evaluates policies using trajectory data.

problem Statistically efficient policy evaluation with limited data.
method Trajectory-based approach for policy evaluation.
result Improved sample complexity for policy evaluation.

This paper studies universal rates of ERM for binary classification under agnostic learning.

problem The challenge of achieving universal rates of ERM for binary classification under agnostic learning.
method The paper explores the agnostic universal rates of ERM for binary classification, revealing three possible rates: ene^{-n}, o(n1/2)o(n^{-1/2}), or arbitrarily slow.
result The paper provides a complete characterization of which concept classes fall into each of the three categories of agnostic universal rates.

Bayesian realized EGARCH models improve tail risk forecasting.

problem Forecasting tail risks in financial markets.
method Developed a Bayesian framework for realized EGARCH models, incorporating multiple realized volatility measures and using robust adaptive Metropolis algorithm for estimation.
result Standardized skewed Student-t distribution and sub-sampled realized range models outperform other models in tail risk forecasting.

Study robust online learning with adversarial perturbations.

problem Learning robust classifiers in the presence of adversarial perturbations.
method Formulated as an online learning problem, considered both realizable and agnostic learnability, defined new dimension controlling mistake/regret bounds.
result Showed new dimension controls mistake/regret bounds, generalized to multiclass hypothesis classes.

Study improves forecast accuracy of daily volatility to enhance portfolio performance.

problem Improving predictability of realized variance from market views.
method High-dimensional machine learning models and low-dimensional factor models used to forecast firm-level volatility.
result Marginal improvements in forecast error lead to significant gains in portfolio performance.

This paper tackles deferral learning with multiple experts, providing strong theoretical guarantees.

problem Optimizing input assignment to experts balancing accuracy and computational cost.
method Introducing new surrogate loss functions and efficient algorithms with strong theoretical learning guarantees.
result Realizable HH-consistency, HH-consistency bounds, and Bayes-consistency for deferral learning.

We study realizations of Lie algebras by vector fields. A correspondence between classification of transitive local realizations and classification of subalgebras is generalized to the case of regular local realizations. A reasonable classification problem for general realizations is rigorously formulated and an algori…

2017-03-02abs ↗pdf ↗

Enhanced volatility forecasting using options data and rough volatility model.

problem Improving realized volatility forecasting accuracy.
method Infer spot volatility from options data using rough stochastic volatility model, accelerate estimation with deep learning, benchmark against traditional models.
result Augmented HAR-RV-RHeston model outperforms traditional models in daily and long-term forecasting.

Comparative learning combines realizable and agnostic settings for two hypothesis classes, reducing sample complexity.

problem Learning with two hypothesis classes in a more general setting than single hypothesis classes.
method Introduces comparative learning, defines mutual VC dimension and Littlestone dimension, and applies insights to multiaccuracy and multicalibration.
result Sample complexity of comparative learning is characterized by mutual VC dimension and Littlestone dimension.

The paper examines circle graphs of Gauss diagrams and finds counterexamples to previous descriptions.

problem Problems with previous descriptions of realizable Gauss diagrams.
method Experimental checking and formulation of new descriptions of realizable circle graphs.
result New descriptions of realizable circle graphs and an algorithm for checking realizability.

VOLARE provides standardized realized volatility measures from financial data.

problem Lack of standardized realized volatility measures from ultra-high-frequency data.
method Asset-specific pipeline for cleaning and sampling data, providing a wide range of realized estimators.
result Comprehensive set of realized estimators for equities, exchange rates, and futures.

Incorrect parity-based descriptions of realizable Gauss diagrams found, but bipartite graphs provide a valid approach.

problem Incorrect descriptions of realizable Gauss diagrams using parity conditions.
method Used bipartite graphs to describe realizable Gauss diagrams.
result Realizable Gauss diagrams can be accurately described using bipartite graphs.

The abstract discusses convergent realizations of Lie subalgebras in control theory.

problem Characterizing Lie subalgebras that can be realized as convergent vector fields.
method Generalizations and reformulations of algebraic properties for output realization.
result Recovery and clarification of previous results on control-affine systems and realization of Chen-Fliess series.

Paper tackles sample-efficient RL for linearly realizable MDPs with limited revisiting.

problem Sample-efficient reinforcement learning for linearly realizable MDPs with limited revisiting.
method Develops a new sampling protocol that allows for backtracking and revisiting states in a controlled manner.
result Achieves polynomial sample complexity scaling with feature dimension, horizon, and inverse sub-optimality gap.

Improved private agnostic learning with near-optimal sample complexity.

problem Private agnostic learning with arbitrary privacy parameters.
method Near-optimal sample complexity construction.
result Near-optimal extra sample complexity of \(\widetilde{O}(\mathrm{VC}(\mathcal{C})/α^2)\) for any \(\varepsilon \leq 1\).

Efficient RL algorithm for MDPs with linear QπQ^π realizability, achieving optimal regret bound.

problem Efficient reinforcement learning under linear QπQ^π realizability assumption for MDPs with stochastic dynamics.
method Frozen Policy Iteration algorithm that uses high-confidence data and freezes policy for well-explored states.
result Achieves optimal regret bound of O~(d2H6T)\widetilde{O}(\sqrt{d^2H^6T}) for linear (contextual) bandits.

HAR model outperforms ML in stock forecasting with correct fitting schemes.

problem Realized volatility forecasting using machine learning techniques.
method Investigated the role of fitting schemes in HAR model performance, focusing on training window and re-estimation frequency.
result HAR model consistently outperforms ML models when using a correctly specified fitting approach.

Paper integrates real data into probabilistic models using Fourier transform.

problem Learning from constrained data sets in high dimensions.
method Functional approach based on weak formulation of Fourier transform of probability measures.
result Estimation of posterior probability measures for QoI and QoI with control parameter.

We give a characterization of conformal classes realizing a compact manifold's Yamabe invariant. This characterization is the analogue of an observation of Nadirashvili for metrics realizing the maximal first eigenvalue, and of Fraser and Schoen for metrics realizing the maximal first Steklov eigenvalue.

2014-11-02abs ↗pdf ↗

New bandit algorithm works without realizability assumption.

problem Contextual bandit problems without realizability assumption.
method Computes a constrained regression problem in every epoch, ensuring similar regret guarantees as realizability-based algorithms.
result Ensures similar regret guarantees as realizability-based algorithms, up to a misspecification term.