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

148297445593 · Jun 202019922001200920172026
48 results for Dependent observations

Extends PD-NJ-ODE to noisy observations and dependent observation times.

problem Predicting continuous-time stochastic processes with irregular and noisy observations.
method Extends PD-NJ-ODE to handle conditional independence and noisy observations.
result Theoretical guarantees and empirical examples for handling noisy observations and dependent observation times.

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.

Improves active learning efficiency by warping input space based on observed outputs.

problem Insensitivity of Gaussian process uncertainty to actual observations.
method Input warping with learned monotone reparameterization to adjust acquisition function behavior.
result Significantly improved sample efficiency across various benchmarks, especially in non-stationary conditions.

Consider an experiment involving a potentially small number of subjects. Some random variables are observed on each subject: a high-dimensional one called the "observed" random variable, and a one-dimensional one called the "outcome" random variable. We are interested in the dependencies between the observed random var…

2018-06-13abs ↗pdf ↗

Theoretical analysis of deep neural networks for time series data.

problem Theoretical development for deep neural networks on temporally dependent observations is lacking.
method Established non-asymptotic bounds for prediction error of deep neural networks under mixing-type assumptions.
result Deep neural networks can model non-linear time series data with additional logarithmic factors due to dependence.

A Hawkes process with state-dependent factor models order flows in limit order books.

problem Modeling order flows in limit order books for better market prediction.
method A Hawkes process with a state-dependent factor for conditional intensity estimation.
result State-dependent formulations improve the fit of LOB models to financial data.

Study on future-dependent value functions for off-policy evaluation in complex environments.

problem Exponential dependence on horizon in off-policy evaluation for complex observations.
method Developed novel coverage assumptions for POMDPs to achieve polynomial bounds.
result Achieved polynomial bounds on previously exponential quantities, improving off-policy evaluation.

New model captures state-dependent variability in partially observed systems.

problem Structured stochasticity not captured by constant-variance models.
method State-coupled stochastic volatility framework with particle expectation-maximization.
result Model consistently reduces recovery bias under partial observation.

Network models have been popular for modeling and representing complex relationships and dependencies between observed variables. When data comes from a dynamic stochastic process, a single static network model cannot adequately capture transient dependencies, such as, gene regulatory dependencies throughout a developm…

2009-07-14abs ↗pdf ↗

We revisit the Kolmogorov-Smirnov and Cramér-von Mises goodness-of-fit (GoF) tests and propose a generalisation to identically distributed, but dependent univariate random variables. We show that the dependence leads to a reduction of the "effective" number of independent observations. The generalised GoF tests are not…

2011-06-15abs ↗pdf ↗

Estimates binary labels from dependent data using Markov Random Fields.

problem Statistical estimation from dependent data across spatial, temporal, and social domains.
method Modeling dependencies as Markov Random Fields and providing efficient estimation algorithms.
result Statistically efficient estimation rates for Ising models from a single sample.

New method uses Winsorized mean estimators for privacy-preserving statistics on dependent data.

problem Privacy-preserving statistics on dependent data with sensitive information.
method Adapting noisy Winsorized mean estimators to handle dependence via log-Sobolev inequalities.
result Asymptotic and finite sample guarantees for item-level and user-level mean estimation similar to \iid{} settings.

New empirical process bounds reveal trade-off between dependence and complexity in nonparametric learning.

problem Understanding generalization in nonparametric learning with temporal dependencies.
method Developed bounds on expected supremum of empirical processes under β/ρβ/ρ-mixing assumptions.
result Achieved rates similar to i.i.d. setting under long-range dependence with complex function classes.

Hybrid framework merges data and domain knowledge for better spatial interpolation.

problem Spatial interpolation overlooks domain knowledge and limits to spatial coordinates.
method Integrates data-driven features with rule-assisted spatial dependency function mapping.
result Superior performance in two application scenarios, capturing localized features.

Algorithm detects unmeasured confounding in observational data.

problem Estimating treatment effects in observational studies with untestable conditions.
method Two-stage procedure that detects dependencies between causal mechanisms.
result Algorithm efficiently detects confounding on simulated and semi-synthetic data.

