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

0.3%0.5%0.8%0.4% · Jan 201019922001200920172026
48 results for caution

New simulations advise caution in choosing principal components for multivariate functional data.

problem Inaccurate selection of principal components in multivariate functional data.
method Extensive simulations investigating the reliability of percentage of variance explained thresholds.
result Conventional threshold methods may fail to accurately explain overall variance in multivariate functional data.

A new approach to risk-sensitive reinforcement learning tackles computational challenges.

problem Computational challenges in estimating risk-sensitive policies for MDPs with finite state and action spaces.
method Proposes a new risk measure called 'caution' and uses a stochastic primal-dual method with KL divergence.
result Demonstrates improved reliability in reward accumulation without additional computational costs.

SDF-Bayes finds safe drug combinations safely, balancing optimism and caution.

problem Finding safe drug combinations in clinical trials with multiple drugs and patient heterogeneity.
method SDF-Bayes uses Bayesian statistics to choose the most likely MTD while ensuring safety constraints.
result SDF-Bayes outperforms existing methods in both accuracy and safety for drug combination trials.

This study quantifies uncertainty in comparing treatments using RCTs with before-and-after measures.

problem Uncertainty in comparing treatments using RCTs with before-and-after measures.
method New statistical modeling principle called ETZ enables counterfactual uncertainty quantification (CUQ) in RCTs with Before-and-After Repeated Measures.
result CUQ typically has lower variability than factual uncertainty quantification and can be achieved in RCTs.

We consider the problem of improving fairness when one lacks access to a dataset labeled with protected groups, making it difficult to take advantage of strategies that can improve fairness but require protected group labels, either at training or runtime. To address this, we investigate improving fairness metrics for …

2018-06-28abs ↗pdf ↗

A recent line of work has shown that an overparametrized neural network can perfectly fit the training data, an otherwise often intractable nonconvex optimization problem. For (fully-connected) shallow networks, in the best case scenario, the existing theory requires quadratic over-parametrization as a function of the …

2019-10-09abs ↗pdf ↗

DP synthetic data may inflate statistical test results, caution advised.

problem Inflated Type I errors in statistical tests on DP-synthetic data.
method Evaluation of Mann-Whitney U test, t-test, chi-squared test, and median test on DP-synthetic data generated from real-world and simulated datasets using various DP-synthetic data generation methods.
result A large portion of evaluation results showed inflated Type I errors, especially at low privacy levels.

This paper presents a lower bound for optimizing a finite sum of nn functions, where each function is LL-smooth and the sum is μμ-strongly convex. We show that no algorithm can reach an error εε in minimizing all functions from this class in fewer than Ω(n+n(κ1)log(1/ε))Ω(n + \sqrt{n(κ-1)}\log(1/ε)) iterations, where κ=L/μκ=L/μ is a …

2014-10-02abs ↗pdf ↗

A closed linkage mechanism in three-dimensional space is an object comprising rigid bodies connected with hinges in a circular form like a rosary. Such linkages include Bricard6R and Bennett4R. To design such a closed linkage, it is necessary to solve a high-degree algebraic equation, which is generally difficult. In t…

2019-09-05abs ↗pdf ↗

Compensation methods correct overestimation of adversarial robustness in neural networks.

problem Overestimation of adversarial robustness using first-order attack methods.
method Proposed compensation methods address inaccurate gradient computation and reduce backpropagations.
result Empirical evaluation of adversarial robustness is improved with these methods.

Study reveals limitations of fair representation learning methods and cautions against their use in performance-sensitive tasks.

problem Limitations of fair representation learning methods in performance-sensitive tasks.
method Using causal reasoning, the study defines and formalizes different sources of dataset bias and examines the performance of fair representation learning under distribution shifts.
result Fundamental limitations on fair representation learning when evaluation data is drawn from the same distribution as training data.

Bayesian approach for learning from synthetic data, improving model accuracy.

problem Lack of statistical properties and robust methods for learning from synthetic data.
method Bayesian paradigm to update model parameters considering synthetic data generating process and learning task.
result Novel approach outperforms standard methods in supervised learning and inference problems.

Dropout regularizes against high-order interactions by canceling interaction rates.

problem Overfitting to high-order interactions in neural networks.
method Analyzes Dropout through the lens of interaction effects, showing how it effectively cancels out the probability of surviving interactions of different orders.
result Dropout regularizes against high-order interactions by effectively canceling out the probability of surviving interactions of different orders.

Noise affects the effectiveness of interpolating models, especially those with strong inductive biases.

problem The impact of noise on interpolating models with strong inductive biases.
method Analyzing linear and classification models with sparse ground truths, proving fast rates for interpolators.
result Strong inductive biases can lead to faster but noisier interpolators, contrary to intuition.

Models for which the likelihood function can be evaluated only up to a parameter-dependent unknown normalising constant, such as Markov random field models, are used widely in computer science, statistical physics, spatial statistics, and network analysis. However, Bayesian analysis of these models using standard Monte…

2015-04-01abs ↗pdf ↗

Financial event studies often misestimate causal effects due to misspecified factor models.

problem Misspecification of factor models in financial event studies leads to inconsistent estimates of causal effects.
method Proposed synthetic control methods to construct replicating portfolios from control securities.
result Synthetic control methods provide more accurate estimates of causal effects in event studies.

Curriculum learning and imitation learning improve control over financial time-series data.

problem Improving control performance over complex financial time-series data.
method Data augmentation for curriculum learning and policy distillation for imitation learning.
result Curriculum learning shows significant improvement over time-series control tasks.

