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

11233445 · May 202619922001200920172026
48 results for retrospective adjustment

Paper proposes faster adaptation to distribution shifts in online settings.

problem Violation of exchangeability assumption in evolving data environments.
method Online conformal inference with retrospective adjustment.
result Faster adaptation to distributional shifts demonstrated through numerical studies.

New method corrects seasonal Arctic sea ice predictions with probabilistic models.

problem Systematic biases and errors in climate model forecasts of Arctic sea ice.
method Conditional Variational Autoencoder model to map observation distribution given biased model predictions.
result Probabilistic adjusted forecasts are better calibrated and have smaller errors.

Paper proposes an algorithm to optimize CVaR using retrospective approximation and importance sampling.

problem Optimizing risk-averse problems with large sample requirements for CVaR.
method Retrospective approximation combined with importance sampling, tailored for CVaR optimization.
result The proposed algorithm reduces variance efficiently and is computationally efficient.

Retrospective and prospective analysis of Diebold-Yilmaz connectedness research.

problem Assessing the Diebold-Yilmaz approach to dynamic network connectedness.
method Retrospective and prospective analysis of Diebold-Yilmaz (2014) and personal recollections.
result Personal insights and retrospective analysis of Diebold-Yilmaz connectedness research.

The paper develops a method to learn cost-optimal sequential testing policies from retrospective data.

problem Learning cost-optimal sequential decision policies from retrospective data with missing test results.
method Doubly robust Q-learning framework with path-specific inverse probability weights.
result The method reduces testing cost without compromising predictive accuracy.

We study the problem of learning a good search policy for combinatorial search spaces. We propose retrospective imitation learning, which, after initial training by an expert, improves itself by learning from \textit{retrospective inspections} of its own roll-outs. That is, when the policy eventually reaches a feasible…

2018-04-03abs ↗pdf ↗

The task of calibration is to retrospectively adjust the outputs from a machine learning model to provide better probability estimates on the target variable. While calibration has been investigated thoroughly in classification, it has not yet been well-established for regression tasks. This paper considers the problem…

2018-06-20abs ↗pdf ↗

Study uses healthcare claims data to identify Covid-19 risk factors without prior selection.

problem Identify risk factors for severe Covid-19 cases.
method Fine-grained hierarchical information from medical classification systems used to analyze over 33,000 covariates.
result Method has better predictive ability than pre-specified morbidity groups.

Estimates counterfactual outcomes linking observed and unobserved data.

problem Estimating expected counterfactual outcomes for individuals.
method Introduces retrospective counterfactual estimators and prediction intervals linking observed and unobserved outcomes.
result Retrospective counterfactual estimators and prediction intervals asymptotically satisfy valid coverage under standard causal assumptions.

New approach uses 'forward-looking' counterfactuals for treatment choice.

problem Using traditional 'retrospective' counterfactuals in treatment choice leads to counterintuitive results.
method Introduces 'counterfactual treatment choice' for forward-looking counterfactuals.
result Mismatches between interventional and forward-looking counterfactuals can lead to counterintuitive results.

VSCOUT detects anomalies in high-dimensional data using a hybrid VAE approach.

problem Challenges in classical SPC for high-dimensional, non-Gaussian data.
method Hybrid VAE architecture with ARD prior, ensemble filtering, and changepoint detection.
result VSCOUT achieves superior sensitivity to special-cause structure and controlled false alarms.

Study benchmarks methods for learning non-Cartesian k-space trajectories and reconstruction.

problem Benchmarking methods for learning non-Cartesian k-space trajectories and reconstruction.
method Comparing PILOT, BJORK, and HybLearn schemes to learn non-Cartesian k-space trajectories and reconstruction.
result HybLearn scheme outperforms other methods in learning and comparing non-Cartesian k-space trajectories and reconstruction.

Improved stock selection through predictive fundamentals and uncertainty estimates.

problem Selecting stocks based on future financial data to outperform traditional factor models.
method Train deep nets to forecast future fundamentals, incorporate uncertainty estimates, and adjust portfolios to manage risk.
result Simulated annualized return of 17.7% and Sharpe ratio of 0.84 for uncertainty-aware model, significantly higher than 14.0% and 0.52 for standard factor models.

Dynamic promotion optimization for e-commerce platforms within financial constraints.

problem Balancing promotional costs with incremental revenue for sustainable growth.
method Knapsack Problem formulation for dynamic optimization, Retrospective Estimation, online-dynamic calibration.
result Significant increase in target outcome while staying within financial constraints.

Users form information trails as they browse the web, checkin with a geolocation, rate items, or consume media. A common problem is to predict what a user might do next for the purposes of guidance, recommendation, or prefetching. First-order and higher-order Markov chains have been widely used methods to study such se…

