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

95190285380 · Jun 202019922001200920172026
48 results for observer horizons

Classifies conformal transformations in spacetimes without observer horizons.

problem Understanding conformal transformations in spacetimes without observer horizons.
method Proves classification of conformal transformations into two types: escaping and non-escaping.
result Conformal transformations of Einstein's static universe are classified.

Paper proves existence of anisotropic dynamical horizons in gravitational collapse.

problem Existence of apparent horizons in gravitational collapse.
method Scale-critical hyperbolic method and non-perturbative elliptic techniques.
result Smooth and spacelike apparent horizons emerge from general initial data in gravitational collapse.

The study reveals distinct patterns in retail investors' holding periods affecting stock returns.

problem Understanding the impact of retail investors' investment horizons on stock returns.
method Using self-reported holding periods from StockTwits, the study categorizes retail investors into long-horizon and short-horizon groups and analyzes their return patterns.
result Long-horizon retail investors exhibit underreaction to earnings announcements, while short-horizon investors show overreaction.

This paper solves the consumption-investment problem under Epstein-Zin preferences on a random horizon. In an incomplete market, we take the random horizon to be a stopping time adapted to the market filtration, generated by all observable, but not necessarily tradable, state processes. Contrary to prior studies, we do…

2019-03-21abs ↗pdf ↗

We review a resent {\em time-dependent} performance measure for economical time series -- the (optimal) investment horizon approach. For stock indices, the approach shows a pronounced gain-loss asymmetry that is {\em not} observed for the individual stocks that comprise the index. This difference may hint towards an sy…

2005-04-21abs ↗pdf ↗

Many robotic applications require the agent to perform long-horizon tasks in partially observable environments. In such applications, decision making at any step can depend on observations received far in the past. Hence, being able to properly memorize and utilize the long-term history is crucial. In this work, we pro…

2019-03-09abs ↗pdf ↗

We consider solutions to the linear wave equation gφ=0\Box_gφ=0 on a non-extremal maximally extended Schwarzschild-de Sitter spacetime arising from arbitrary smooth initial data prescribed on an arbitrary Cauchy hypersurface. (In particular, no symmetry is assumed on initial data, and the support of the solutions may con…

2007-09-18abs ↗pdf ↗

The capitalization-weighted total relative variation i=1d0μi(t)dlogμi(t)\sum_{i=1}^d \int_0^\cdot μ_i (t) \mathrm{d} \langle \log μ_i \rangle (t) in an equity market consisting of a fixed number dd of assets with capitalization weights μi()μ_i (\cdot) is an observable and nondecreasing function of time. If this observable of the market …

2016-08-22abs ↗pdf ↗

Study optimal policy regret in partially observable Markov games with adaptive opponents.

problem Optimal sequential decision-making in partially observable environments against strategic, adaptive opponents.
method An epoch-based optimistic maximum-likelihood algorithm that selects one policy per epoch using confidence sets built cumulatively from past data.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) policy regret for fixed problem parameters, with explicit dependence on horizon, adversary memory, confidence radius, and aggregate Eluder dimension.

Firms miscount their customers who stop buying without saying goodbye.

problem Counting non-contractual customers accurately.
method Estimating repeat purchase probabilities and extrapolating to infinite time.
result The count of alive customers is only partially identified, with a wide range of estimates.

Optimizes investment under uncertain time horizons with non-concave utility.

problem Optimizing investment decisions with non-concave utility and uncertain time horizons.
method Established necessary and sufficient conditions for optimality, suggested recursive procedure for non-concave utility.
result Optimal investment strategies under uncertain time horizons exhibit multimodal distribution, indicating flexibility in switching between local maximizers.

Past lightcones of certain points in globally hyperbolic spacetimes determine the entire spacetime.

problem Determining the entire spacetime from the past lightcone of a point.
method Analyzing properties of globally hyperbolic spacetimes and using null lines and observer horizons.
result Past lightcones of certain points in globally hyperbolic spacetimes determine the entire spacetime (up to isometry).

Logarithmic regret achieved in continuous-time linear-quadratic reinforcement learning.

problem Optimizing control actions in unknown continuous-time systems over a finite time horizon.
method Least-squares algorithm based on continuous-time observations and controls, with perturbation analysis and parameter estimation error analysis.
result Logarithmic regret bound of order O((lnM)(lnlnM))O((\ln M)(\ln\ln M)).

Minimal TIP and TIF found in compact spacetimes, impacting spacetime splitting.

problem Understanding the global structure of spacetimes with compact Cauchy surfaces.
method Analysis of Terminal Indecomposable Past (TIP) and Future (TIF) sets in spacetimes with compact Cauchy surfaces.
result In a spacetime with compact Cauchy surfaces, there is always at least one minimal TIP and one minimal TIF.

Investment horizon approach has been used to analyze indexes of Polish stock market.Optimal time horizon for each return value is evaluated by fitting appropriate function form of the distribution. Strong asymmetry of gain-loss curves is observed for WIG index, whereas gain and loss curves look similar for WIG20 and fo…

2006-08-22abs ↗pdf ↗

Using high frequency data, we have studied empirically the change of volatility, also called volatility derivative, for various time horizons. In particular, the correlation between the volatility derivative and the volatility realized in the next time period is a measure of the response function of the market particip…

2001-05-08abs ↗pdf ↗

