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

95191286381 · Jun 202019922001200920172026
48 results for Linear Realizability

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.

RNN-HAR model improves VaR forecasting with long-memory and non-linear dynamics.

problem Efficiently forecasting Value at Risk (VaR) with long-memory and non-linear realized volatility.
method Loss-based generalized Bayesian inference with Sequential Monte Carlo for model estimation and prediction.
result RNN-HAR model consistently outperforms other VaR forecasting models.

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.

TensorPlan algorithm finds δ-optimal policies with poly(H,d)(H,d) queries under linearly realizable state-value function.

problem Efficient planning in MDPs with linearly realizable state-value function.
method TensorPlan algorithm using poly((dH/δ)A)((dH/δ)^A) simulator queries.
result First algorithm with polynomial query complexity using only linear-realizability of a single competing value function.

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.

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.

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.

Study bounds noise level in linear regression with dependent data.

problem Analyzing noise level in linear regression with dependent data.
method Derive upper bounds for random design linear regression with ββ-mixing data, without realizability assumptions.
result Correctly recovers the noise level of the problem, exhibiting graceful degradation with misspecification.

Paper tackles MLR prediction error without assuming realizable models.

problem Prediction error in mixture of linear regressions without realizable assumptions.
method Developed algorithms for list-decoding MLR predictions and minimized empirical risk.
result Alternating minimization algorithm finds best fit lines in non-realizable settings.

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 ↗

In this work, we highlight a connection between the incremental proximal method and stochastic filters. We begin by showing that the proximal operators coincide, and hence can be realized with, Bayes updates. We give the explicit form of the updates for the linear regression problem and show that there is a one-to-one …

2018-07-12abs ↗pdf ↗

The paper provides a combinatorial criterion for realizing tropical pluri-canonical divisors.

problem Determining when a tropical pair corresponds to a smooth algebraic curve with a pluri-canonical divisor.
method Introducing tropical normalized covers and reducing the problem to their realizability.
result Generalizes previous work on tropical canonical divisors and incorporates recent progress on kk-differentials.

Motivated by the importance and universal character of phase singularities which are clarified recently, we study the local structure of equi-phase loci near the dislocation locus of complex valued planar and spatial waves, from the viewpoint of singularity theory of differentiable mappings, initiated by H. Whitney and…

2006-08-29abs ↗pdf ↗

Geometric framework for signed multivariate tail-dependence compatibility at various thresholds.

problem Modeling and analyzing signed multivariate tail-dependence across different thresholds.
method Developed a geometric witness framework to represent and invert signed tail families, identifying nonnegative weights and normalized masses.
result Characterization and synthesis of signed multivariate tail-dependence at finite thresholds, preserving the complete signed tail family throughout.

This study connects ReLU neural networks to toric geometry to analyze function realization.

problem Determining which continuous piecewise linear functions can be realized by ReLU neural networks.
method Established a connection between toric geometry and ReLU neural networks, defining key structures like the ReLU fan, toric variety, and Cartier divisor.
result Proved a criterion for functions realizable by unbiased shallow ReLU networks using intersection numbers.

This paper develops a general method for constructing Poisson integrators.

problem Lack of a general theory for Poisson integrators due to geometric challenges.
method Adapting structural results about symplectic realizations to create geometric approximations.
result Developed a general approach for constructing geometric integrators on Poisson manifolds.

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.

Efficient algorithm for near-optimal online learning with generalized linear functions.

problem Exponential gap between statistically optimal regret and efficient regret for some function classes.
method Computational efficient algorithm for realizable K-wise linear classification and over-parameterized polynomial featurization.
result First algorithm with log(T/σ) regret for realizable K-wise linear classification.

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.

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 algorithm tackles non-linear utility in MNL bandits with ildeO(T) ilde{O}(\sqrt{T}) regret.

problem Sequential assortment selection with intricate user-item interactions.
method Upper Confidence Bound principle for non-linear parametric utility functions, including neural networks.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) regret bound for neural network-based utilities.

In this paper, we give a weak classification of locally linear pseudofree actions of the cyclic group of order 3 on a K3K3 surface, and prove the existence of such an action which can not be realized as a smooth action on the standard smooth K3K3 surface.

2006-04-13abs ↗pdf ↗

Graph manifolds' Thurston norms are sums of linear functionals, and every such norm can be realized.

problem Understanding Thurston norms of graph manifolds and their realizability.
method Analyzing the structure of Thurston norms as sums of linear functionals and showing realizability.
result Every Thurston norm of a graph manifold can be expressed as a sum of absolute values of linear functionals with rational coefficients.

The study classifies and characterizes totally symmetric sets in the general linear group.

problem Understanding the structure and properties of totally symmetric sets in the general linear group.
method Formulated a notion of irreducibility for totally symmetric sets in the general linear group and classified them.
result Classification of irreducible totally symmetric sets and those of maximal cardinality.

Characterizes inductive bias in multi-channel linear CNNs with bounded weight norm.

problem Understanding the inductive bias in multi-channel linear convolutional networks.
method Function space characterization and empirical testing of gradient descent.
result The inductive bias depends on the number of output channels for multi-channel inputs but not for single-channel inputs.

New method tests independence with single nonstationary time series.

problem Testing independence in nonstationary nonlinear time series.
method Time-varying nonlinear regression, local long-run covariance estimation, strong Gaussian approximation.
result First framework for conditional independence testing with a single realization of a nonstationary nonlinear process.

The problem of immersing a simply connected surface with a prescribed shape operator is discussed. From classical and more recent work, it is known that, aside from some special degenerate cases, such as when the shape operator can be realized by a surface with one family of principal curves being geodesic, the space o…

2001-07-11abs ↗pdf ↗

New framework tackles stochastic latent subgroup heterogeneity in online decision-making.

problem Stochastic latent heterogeneity in online decision-making where individual responses vary with unobserved subgroups.
method Latent heterogeneous bandit framework using EM-greedy algorithm to learn subgroup probabilities and reward parameters.
result Achieves optimal estimation and classification guarantees, revealing a fundamental stochastic barrier in online decision-making.

Analyzes multi-day stock returns, showing linear volatility and mean dependence.

problem Linear dependence of volatility and mean in accumulated stock returns.
method Modified Jones-Faddy skew t-distribution analysis.
result Linear dependence of volatility and mean on the number of days of accumulation.

We present a geometric construction of central extensions of covering groups of the group of volume preserving diffeomorphisms, integrating central extensions of the Lie algebra of divergence free vector fields defined by Lichnerowicz cocycles. Certain covering spaces of non-linear Grassmannians can be realized as preq…

2010-07-31abs ↗pdf ↗

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.

Oracle-efficient algorithm for offline RL with partial data coverage.

problem Offline reinforcement learning with partial data coverage and constraints.
method PDOCRL, a primal-dual algorithm with decomposed linear-programming formulation.
result Near-optimal, near-feasible policy with \(\widetilde{\mathcal O}(ε^{-2})\) sample guarantee.

TensorPlan shows an exponential lower bound for planning in MDPs with linearly realizable value functions.

problem Finding an exponential lower bound for planning in MDPs with linearly realizable value functions.
method TensorPlan and a few action lower bound approach.
result An exponentially large lower bound is shown for planning in MDPs with linearly realizable value functions.