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,742 papers · 148 categories

Trend · papers per month

123246368491 · Jun 202019922001200920172026
48 results for cumulant estimators

Using methods introduced by Scargle in 1978 we derive a cumulative version of the Lomb periodogram that exhibits frequency independent statistics when applied to cumulative noise. We show how this cumulative Lomb periodogram allows us to estimate the significance of log-periodic signatures in the S&P 500 anti-bubble th…

2003-02-25abs ↗pdf ↗

Develops regression trees for estimating cumulative incidence curves in competing risks.

problem Estimating cumulative incidence functions in competing risks settings.
method Uses augmented estimators of the Brier score risk to build and prune regression trees.
result Demonstrates the utility of the proposed methods through simulation studies and real data.

New method corrects bias in datasets using cumulative distribution functions.

problem Varying domains and biased datasets lead to differences between training and target distributions.
method Empirical cumulative distribution function estimates of the target distribution, rigorously generalized.
result Method is more robust, not reliant on parameter tuning, and performs similarly to state-of-the-art techniques.

Kernelized cumulants improve statistical analysis in high-dimensional spaces.

problem Statistical analysis in high-dimensional spaces with low variance estimators.
method Extending cumulants to RKHS using tensor algebra and kernel trick.
result Kernelized cumulants provide new all-purpose statistics with computational tractability.

Proposes a new sampling method for online learning with cumulative oversampling.

problem Budgeted Influence Maximization in online learning.
method Cumulative Oversampling (CO) method for online learning.
result CO-based algorithm achieves comparable regret to UCB-based algorithms and performs similarly to Thompson Sampling.

Paper proposes a method to estimate confidence bands for survival random forests.

problem No statistically valid and computationally feasible approach for estimating confidence bands for survival random forests.
method Extending recent developments in infinite-order incomplete U-statistics, the paper proposes an unbiased confidence band estimation.
result The proposed method accurately estimates the confidence band and achieves desired coverage rate.

New methods improve estimation accuracy in noisy settings.

problem Estimating treatment effects in the presence of treatment noise.
method Developed new structure-agnostic cumulant estimators and practical procedures for higher-order robustness.
result Demonstrated that existing DML estimator is suboptimal for non-Gaussian treatment noise and introduced ACE procedures for improved accuracy.

Proposes efficient estimators for weighted cumulative treatment effects in observational studies.

problem Inconsistent and inefficient estimators due to model misspecification and lack of overlap.
method Double/debiased machine learning for weighted cumulative causal effects.
result Proposed estimators are consistent, asymptotically linear, and reach semiparametric efficiency bounds.

New method estimates consumer surplus from randomized pricing data.

problem Estimating consumer surplus from observational data, especially in AI-driven pricing.
method Cumulative Propensity Weights (CPW) and Augmented CPW (ACPW) estimators.
result Validated methods for estimating consumer surplus from randomized pricing data.

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 paper identifies causal effects in latent variable models using higher-order cumulants.

problem Challenges in identifying causal effects in latent variable models with latent confounders.
method Using higher-order cumulants, the paper addresses two challenging setups: a single proxy variable and underspecified instrumental variables.
result Causal effects are identifiable with a single proxy or instrument.

New method estimates SW distance using CDFs for scalable data parallelism.

problem Estimating SW distance efficiently for large datasets.
method Estimators based on CDFs of projected measures, avoiding sorting.
result Efficient estimation for large datasets and federated learning.

New method calibrates classifier probabilities with guaranteed coverage.

problem Inaccurate probability estimates by classifiers in high-risk applications.
method Adaptive temperature scaling algorithm for conformal prediction.
result Improves calibration error measures and standard metrics across various tasks.

Paper proposes a framework for reliable off-policy evaluation in reinforcement learning.

problem Quantifying uncertainty in off-policy estimates for safe deployment of target policies.
method Distributionally robust optimization for creating confidence bounds.
result Non-asymptotic and asymptotic guarantees for robust cumulative reward estimates.

