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

131262392523 · Jun 202019922001200920172026
48 results for cumulative effects

CENNSurv models cumulative effects of time-dependent exposures on survival outcomes.

problem Challenges in modeling cumulative effects of time-dependent exposures on survival outcomes.
method CENNSurv, a novel deep learning approach that captures dynamic risk relationships from time-dependent data.
result CENNSurv reveals multi-year lagged and short-term behavioral shifts in survival outcomes.

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.

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.

Inexact acquisition solutions in BO lead to sublinear cumulative regret.

problem Inexact maximization of acquisition functions in Bayesian optimization.
method Define inaccuracy measure, establish cumulative regret bounds for GP-UCB and GP-TS.
result Inexact BO algorithms can achieve sublinear cumulative regret under appropriate inaccuracy conditions.

Study how neural networks learn from non-Gaussian data models.

problem Understanding neural network learning dynamics with non-Gaussian data.
method Developed a two-layer neural network with Hermite polynomial activations to control high-order cumulants.
result Neural networks progressively learn high-order cumulants after capturing low-order statistics.

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 ↗

Paper proposes compressive ICA algorithms for ICA model.

problem Efficiently solving ICA model with reduced memory and computational complexity.
method Compressive learning approach to ICA model, proving existence of compressive ICA scheme, proposing two algorithms (IPG and ASD).
result Proposed algorithms achieve substantial memory gains over well-known ICA algorithms.

This paper optimizes multi-channel sequential advertising to maximize cumulative revenue.

problem Maximizing cumulative revenue in multi-channel sequential advertising under a budget constraint.
method Formulated as a dynamic knapsack problem, proposed a bilevel optimization framework with action space reduction.
result Significantly improved cumulative revenue compared to state-of-the-art baselines.

Estimates causal effects using machine learning for binary treatment and mediator.

problem Estimating direct and indirect quantile treatment effects under selection-on-observables.
method Double/debiased machine learning estimators based on efficient score functions.
result Uniform consistency and asymptotic normality of effect estimators.

Paper speeds up Gaussian process inference using Matérn kernels.

problem Efficiently performing Gaussian process inference for large datasets.
method Exact Matérn kernel decomposition into empirical cumulative distribution functions, combined with divide-and-conquer approach.
result The proposed algorithm significantly speeds up Gaussian process inference for low-dimensional problems with hundreds of thousands of data points.

Experience replay enables reinforcement learning agents to memorize and reuse past experiences, just as humans replay memories for the situation at hand. Contemporary off-policy algorithms either replay past experiences uniformly or utilize a rule-based replay strategy, which may be sub-optimal. In this work, we consid…

2019-06-19abs ↗pdf ↗

New method identifies causal structure in count data using cumulants and path analysis.

problem Challenges in discovering causal structure from count data, especially due to non-identifiability.
method Poisson Branching Structural Causal Model (PB-SCM) with path analysis using high-order cumulants.
result Causal order is identifiable under specific conditions in PB-SCM using cumulant information.

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.

New algorithm identifies causal effects in latent confounding models.

problem Identifying causal effects in linear non-Gaussian models with latent confounding.
method Recursive algorithm using rank conditions on higher-order cumulants.
result Algorithm achieves comparable performance to overcomplete ICA without knowing the number of latent variables.

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 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 ↗

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 ↗

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.

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.

Neural networks can learn from higher-order cumulants efficiently, requiring quadratic samples.

problem Learning from higher-order cumulants in high-dimensional data.
method Spiked cumulant model, polynomial time algorithms, neural networks, random features.
result Neural networks require quadratic samples to learn from higher-order cumulants efficiently, while random features require more samples.

The paper calculates bounds for risk metrics and entropies under partial information constraints.

problem Analyzing risk metrics and entropies for unimodal, symmetric distributions with limited information.
method Develops lower and upper bounds for worst-case distortion riskmetrics and weighted entropy for unimodal, symmetric distributions with known mean and variance.
result Sharp upper bounds for distortion riskmetrics and weighted entropy for symmetric distributions.

A new GAN loss function based on cumulant generating functions improves stability and robustness.

problem Improving the stability and performance of GANs.
method Cumulant GAN loss function based on variational R{é}nyi divergence.
result Cumulant GAN achieves linear convergence to Nash equilibrium and superior performance in image generation.

Neural networks learn faster with correlated latent variables.

problem Efficiently learning from higher-order correlations in neural networks.
method Analytical derivation and simulations of two-layer neural networks.
result Correlations between latent variables speed up learning from higher-order correlations.

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.

The paper tackles budget allocation for multiple campaigns using a novel combinatorial bandit approach.

problem Maximizing cumulative returns with limited budgets across various ad lines.
method Formulated as a multi-task combinatorial bandit problem, integrates Bayesian hierarchical models, and uses Thompson sampling.
result Demonstrates robustness and adaptability in maximizing overall cumulative returns.

Bayesian methods improve inference for cumulative probit models on large datasets.

problem Challenges in Bayesian inference for large cumulative probit models.
method Proposed scalable algorithms using Variational Bayes and Expectation Propagation.
result Superior computational performance and accuracy compared to MCMC.

The problem of an arbitrary truncated Levy flight description using the method of cumulant approach has been solved. The set of cumulants of the truncated Levy distribution given the assumption of arbitrary truncation has been found. The influence of truncation shape on the truncated Levy flight properties in the Gauss…

2010-06-12abs ↗pdf ↗

Bandit problem on graphs aims to recommend items with high expected ratings.

problem Online learning problems involving graphs, such as content-based recommendation.
method Study of a bandit problem on graphs, introducing effective dimension and proposing algorithms.
result Proposed algorithms scale linearly and sublinearly in the effective dimension, improving cumulative regret.

New algorithms minimize simple and cumulative regret in contextual bandits.

problem Minimizing simple and cumulative regret in contextual bandit settings.
method Proposed new algorithms using conformal arm sets (CASs).
result Near-optimal minimax guarantees for simple regret and state-of-the-art guarantees for cumulative regret.

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.

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 converts quantiles to cumulative distribution functions to simplify risk measures.

problem Technical assumptions in risk measure calculations.
method Invention of converting integrated quantiles to integrated cumulative distribution functions.
result Avoids the need for probability density function existence.

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.

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.

We show power-scaling behaviors for fluctuations in share volume, which no other studies have so far done. After analyzing a database of the daily transactions for all securities listed on the Tokyo Stock Exchange, we selected 1050 large companies that each had an unbroken series of daily trading activity from January …

2003-02-24abs ↗pdf ↗

Selective reinitialization improves adaptability of neural bandits in dynamic environments.

problem Loss of plasticity in neural bandits, leading to rigid neural network parameters.
method Selective Reinitialization (SeRe) framework that dynamically resets underutilized units.
result SeRe enhances adaptability of CNB algorithms, reducing cumulative regret in dynamic environments.

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.

The paper tackles non-cumulative objectives in reinforcement learning and proposes modifications to existing algorithms.

problem Optimizing objectives that are not naturally expressed as summations of rewards in various fields.
method The paper modifies the Bellman optimality equation to handle non-cumulative objectives by replacing summation with a generalized operation.
result The modified Bellman updates can converge to the globally optimal solution under certain conditions.