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

3917821,1721,563 · Jun 202019922001200920172026
48 results for pure linear models

Optimizes pure exploration in linear bandits with a new algorithm.

problem Best-arm identification in linear stochastic bandits.
method Developed the first asymptotically optimal algorithm for fixed-confidence pure exploration in linear bandits.
result Avoids the pitfall of a simple but difficult instance and bypasses the need to solve an optimal design problem.

New algorithms for model selection in linear bandits adapt to instance complexity.

problem Adapting to the instance-dependent complexity of the true model in linear bandits.
method Design of algorithms in fixed confidence and fixed budget settings, leveraging experimental design and selection-validation procedures.
result Near instance optimal guarantees for model selection in linear bandits.

Improved confidence bounds for linear logistic model with applications to bandits.

problem Improving confidence bounds for linear logistic model.
method Self-concordant analysis of the logistic loss to avoid dependence on worst-case variance.
result Significant improvement in confidence bounds, avoiding dependence on 1/κ1/κ.

Study pure exploration in high-dimensional feature spaces using adaptive embeddings.

problem Overcoming the curse of dimensionality in pure exploration bandits.
method Adaptive embedding of feature representations into lower-dimensional spaces, carefully dealing with model misspecification.
result Sample complexity guarantees that depend on the effective dimension of feature spaces in kernel or neural representations.

By analyzing known presentations of the pure mapping groups of orientable surfaces of genus gg with bb boundary components and nn punctures, we show that these groups are isomorphic to some groups related to the braid groups and the Artin group of type D4D_4 in the cases when g=0g=0 with bb and nn arbitrary, and wh…

2019-03-29abs ↗pdf ↗

Proposes a new model for time series that considers smooth transitions between states.

problem Models assume instantaneous transitions between discrete states, ignoring gradual changes.
method Dynamical Wasserstein Barycentric (DWB) model that estimates system state and pure state distributions over time.
result Accurately learns pure state distributions and improves state estimation for transition periods.

Algorithm balances online and offline data for linear bandits.

problem Online learning with an offline dataset in linear bandits.
method Proposes a linear bandit algorithm that uses offline data early and increasingly favors exploration as the horizon grows.
result Establishes regret bounds showing competitive performance with both purely online and offline solutions.

We propose the first fully-adaptive algorithm for pure exploration in linear bandits---the task to find the arm with the largest expected reward, which depends on an unknown parameter linearly. While existing methods partially or entirely fix sequences of arm selections before observing rewards, our method adaptively c…

2017-10-16abs ↗pdf ↗

