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

85170254339 · Jun 202019922001200920172026
48 results for cumulative sum test

The paper improves asymmetric causality tests by addressing inefficiencies and statistical significance issues.

problem Inefficiencies and statistical significance issues in asymmetric causality tests.
method Improved asymmetric causality tests via partial cumulative sums for positive and negative components, explicitly testing differences between causal parameters.
result Efficiently tested hypotheses on asymmetric causal interaction between financial markets.

Cumulant expansion is used to derive accurate closed-form approximation for Monthly Sum Options in case of constant volatility model. Payoff of Monthly Sum Option is based on sum of NN caped (and probably floored) returns. It is noticed, that 1/N1/\sqrt{N} can be used as a small parameter in Edgeworth expansion. First …

2010-11-17abs ↗pdf ↗

New method detects strong calibration in ML models, even for small poorly calibrated subgroups.

problem Auditing machine learning models for strong calibration is difficult, especially for small poorly calibrated subgroups.
method Reorder observations by expected residuals and use changepoint detection for score-based cumulative sum (CUSUM) test.
result The proposed adaptive CUSUM test consistently achieved higher power and more than doubled power in auditing mortality risk prediction models.

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 ↗

Paper tackles constrained bandit problems with a new learning framework.

problem Optimizing a black-box reward function subject to a black-box constraint function over a continuous space.
method Rectified Pessimistic-Optimistic Learning (RPOL) framework, incorporating optimistic and pessimistic GP bandit learning.
result RPOL achieves sublinear regret and minimal cumulative constraint violation.

This work extends reinforcement learning to handle non-cumulative objectives.

problem Optimizing functions of rewards rather than their sum in decision processes.
method Mapping NCMDPs to standard MDPs for reinforcement learning.
result Reinforcement learning techniques can be applied to NCMDPs.

Paper defines the payback period for nonconventional cash flows using axioms.

problem Defining the payback period for nonconventional cash flows is challenging.
method Used axiomatic approach to define the payback period.
result The last break-even point of the project balance is the only definition consistent with axioms.

New exact tests detect changepoints in binary and count data, especially when normal approximations fail.

problem Detecting changepoints in multichannel binary and count data.
method Exact tests combining two-sample conditional tests with multiplicity correction.
result Exact tests are much more powerful than asymptotic tests in various settings.

In this article, inspired by Shi, et al. we investigate the optimal portfolio selection with one risk-free asset and one risky asset in a multiple period setting under cumulative prospect theory (CPT). Compared with their study, our novelty is that we consider a stochastic benchmark, and portfolio constraints. We test …

2016-08-30abs ↗pdf ↗

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.

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.

Paper tackles online DR-submodular maximization with stochastic constraints.

problem Maximizing utility while adhering to a cumulative resource constraint in an online setting.
method Proposes OLFW algorithm to solve the problem of online continuous DR-submodular maximization with linear stochastic constraints.
result Obtains sub-linear regret and constraint violation bounds.

Paper optimizes change detection in unnormalized distributions.

problem Detecting changes in unnormalized pre- and post-change distributions.
method Log-Partition Approximation Cumulative Sum (LPA-CUSUM) algorithm based on thermodynamic integration.
result Asymptotically optimal performance achieved through unbiased estimation of CUSUM statistics.

The paper introduces a spline-based method for calibrating neural networks.

problem Ensuring neural network outputs are reliable for safety-critical applications.
method Approximating the empirical cumulative distribution function using splines to map network outputs to calibrated probabilities.
result The spline-based recalibration consistently outperforms existing methods on calibration measures.

The stochastic multi-armed bandit (MAB) problem is a common model for sequential decision problems. In the standard setup, a decision maker has to choose at every instant between several competing arms, each of them provides a scalar random variable, referred to as a "reward." Nearly all research on this topic consider…

2018-06-04abs ↗pdf ↗

The paper introduces a new method for detecting financial data outliers.

problem Detecting outliers in multivariate financial data.
method The approach uses the Cumulant Generating Function (CGF) to maximize projections on directions.
result The CGF maximization approach can be interpreted as an extension of principal component analysis.

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.

New algorithms achieve near-optimal cumulative loss in nonparametric online learning and games.

problem Fast rates of convergence in nonparametric online regression and classification.
method Randomized proper learning algorithms, hierarchical aggregation, multi-scale extension, stability proof.
result Achieved near-optimal cumulative loss bounds for real-valued and binary games.

Study of correlated Wigner matrices with BBP transitions.

problem Understanding spectral transitions in correlated Wigner matrices.
method Analyzes a Wigner-type matrix with row/column correlations, decomposes into bulk and outliers, and uses integral operators to model transitions.
result Correlated Wigner matrices exhibit multiple BBP transitions at critical points.