2017-04-20abs ↗pdf ↗

Novel approach uses quasi-conformal geometry for OSA classification from cephalometry.

problem Classifying obstructive sleep apnea (OSA) based on craniofacial profiles.
method Quasi-conformal geometry for local deformation analysis of 15 landmark points in lateral cephalograms.
result Proposed model achieves 92.5% testing accuracy.

Results on 88-dimensional topological planes are scattered in the literature. It is the aim of the present paper to give a survey of these geometries, in particular of information obtained after the appearance of the treatise Compact Projective Planes or not included in this book. For some theorems new proofs are give…

2014-02-03abs ↗pdf ↗

A new approach RA improves stochastic optimization by executing multiple steps between subsample updates.

problem Improving the efficiency and effectiveness of stochastic optimization methods.
method Developed Retrospective Approximation (RA) which executes multiple steps between subsample updates using a deterministic solver.
result RA achieves almost sure and L1L_1 consistency under weak conditions and optimizes iteration and oracle complexity.

Study analyzes portfolio performance of crypto and traditional assets.

problem Impact of cryptocurrencies on portfolio performance.
method Used GARCH-Copula and GARCH-Vine Copula methods for risk structure calculation; Markowitz optimization for optimal asset weights.
result Portfolio with both crypto and traditional assets has higher Sharpe ratio and more stable performance.

New estimator improves policy evaluation in resource allocation RCTs.

problem Difficulty in evaluating policies optimizing limited resource allocation through RCTs.
method Proposes a novel estimator involving retrospective reshuffling of participants across experimental arms.
result The new estimator provides more accurate policy evaluations than common methods.

Confounding bias, missing data, and selection bias are three common obstacles to valid causal inference in the data sciences. Covariate adjustment is the most pervasive technique for recovering casual effects from confounding bias. In this paper, we introduce a covariate adjustment formulation for controlling confoundi…

2019-07-02abs ↗pdf ↗

Develops framework for estimating and improving DTRs with time-varying IV in the presence of unmeasured confounding.

problem Estimating DTRs from observational data with unmeasured confounding.
method Time-varying instrumental variable (IV) framework for estimating and improving DTRs.
result IV-optimal and IV-improved DTRs perform better than DTRs assuming no unmeasured confounding.

Investigates adjustments on Lie group crossed modules for gauge theory.

problem Existence and classification of adjustments on crossed modules of Lie groups.
method Differentiation/integration correspondence with infinitesimal adjustments; Lie algebra techniques.
result Infinitesimal adjustments exist if and only if the Kassel-Loday class lies in the image of the Chern-Weil homomorphism.

We describe principal 3-bundles with adjusted connections using Lie algebras and groupoids.

problem Describing principal 3-bundles with adjusted connections.
method Derived explicit forms of adjustment data for 3-term LL_\infty-algebras, integrated action Lie 3-algebroids to Lie 3-groupoids, and used differential cohomology.
result Explicit description of principal 3-bundles with adjusted connections in terms of differential cohomology.

Online detection of instantaneous changes in the generative process of a data sequence generally focuses on retrospective inference of such change points without considering their future occurrences. We extend the Bayesian Online Change Point Detection algorithm to also infer the number of time steps until the next cha…

2019-02-12abs ↗pdf ↗

This article attempts to place the emergence of probabilistic numerics as a mathematical-statistical research field within its historical context and to explore how its gradual development can be related both to applications and to a modern formal treatment. We highlight in particular the parallel contributions of Sul'…

2019-01-14abs ↗pdf ↗

Efficient adjustment sets found for cost-minimized causal estimations.

problem Estimating interventional means with minimum cost in causal graphical models.
method Defined cost-adjustment sets, constructed flow networks, and used maximum flow algorithms.
result Minimum cost optimal adjustment sets exist and can be found efficiently.

The paper provides PAC bounds for estimating causal effects using covariate adjustment with a valid set.

problem Estimating causal effects in high-dimensional settings without randomized experiments.
method PAC learning perspective, valid adjustment set, $\eps$-Markov blanket, constraint-based algorithms.
result PAC-bounds the estimation error of covariate adjustment by a term exponential in the size of the adjustment set.

Study optimal adjustment sets for causal policies with hidden variables.

problem Estimating dynamic treatment regimes with hidden variables.
method Developed criteria for graphs without hidden variables to compare estimators, extended to dynamic policies and hidden variables.
result Existence and computation of optimal minimal and globally optimal adjustment sets.

We describe a method for parameter estimation in bipartite probabilistic graphical models for joint prediction of clinical conditions from the electronic medical record. The method does not rely on the availability of gold-standard labels, but rather uses noisy labels, called anchors, for learning. We provide a likelih…

2016-08-02abs ↗pdf ↗