Purely data driven approaches for machine learning present difficulties when data is scarce relative to the complexity of the model or when the model is forced to extrapolate. On the other hand, purely mechanistic approaches need to identify and specify all the interactions in the problem at hand (which may not be feas…

2011-07-13abs ↗pdf ↗

New methods for efficient exploration under unknown linear constraints in bandits.

problem Optimizing decisions under unknown linear constraints in bandit problems.
method Lagrangian relaxation, computationally efficient extensions of existing methods, constraint-adaptive stopping rule.
result LAGEX achieves asymptotically optimal sample complexity, LATS shows asymptotic optimality up to novel constants.

In recent years, a market for mortality derivatives began developing as a way to handle systematic mortality risk, which is inherent in life insurance and annuity contracts. Systematic mortality risk is due to the uncertain development of future mortality intensities, or {\it hazard rates}. In this paper, we develop a …

2010-11-01abs ↗pdf ↗

Study of tangent cones at infinity for algebraic sets.

problem Characterizing algebraic sets based on their tangent cones at infinity.
method Definition and analysis of tangent cones C4,(X)C_{4, \infty}(X) and C5,(X)C_{5,\infty}(X), proving properties and relations.
result Affine linear subspace characterization based on C5,(X)C_{5, \infty}(X)'s dimension.

The risk premium of a policy is the sum of the pure premium and the risk loading. In the classification ratemaking process, generalized linear models are usually used to calculate pure premiums, and various premium principles are applied to derive the risk loadings. No matter which premium principle is used, some risk …

2020-02-05abs ↗pdf ↗

Develops a Bayesian non-parametric approach for signal separation with varying components.

problem Signal separation with varying components across different input locations.
method Augments Gaussian Process Latent Variable Models with weighted sums of pure component signals and incorporates priors for linear weights.
result Framework allows for non-linear variations in signals and incorporates useful priors for linear weights.

The paper tackles combinatorial pure exploration with various feedback structures and proposes efficient algorithms.

problem Identifying the optimal action in a combinatorial space with limited feedback and nonlinear rewards.
method Designs polynomial-time adaptive algorithms for CPE-BL and CPE-PL, providing sample complexity analyses.
result The proposed algorithms achieve sample complexity close to lower bounds and outperform existing methods.

In a regression setup with deterministic design, we study the pure aggregation problem and introduce a natural extension from the Gaussian distribution to distributions in the exponential family. While this extension bears strong connections with generalized linear models, it does not require identifiability of the par…

2009-11-16abs ↗pdf ↗

In this contribution we review results on the kinematics of a quantum system localized on a connected configuration manifold and compatible dynamics for the quantum system including external fields and leading to non-linear Schrödinger equations for pure states.

1996-11-29abs ↗pdf ↗

Study optimal strategy for maximizing exponential utility in financial market with linear price impact.

problem Maximizing exponential utility in financial market with linear price impact.
method Purely probabilistic approach using duality.
result Computed optimal portfolio strategy and value for Ornstein-Uhlenbeck process.

New method identifies latent causal factors from observational data alone.

problem Identifying latent causal factors without interventions or graphical restrictions.
method Characterization of latent factors in nonlinear causal models with additive Gaussian noise and linear mixing, using a practical algorithm based on solving a quadratic program over observed data.
result Latent causal variables can be identified up to a layer-wise transformation, and further disentanglement is not possible.

Study improves understanding of network degree distributions using non-linear ERGs.

problem Lack of models capable of accounting for the variance of empirical degree distributions.
method Defined a fitness-induced variant of the two-star model to reproduce sample variance.
result Non-linear ERGs can reproduce the sample variance of empirical degree distributions.

Develops a method to identify causal effects in linear models with latent variables.

problem Identifying causal effects in models with latent variables that are not independent.
method A novel graphical criterion and an integer linear program algorithm.
result Sufficient condition for identifying causal effects by rational formulas in the covariance matrix.

Global fixed points in low-dimensional surface group space correspond to trivial representations.

problem Understanding global fixed points in surface group deformation spaces.
method Direct analysis of the deformation space, focusing on the trivial representation.
result Global fixed points in low-dimensional surface group deformation spaces correspond to the trivial representation of the pure mapping class group.

Paper develops a dynamic Bayesian approach for active learning that optimizes exploration-exploitation balance.

problem Balancing exploration and exploitation in active learning for unknown functions.
method Develops BHEEM, a Bayesian hierarchical approach with approximate Bayesian computation for sampling trade-off parameters.
result BHEEM achieves at least 21% and 11% improvement over pure exploration and exploitation strategies respectively.

We prove the linear stability of slowly rotating Kerr black holes as solutions of the Einstein vacuum equation: linearized perturbations of a Kerr metric decay at an inverse polynomial rate to a linearized Kerr metric plus a pure gauge term. We work in a natural wave map/DeTurck gauge and show that the pure gauge term …

2019-06-03abs ↗pdf ↗

This paper presents the solution to a European option pricing problem by considering a regime-switching jump diffusion model of the underlying financial asset price dynamics. The regimes are assumed to be the results of an observed pure jump process, driving the values of interest rate and volatility coefficient. The p…

2018-11-28abs ↗pdf ↗

Study indifference pricing for insurance policies in a regime-switching market model.

problem Indifference pricing of pure endowment policies in a stochastic-factor model with different economic regimes.
method Stochastic control approach based on Hamilton-Jacobi-Bellman equation, Feynman-Kac formula, and sensitivity analysis.
result Characterization of indifference price as a solution to a linear PDE and a backward PDE.

ALEXP improves model selection in linear bandits with exponential regret improvement.

problem Model selection in linear bandits is challenging due to balancing exploration and exploitation.
method ALEXP uses online learning with favorable bias-variance trade-off to emulate full-information feedback.
result ALEXP achieves an exponentially improved (logM\log M) regret dependence on the number of models MM.