A new UU-test decides unimodality of datasets.

problem Deciding on the unimodality of a dataset for better data analysis.
method UU-test operates on the empirical cumulative density function (ecdf) to build a piecewise linear approximation that models the data as a Uniform Mixture Model.
result The UU-test provides a statistical model of the data in the form of a Uniform Mixture Model.

The goal of Ordinal Regression is to find a rule that ranks items from a given set. Several learning algorithms to solve this prediction problem build an ensemble of binary classifiers. Ranking by Projecting uses interdependent binary perceptrons. These perceptrons share the same direction vector, but use different bia…

2019-11-25abs ↗pdf ↗

New algorithm minimizes cumulative loss in dynamic linear bandits without prior knowledge of comparator switches.

problem Minimizing cumulative loss in dynamic linear bandits with unknown number of switches.
method Combining several bandit algorithms to adapt to unknown number of switches without prior knowledge.
result First algorithm achieving optimal regret guarantee of O(d(1+ST)T)\mathcal{O}\big(\sqrt{d(1+S_T) T}\big) up to poly-logarithmic terms.

The paper prices energy spread options using a complex stochastic model.

problem Pricing energy spread options with specific stochastic dynamics.
method Uses an exponential Ornstein-Uhlenbeck process driven by variance gamma processes, applying the Esscher transform and FFT method.
result Derives an analytical formula for pricing forwards and spread options.

A method to monitor probability predictions for calibration loss in image classification models.

problem Maintaining calibration in machine learning predictions over time.
method Cumulative sum-based approach with dynamic limits for early detection of miscalibration.
result Early detection of operational context changes impacting image classification performance.

New monitoring method detects ML risk models' performance changes in medical interventions.

problem Monitoring ML risk models in healthcare is complicated by confounding medical interventions.
method Developed a new score-based CUSUM monitoring procedure with dynamic control limits.
result Valid inference is possible if conditional exchangeability or time-constant selection bias hold.

This study optimizes stock portfolios for Indian sectors using historical data.

problem Challenges in optimizing stock portfolios due to volatility and future value estimation.
method Used Sharpe, Sortino, and Calmar ratios to design mean-variance optimized portfolios.
result Identified the ratio that maximizes cumulative returns for most sectors.

A new trading model uses deep reinforcement learning to optimize portfolio weights.

problem Optimizing portfolio weights with risk and return considerations.
method Improved deep reinforcement learning with actor-critic architecture, quantile regression, and asset short selling.
result The proposed model outperforms benchmark strategies in backtesting.

Study on parity of singular set components of maps to surfaces.

problem Parity of the number of components of singular set of maps to oriented surfaces.
method Cumulative winding number and invariant I(f) defined to study parity under homotopy.
result Parity of the number of components of singular set does not change under homotopy under certain conditions.

The paper proves local laws for non-separable sample covariance matrices.

problem Analyzing non-separable sample covariance matrices with dependent or nonlinearly transformed data.
method Tensor network framework for analyzing fluctuation averaging in the presence of higher-order cumulant structure.
result Optimal averaged local law and full anisotropic local law for non-separable sample covariance matrices.

We study nonzero-sum hypothesis testing games that arise in the context of adversarial classification, in both the Bayesian as well as the Neyman-Pearson frameworks. We first show that these games admit mixed strategy Nash equilibria, and then we examine some interesting concentration phenomena of these equilibria. Our…

2019-09-28abs ↗pdf ↗

A method uses neural networks to approximate sampling distributions of test statistics.

problem Accurate modeling of p-value functions or cdfs for correct confidence set coverage.
method Uses neural networks to model the cdf of test statistics, approximating sampling distributions.
result Neural network approximations of sampling distributions are effective and simple.

New gossip algorithms improve robustness of rank-based statistics in decentralized systems.

problem Ensuring robustness in decentralized AI and edge intelligence systems, especially in the presence of corrupted or adversarial data.
method Developed asynchronous gossip algorithms for computing rank-based statistics.
result First convergence rate bound for asynchronous gossip-based rank estimation.

We consider the problem of stochastic comparison of general Garch-like processes, for different parameters and different distributions of the innovations. We identify several stochastic orders that are propagated from the innovations to the Garch process itself, and discuss their interpretations. We focus on the convex…

2012-04-17abs ↗pdf ↗

The paper addresses evaluating survival predictions using discrimination measures, finding a robust method to convert distributions to risks.

problem Evaluating survival distribution predictions with discrimination measures is challenging and often leads to unfair comparisons.
method The paper surveys existing methods and recommends summing over the predicted cumulative hazard as the most robust method to convert distributions to risks.
result Summing over the predicted cumulative hazard is the most robust method to convert distribution predictions to risk predictions.