New findings control FDR for online testing methods under positive dependence.

problem Maintaining FDR control for online testing methods under positive dependence.
method Developed new methods to control FDR for online testing procedures under positive dependence.
result SAFFRON and LORD control FDR under positive dependence, not just conditional superuniformity.

Customer Satisfaction is the most important factors in the industry irrespective of domain. Key Driver Analysis is a common practice in data science to help the business to evaluate the same. Understanding key features, which influence the outcome or dependent feature, is highly important in statistical model building.…

2018-05-25abs ↗pdf ↗

We tackle linear bandits with partially observable features, achieving sublinear regret.

problem Linear regret due to unobserved features in partially observable linear bandits.
method Feature augmentation with orthogonal basis vectors and a doubly robust estimator.
result Sublinear regret bound of ildeO((d+dh)T) ilde{O}(\sqrt{(d + d_h)T}).

New method identifies causal variables from partially observed data.

problem Learning from unpaired observations with instance-dependent partial observability.
method Proposes two methods enforcing sparsity in the inferred representation.
result Establishes two identifiability results for linear and piecewise linear mixing functions.

The standard linear and logistic regression models assume that the response variables are independent, but share the same linear relationship to their corresponding vectors of covariates. The assumption that the response variables are independent is, however, too strong. In many applications, these responses are collec…

2019-05-08abs ↗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 ↗

New method for evaluating policies in complex decision-making models with hidden variables.

problem Evaluating policies in partially observable Markov decision processes with hidden confounders.
method Introduces novel identification methods and minimax estimation techniques for linking target policy's value and observed data distribution.
result Proposes three estimators for off-policy evaluation in POMDPs with latent confounders, demonstrating their effectiveness through nonasymptotic and asymptotic analysis.

We consider a sequential learning problem with Gaussian payoffs and side information: after selecting an action ii, the learner receives information about the payoff of every action jj in the form of Gaussian observations whose mean is the same as the mean payoff, but the variance depends on the pair (i,j)(i,j) (and may…

2015-10-27abs ↗pdf ↗

Temporal coarse-graining of multi-sector default count data generates effective correlation matrices and rank copulas.

problem Explaining the difference in default dependence between monthly and annual aggregation.
method Dynamic low-rank state-space model with AR(1) latent credit-state factors.
result Effective correlation matrices and rank copulas are generated from monthly default count data.

Study learns linear system dynamics from noisy bilinear data.

problem Learning linear dynamics from bilinear observations with process and measurement noise.
method Regression with Kronecker product design, data-dependent and independent error bounds.
result Upper bounds on statistical error rates and sample complexity for learning dynamics matrices.

A new sampling method balances multi-label datasets by preserving category frequency order.

problem Sampling challenges in multi-label datasets with varying label frequencies.
method Uses multivariate Bernoulli distribution and label dependencies to estimate and weight label combinations.
result Produces a more balanced sub-sample with enhanced representation of minority categories.

Estimates dependent parameters using Markovian dependence with shrinkage.

problem Estimating dependent parameters from a hidden Markov model.
method Developed a novel non-parametric shrinkage algorithm combining Tweedie-based ideas and efficient state estimation.
result Superior performance compared to non-shrinkage methods in hidden Markov models.

Paper proposes a new method to identify causal graphs with latent variables using higher-order cumulants.

problem Estimating causal directed acyclic graphs with latent confounders.
method Uses higher-order cumulants to identify causal structures among observed and latent variables.
result Validates the proposed algorithm through simulations and real-world data.

The `observer space' of a Lorentzian spacetime is the space of future-timelike unit tangent vectors. Using Cartan geometry, we first study the structure a given spacetime induces on its observer space, then use this to define abstract observer space geometries for which no underlying spacetime is assumed. We propose ta…

2012-09-28abs ↗pdf ↗

Causal relationships in time series with latent variables are discovered using LPCMCI.

problem Discovering causal relationships in complex, time-series data with hidden variables.
method Evaluated LPCMCI algorithm for finding generators compatible with multi-dimensional, autocorrelated time series with latent variables.
result LPCMCI performs better than random guessing but is not optimal.