We introduce three novel semi-parametric extensions of probabilistic canonical correlation analysis with identifiability guarantees. We consider moment matching techniques for estimation in these models. For that, by drawing explicit links between the new models and a discrete version of independent component analysis …

2016-02-29abs ↗pdf ↗

We propose a novel algebraic framework for treating probability distributions represented by their cumulants such as the mean and covariance matrix. As an example, we consider the unsupervised learning problem of finding the subspace on which several probability distributions agree. Instead of minimizing an objective f…

2011-08-06abs ↗pdf ↗

Optimal algorithm for high-dimensional stochastic linear bandits with sparse parameters.

problem High-dimensional stochastic linear bandits with sparse parameters.
method Three-stage arm selection algorithm using thresholded Lasso for estimation.
result Achieves exact minimax optimality in cumulative regret.

ECOD detects outliers without parameters, fast and simple.

problem Detecting outliers in large, high-dimensional datasets efficiently and interpretably.
method ECOD estimates empirical cumulative distribution functions per dimension, then computes tail probabilities and outlier scores.
result ECOD outperforms state-of-the-art methods in accuracy, efficiency, and scalability.

We design a new nonparametric method that allows one to estimate the matrix of integrated kernels of a multivariate Hawkes process. This matrix not only encodes the mutual influences of each nodes of the process, but also disentangles the causality relationships between them. Our approach is the first that leads to an …

2016-07-21abs ↗pdf ↗

New method identifies structural parameters without assuming uncorrelated errors.

problem Identifying structural parameters in simultaneous equation models.
method Exploits higher-order cumulant restrictions, not requiring uncorrelated errors.
result Simple diagonality condition on hhth-order cumulants identifies structural parameter matrix.

Curiosity-Critic improves world model training by focusing on cumulative prediction error.

problem Training world models with intrinsic rewards that consider cumulative prediction error.
method Curiosity-Critic uses a surrogate reward based on the difference between current and asymptotic prediction errors, estimated online by a co-trained critic.
result Curiosity-Critic outperforms other methods in training speed and final world model accuracy.

Directed acyclic graphs (DAGs) are a popular framework to express multivariate probability distributions. Acyclic directed mixed graphs (ADMGs) are generalizations of DAGs that can succinctly capture much richer sets of conditional independencies, and are especially useful in modeling the effects of latent variables im…

2010-08-31abs ↗pdf ↗

This article develops a statistical test for the null hypothesis of strict stationarity of a discrete time stochastic process in the frequency domain. When the null hypothesis is true, the second order cumulant spectrum is zero at all the discrete Fourier frequency pairs in the principal domain. The test uses a window …

2018-01-20abs ↗pdf ↗

The paper develops methods to predict the probability of achieving a user goal in a task, ensuring the system alerts when the probability falls below a threshold.

problem Ensuring an autonomous system achieves the user's goal with calibrated probability estimates.
method Invertible conformal prediction using Probability-space Conformalized Quantile Regression (PCQR) to produce well-calibrated conditional prediction intervals.
result The method produces well-calibrated probabilities that the cumulative reward will fall within a user-specified target interval, with finite-sample guarantees.

The study compares parametric and nonparametric models for estimating mean-variance mixtures and finds that nonparametric models perform better.

problem Estimating the distribution of a normal mean-variance mixture under uncertainty.
method Comparison of six parametric mixing laws with a grid nonparametric maximum likelihood estimator, using a paired block bootstrap for score comparison.
result Nonparametric models outperform parametric models in estimating the distribution of a normal mean-variance mixture.

Study quantifies how LLMs capture higher-order statistical structure using cumulant expansion.

problem Understanding how LLMs internalize statistical structure during next-token prediction.
method Cumulant-expansion framework treating softmax entropy as perturbation around center distribution.
result Cumulants reveal distinct signatures for mathematical vs. general text prompts, quantifying feature-learning dynamics.

The paper develops a reinforcement learning model to estimate ad impact considering delayed and cumulative effects.