We present two sets of theoretical results on the grouped lasso with overlap of Jacob, Obozinski and Vert (2009) in the linear regression setting. This method allows for joint selection of predictors in sparse regression, allowing for complex structured sparsity over the predictors encoded as a set of groups. This flex…

2011-03-23abs ↗pdf ↗

Recourse explanations can become invalid if collective actions change statistical data.

problem Recourse explanations may become invalid due to collective behavior changing data statistics.
method Formal characterization of conditions under which recourse explanations remain valid under performativity.
result Recourse actions may become invalid if they are influenced by or intervene on non-causal variables.

Study shows GPT's earnings forecasts are human-like but not always accurate.

problem Information friction in AI-generated financial analysis.
method Examined GPT's earnings forecasts following corporate earnings releases and proposed a diagnostic framework.
result GPT's narrative attention is consistent and human-like but not always associated with higher forecast accuracy.

The paper discusses the importance of infinite-mean models in finance and risk management.

problem Classic statistical models assume finite mean or variance, which is not suitable for heavy-tailed data.
method Discussion and recent results on infinite-mean models in economics and finance.
result Classic statistical results for finite-mean models often fail or flip for infinite-mean models.

Machine learning confound removal biases results, leading to misleading predictions.

problem Common confound removal methods in machine learning lead to misleading predictions.
method Featurewise removal of confound variance by linear regression before applying ML.
result This common deconfounding approach can leak information, amplifying null or moderate effects.

Fan tokens surged before World Cup matches, but declined during them, revealing cognitive biases.

problem Analyzing the impact of FIFA World Cup matches on fan tokens.
method Event study and intraday analysis of blockchain-based fan tokens.
result Fan tokens experienced a surge in returns six months before the World Cup, followed by a decline during the matches, revealing asymmetries in performance.

Study examines how COVID-19 affected stock and crypto market efficiency.

problem Impact of COVID-19 on market efficiency of different asset classes.
method Analysis of price returns, absolute returns, and volatility increments in stock and cryptocurrency markets.
result Market efficiency varied by asset class and market, with some time series showing gradual decline over time.

Boosted additive models reveal new insights and potential pathologies.

problem Theoretical understanding of boosted additive models (BAMs) and their convergence behavior.
method Study of solution paths of BAMs and derivation of convergence results.
result Uncovering pathologies of boosting for certain additive model classes.

RLHF fails when humans only partially observe, leading to inflated or overjustified feedback.

problem Failure of reinforcement learning from human feedback in partially observable environments.
method Formal definition of failure cases, modeling human as Boltzmann rational, analyzing information provided by feedback.
result RLHF can deceptively inflate or overjustify feedback when humans have partial observations.

Study analyzes sensitivity of RL algorithm for ICU hemodynamic management.

problem Evaluating safety and reliability of RL in clinical settings.
method Sensitivity analysis of Duel-DDQN on ICU sepsis patients.
result RL policies are sensitive to various implementation factors.

New research suggests privileged information doesn't improve model performance.

problem Challenges in transferring knowledge using privileged information in machine learning.
method Critical examination of existing theoretical and empirical analyses of LUPI methods.
result LUPI methods often fail to effectively transfer knowledge from privileged information.

Proposes minimal interventions over counterfactual explanations for algorithmic recourse.

problem Lack of actionable recommendations for algorithmic recourse.
method Causal reasoning to shift focus from explanations to recommendations.
result Minimal interventions provide more actionable recommendations for recourse.

Langevin dynamics fails to produce accurate samples even with small score function errors.

problem Robustness of Langevin dynamics to score function errors.
method Analysis of Langevin dynamics and score function errors.
result Langevin dynamics produces a distribution far from the target distribution in TV distance even with small L2L^2 errors in the score function.

The paper optimizes LLM inference systems through queueing theory.

problem Efficient LLM inference for AI agents under various routing topologies.
method Developed a fluid-limit framework for multi-class batched processing networks under K-FCFS scheduling.
result Proved that work-conserving scheduling algorithms maximize throughput for LLM inference.

Generative text classifiers are most vulnerable to membership inference attacks.

problem Privacy threat from Membership Inference Attacks on generative text classifiers.
method Comprehensive empirical evaluation of generative, discriminative, and pseudo-generative classifiers across various datasets.
result Generative classifiers explicitly modeling P(X,Y)P(X,Y) are most vulnerable to membership leakage.

Study finds Deep Taylor Decomposition is unreliable for explaining neural networks.

problem Reliability of Deep Taylor Decomposition for explaining neural networks.
method Investigated the theoretical foundations of Deep Taylor Decomposition (DTD) and found it under-constrained.
result DTD is unreliable because its theoretical foundations are under-constrained and roots do not align with input.

Novel OTT method for cryptocurrency trading offers high annualized profit.

problem Quantifying and exploiting trading opportunities in cryptocurrency markets.
method Bi-objective convex optimization for balancing profit and risk.
result Annualized profit of 15.49% in cryptocurrency market from 2020 to 2022.

Publicly pretraining models on Web data may undermine differential privacy.

problem The use of large Web-scraped datasets in differential privacy models.
method Critical review of leveraging pretrained models on public datasets for differential privacy.
result Publicizing pretrained models as 'private' could harm trust and generalize poorly.

Network-based strategy for optimal cryptocurrency portfolios identified.

problem Challenges in predicting cryptocurrency prices in a volatile market.
method Network methods to identify decorrelated cryptocurrencies, Markowitz Portfolio Theory.
result Network-based portfolios outperform benchmarks with high expected returns.