Scalar-tensor gravitation theories, such as the Brans-Dicke family of theories, are commonly partly described by a modified Einstein equation in which the Ricci tensor is replaced by the Bakry-Émery-Ricci tensor of a Lorentzian metric and scalar field. In physics this formulation is sometimes referred to as the "Jordan…

2013-10-15abs ↗pdf ↗

nGPT learns to transfer learning rates across model dimensions and token horizons.

problem nGPT does not transfer learning rates across model size and token horizon.
method Combining numerical experiments with alignment exponents, a novel nGPT parameterization νGPT is developed.
result νGPT exhibits learning rate transfer across width, depth, and token horizon.

SurvFM-RMST converts survival outcomes into pseudo-observation targets for tabular models.

problem Right-censored follow-up prevents direct use of survival labels in tabular patient data.
method SurvFM-RMST framework that converts survival outcomes into jackknife pseudo-observation targets for restricted mean survival time.
result SurvFM-RMST accurately recovered restricted event-free time in simulations and outperformed naive targets in static datasets.

Study optimal stopping problems with finite-time horizon and proves continuity and strict monotonicity of the boundary.

problem Optimal stopping problems with finite-time horizon and state-dependent discounting.
method Linear diffusion process, time-homogeneous gain function, fine regularity properties, continuity and strict monotonicity proof.
result Proves continuity and strict monotonicity of the optimal stopping boundary under mild assumptions.

Efficient RL in large POMDPs with latent determinism and embeddings.

problem Efficient reinforcement learning in large-scale POMDPs with latent states and observations.
method Conditional Hilbert space embeddings, linear optimal QQ-function, deterministic latent transitions, gap assumption.
result Computationally and statistically efficient algorithm for exact optimal policy.

This work tackles long-term visual planning by goal-conditioned hierarchical predictors.

problem Current learning approaches fail on long-horizon tasks due to lack of goal information and coarse-to-fine planning.
method Formulate goal-conditioned predictors (GCPs) and hierarchical models to predict trajectories between observations.
result GCPs enable effective long-term planning with much longer horizons than before.

The inverse statistics is the distribution of waiting times needed to achieve a predefined level of return obtained from (detrended) historic asset prices \cite{optihori,gainloss}. Such a distribution typically goes through a maximum at a time coined the {\em optimal investment horizon}, τρτ^*_ρ, which defines the most…

2006-01-02abs ↗pdf ↗

Study tackles OPE in confounded settings, estimating policy value from proxies.

problem Difficulty in OPE due to unobserved confounders in infinite-horizon RL.
method Two-stage approach: estimating stationary distribution ratios and combining optimal balancing.
result Policy value can be identified from off-policy data with proxies and latent variable model.

LLapDiff models irregular multivariate time series without step-by-step integration.

problem Trade-off between discrete and continuous methods for long-horizon forecasting.
method Generative framework that models target as a low-dimensional latent trajectory, guided by modal parameterization and Laplace domain poles.
result Improves long-horizon forecasting over baselines and supports missing-value imputation.

We show that the Brill-Lindquist initial data provides a counterexample to a Riemannian Penrose inequality with charge conjectured by G. Gibbons. The observation illustrates a sub-additive characteristic of the area radii for the individual connected components of an outermost horizon as a lower bound of the ADM mass.

2010-12-19abs ↗pdf ↗

Study on cryptocurrency market correlations at various time scales.

problem Understanding the hierarchical structure of cryptocurrency market dynamics.
method Analysis of MST and TMFG for 25 liquid cryptocurrencies at different time horizons.
result Cryptocurrency market correlations decrease with finer time scales and show a growing hierarchical structure with coarser scales.

Study learns state representations from observations for control, proving guarantees.

problem Learning state representations from high-dimensional observations for control.
method Cost-driven approach, learning latent state model to predict costs.
result Proves finite-sample guarantees for near-optimal state representation and controller.

Transformers improve Alzheimer's disease progression prediction by accounting for irregular biomarker histories.

problem Difficult prediction of medium-horizon Alzheimer's disease progression due to tied clinical scores and irregular biomarker observations.
method Developed a residual gap-aware transformer that combines statistical reference with transformer-based residual learning.
result The proposed model reduces mean error and improves prediction-observation correlation compared to baseline models.

We study the problem of regret minimization in partially observable linear quadratic control systems when the model dynamics are unknown a priori. We propose ExpCommit, an explore-then-commit algorithm that learns the model Markov parameters and then follows the principle of optimism in the face of uncertainty to desig…

2020-01-31abs ↗pdf ↗

Develops anytime-valid stopping rules for SGD based on observed trajectory.

problem Stopping stochastic gradient descent (SGD) based on observed trajectory.
method Develops anytime-valid confidence sequences for stochastic gradient methods.
result Statistically valid, time-uniform stopping rules for SGD across convex and nonconvex settings.

ETC learns minimal representations for reinforcement learning in POMDPs.

problem Sample complexity challenges in reinforcement learning for POMDPs.
method ETC learns low-dimensional features and embeddings at two levels, optimizing policy.
result ETC achieves polynomial sample complexity for POMDPs with low-rank transition kernels.

A proof is given that the maximal Fermi coordinate chart for any comoving observer in a broad class of Robertson-Walker spacetimes consists of all events within the cosmological event horizon, if there is one, or is otherwise global. Exact formulas for the metric coefficients in Fermi coordinates are derived. Sharp uni…

2012-10-29abs ↗pdf ↗