problem Accurately estimating ad impact considering delayed and long-term effects, cumulative impacts, and customer heterogeneity.
method Modeling ad bidding as a Contextual Markov Decision Process (CMDP) with delayed Poisson rewards, proposing a two-stage maximum likelihood estimator and reinforcement learning algorithm.
result Achieves a near-optimal regret bound of O~(dH2T)\tilde{O}{(dH^2\sqrt{T})}, validating the approach through simulation experiments.

The study examines neural networks with random weights and biases, finding that depth-to-width ratio controls fluctuations and correlations.

problem Exploring the exploding and vanishing gradient problem in neural networks with random weights and biases.
method Sharp estimates of joint cumulants and solving cumulant recursions in powers of 1/n.
result The depth-to-width ratio L/nL/n plays a crucial role in controlling fluctuations and correlations, leading to the occurrence of exploding and vanishing gradients.

The CSA-ES is an Evolution Strategy with Cumulative Step size Adaptation, where the step size is adapted measuring the length of a so-called cumulative path. The cumulative path is a combination of the previous steps realized by the algorithm, where the importance of each step decreases with time. This article studies …

2012-12-01abs ↗pdf ↗

PDCA algorithm learns policies for RL with constraints using a primal-dual approach.

problem Offline constrained reinforcement learning with general function approximation.
method Primal-Dual-Critic Algorithm (PDCA) using a primal-dual approach.
result PDCA finds a near saddle point of the Lagrangian, nearly optimal for constrained RL.

We leverage neural networks as universal approximators of monotonic functions to build a parameterization of conditional cumulative distribution functions (CDFs). By the application of automatic differentiation with respect to response variables and then to parameters of this CDF representation, we are able to build bl…

2018-11-02abs ↗pdf ↗

New method optimizes multiple objectives in A/B testing for AI and clinical trials.

problem Minimizing cumulative regret, maximizing CATE, and ensuring differential privacy in large-scale experiments.
method ConSE and DP-ConSE algorithms for sequential segmentation and elimination, achieving Pareto-optimal frontier.
result Privacy comes 'for free' in our framework, with only asymptotically negligible costs to regret and accuracy.

This paper quantifies and mitigates a bias in the Hayashi-Yoshida estimator causing data loss.

problem Formulaic bias in the Hayashi-Yoshida estimator leading to data loss.
method Formalizes and quantifies the data loss, introduces (a,b)-asynchronous adversary, and provides algorithms.
result Proves that for equal rates, the minimal average cumulative data loss is 25%.

Plots show miscalibration directly as slopes of secant lines.

problem Detecting discrepancies between probabilistic predictions and actual outcomes.
method Cumulative differences between observed and expected values displayed as slopes of secant lines.
result Directly shows miscalibration without binning or kernel density estimation.

Study on sequential prediction with log-loss, focusing on well-specified and misspecified cases.

problem Sequential prediction with log-loss under different specification conditions.
method Analysis of cumulative regret in well-specified and misspecified cases for a Gaussian location hypothesis class.
result Cumulative regrets in well-specified and misspecified cases asymptotically coincide for the dd-dimensional Gaussian location hypothesis class.

Derives a general derivative identity for conditional mean in Gaussian noise.

problem Understanding conditional mean in Gaussian noise channels.
method Derives a general derivative identity for the conditional mean of X{\bf X} given Y=y{\bf Y}={\bf y} in a Markov chain UXY{\bf U} \leftrightarrow {\bf X} \leftrightarrow {\bf Y}.
result Provides a unifying view of conditional mean identities and derives new ones.

Localized debiased machine learning simplifies estimating quantile treatment effects.

problem Estimating quantile treatment effects in causal inference with many covariates and flexible relationships.
method Localized debiased machine learning (LDML) avoids learning the full nuisance function by estimating only at a single initial guess.
result LDML enables practically-feasible and theoretically-grounded efficient estimation of quantile treatment effects.