Benchmark assesses LLMs' causal inference skills, revealing significant limitations.
problem Lack of rigorous evaluation of LLMs' causal inference capabilities.
method CausalPitfalls benchmark with structured challenges and grading rubrics.
result Significant limitations in current LLMs' statistical causal inference.
New method compares classifiers using GSD-front, addressing statistical uncertainty and robustness.
problem Comparing classifiers with multiple quality metrics and statistical uncertainty.
method Proposes GSD-front and statistical tests for robust comparisons.
result Reliable method for comparing classifiers with statistical uncertainty and robustness.
New benchmarks show LLMs struggle with causal discovery.
problem Leveraging LLMs for causal discovery is unreliable due to dataset leakage.
method Developing science-grounded benchmarks and hybrid methods combining LLM predictions with statistical analysis.
result LLMs perform poorly on novel, real-world scientific studies compared to classical methods.
We develop a statistical framework to benchmark and select large language models based on their risks.
problem Benchmarking and selecting large language models based on their associated risks.
method A distributional framework using first and second order stochastic dominance, linked to mean-risk models in finance.
result Formalizes a risk-aware approach for model selection, balancing risk and utility.
Meta-Surrogate model speeds up HPO benchmarking.
problem Limited and expensive real-world HPO benchmarks.
method Meta-surrogate model trained on off-line data.
result More coherent and statistically significant conclusions faster.
LOB-Bench benchmarks generative AI for financial data, outperforming traditional models.
problem Lack of consensus on evaluating generative AI models for financial data.
method Python-based benchmark with LOB statistics and market impact metrics.
result Generative autoregressive models outperform traditional models in LOB data.
Study benchmarks TSC algorithms in distinguishing diffusions using the likelihood ratio test.
problem Benchmarking optimality of TSC algorithms in distinguishing diffusion processes.
method Proposes to benchmark TSC algorithms using the likelihood ratio test (LRT).
result LRT benchmarks are computationally efficient and can be applied to various time series types.
New statistical model improves protein alignment accuracy.
problem Improving accuracy in protein sequence alignment.
method Inferred a time-dependent Markov process from protein sequences.
result Developed a new optimal matrix (MMLSUM) for protein alignment.
FAQ efficiently evaluates LLMs with statistical guarantees using adaptive query selection.
problem Efficiently evaluating many LLMs on a large suite of benchmarks is expensive.
method FAQ uses Bayesian factor models, adaptive sampling, and proactive active inference to select queries.
result FAQ delivers up to 5x effective sample size gains over baselines, matching CI width with fewer queries.
CTBench benchmarks cryptocurrency time series generation for trading applications.
problem Lack of comprehensive benchmarks for cryptocurrency time series generation.
method Developed a comprehensive benchmark extsf{CTBench} with 13 metrics across 5 dimensions.
result Uncovered trade-offs between statistical fidelity and real-world profitability.
New method assesses multivariate stochastic dominance using Optimal Transport.
problem Benchmarking models across multiple metrics considering dependencies.
method Characterization of multivariate first stochastic dominance via couplings, entropic regularization, and Optimal Transport.
result Established CLT and consistency for the empirical statistic, enabling hypothesis testing.
Revises GNN neighborhood aggregation for more accurate node classification.
problem Flaws in benchmark GNN models for node classification.
method Statistical signal processing approach to neighborhood aggregation.
result Novel insights for designing more efficient GNN models.
Deep RL evaluation underestimates uncertainty, leading to misleading conclusions.
problem Statistical uncertainty in deep RL performance evaluations is underestimated, leading to misleading conclusions.
method Advocates for reporting interval estimates of aggregate performance and proposes performance profiles to account for variability.
result Substantial discrepancies in prior performance comparisons are revealed, highlighting the need for more rigorous evaluation methods.
Learning to control linear systems is statistically hard, especially for underactuated systems.
problem Statistical difficulty of learning to control linear systems, especially underactuated ones.
method Utilized minimax lower bounds and structural assumptions to prove learning complexity can be exponential.
result Learning complexity can be at most exponential with the controllability index of the system.
Hidden Markov model predicts profitable statistical arbitrage in Shanghai crude oil futures.
problem Statistical arbitrage opportunities in international crude oil futures markets.
method Hidden Markov model for cointegration spread, mean-reverting regime-switching process.
result Statistical arbitrage strategies involving Shanghai crude oil futures are profitable.
This paper compares and evaluates methods for evaluating statistical models using benchmarking data and simulations.
problem Choosing between benchmarking data sets and simulation studies for method comparison studies.
method Borrowing ideas from mixed methods research and Clinical Scenario Evaluation, the paper investigates and develops new approaches to evaluate methods.
result Develops new approaches to evaluate methods by combining the strengths of benchmarking data sets and simulation studies.
Novel strategy benchmarks observational studies against randomized trials.
problem Benchmarking observational studies for treatment effect bias.
method Statistical test for null hypothesis of treatment effect difference.
result Valid lower bound on maximum bias strength for any subgroup.
Monte Carlo Tree Search (MCTS) algorithms have achieved great success on many challenging benchmarks (e.g., Computer Go). However, they generally require a large number of rollouts, making their applications costly. Furthermore, it is also extremely challenging to parallelize MCTS due to its inherent sequential nature:…
New framework selects high-quality pretraining data without training LLMs.
problem Slow progress in understanding pretraining data due to costly experiments.
method Statistical framework based on perplexity-benchmark correlations.
result Approach outperforms existing methods on multiple benchmarks.
Study tests five popular trading signal families and finds four refuted, one inconclusive, and one not refuted.
problem Testing the viability of five popular trading signal families for generating a positive edge.
method Statistical edge testing, economic viability assessment, and finite-bankroll survival under leverage using exposure-matched benchmarks, stationary-bootstrap confidence intervals, and hierarchical Benjamini-Yekutieli control.
result Four out of five signal families are refuted, one is inconclusive, and one is not refuted.
The paper quantifies uncertainty in aggregated machine learning metrics.
problem Uncertainty in summarizing model performance across multiple tasks.
method Statistical methodologies including bootstrapping and Bayesian modeling.
result Insights into model performance dominance for specific tasks.
SurvSet offers a repository of 76 T2E datasets for ML benchmarking.
problem Lack of open-source T2E dataset repositories for ML benchmarking.
method Consistent formatting of datasets for various ML algorithms and statistical methods.
result SurvSet provides a comprehensive resource for T2E analysis.
The study examines how permutation-based optimization performance varies across different function representations.
problem Understanding how the order of function evaluations affects optimization performance.
method Iterative search setting with sampling without replacement, algebraic function recombination, correlation analysis, hierarchical clustering, PCA, ANOVA.
result Algebraically modified benchmarks yield stable re-rankings and coherent clusters of functions and sampling policies, indicating non-additive search effort.
Modern CATE models often fail to outperform a trivial zero-effect predictor, highlighting significant challenges.
problem Lack of robustness in CATE models when applied to real-world data.
method Large-scale benchmark study using diverse observational sampling strategies and novel statistics.
result 62% of CATE estimates have higher MSE than a trivial zero-effect predictor, indicating poor performance.
Randomly guessing weights helps analyze RL benchmarks objectively.
problem Understanding the complexity of reinforcement learning benchmarks.
method Generate policy networks by randomly guessing their parameters, evaluate on benchmarks, and analyze results.
result Small untrained networks can provide a robust baseline for various RL tasks.
Paper tackles SMPC for linear systems with unknown noise distribution.
problem Stochastic MPC for linear systems with chance state constraints and unknown noise distribution.
method Reformulate chance constraints, design robust benchmark SMPC, and develop adaptive SMPC with online noise statistics learning.
result Adaptive SMPC guarantees time-uniform satisfaction of unknown reformulated state constraints with high probability.
Bayesian approach quantifies uncertainty in LLM evaluations.
problem Statistical uncertainty in evaluating LLM behavior.
method Bayesian evaluation of LLM behavior using probabilistic text generation strategies.
result Bayesian approach provides useful uncertainty quantification about LLM behavior.
Research optimizes C++ patterns for HFT, reducing latency and improving profitability.
problem Optimizing latency-critical code for high-frequency trading systems.
method Creation of a Low-Latency Programming Repository, optimisation of trading strategy, implementation of Disruptor pattern.
result Significant performance improvements in speed and profitability.
Noise titration benchmarks time series forecasting models rigorously.
problem Evaluation of time series forecasting models is often flawed due to lack of interventionist methods.
method Interventionist benchmarking using Gaussian noise titration of dynamical systems.
result Fern model outperforms state-of-the-art models in non-stationary conditions.
N-BEATS improves time series forecasting accuracy by 11% over benchmarks.
problem Univariate time series point forecasting problem
method Neural architecture based on backward and forward residual links and fully-connected layers
result State-of-the-art performance on diverse datasets, improving forecast accuracy by 11% over statistical benchmarks
Generative model improves intraday electricity price forecasting.
problem Intraday electricity price forecasting for improved trading strategies.
method Generative neural network model for probabilistic path forecasts.
result Generative model leads to higher profit gains than benchmark methods.
Adaptive data fusion boosts efficiency in multi-task optimization.
problem Multi-task non-smooth optimization in various fields.
method Adaptive data fusion approach leveraging commonalities among objectives.
result Significant improvements in sample efficiency with sharp statistical guarantees.
Develops a new trading strategy for statistical arbitrage with path-dependent signals.
problem Optimal execution in statistical arbitrage strategies with dynamic predictive signals.
method Signature-based framework modeling alpha and trading speed as linear functionals of truncated signature of market path.
result Fitted policy achieves higher return on turnover compared to a z-score benchmark.
New meta-score EPP interprets model performance differences.
problem Lack of interpretable benchmarks for model performance.
method Elo-based Predictive Power (EPP) meta-score, logistic regression.
result EPP scores have probabilistic interpretation and can be compared between data sets.
Quantum GBS boosts asset clustering for robust statistical arbitrage portfolios.
problem Identifying co-moving assets from correlation matrices for statistical arbitrage.
method Mapping S&P 500 correlation data to GBS-compatible adjacency matrices, benchmarking classical and quantum clustering algorithms.
result Quantum GBS generates superior alpha during high volatility periods, persisting under low-loss conditions.
MASS Learning trains models to use minimal sufficient statistics, improving performance and uncertainty quantification.
problem Training deep networks to use minimal sufficient statistics for better performance and uncertainty quantification.
method MASS Learning trains models to produce minimal sufficient statistics with respect to a class of functions, using Conserved Differential Information (CDI).
result Deep networks trained with MASS Learning achieve competitive performance on supervised learning and uncertainty quantification benchmarks.
Study compares FDA and ML methods for time series classification.
problem Comparing functional data analysis and machine learning for time series classification.
method Functional generalized additive models, feature extraction, basis representations, support vector machines, classification trees.
result Benchmarking and ranking of methods for non-expert practitioners.
Portfolio managers are typically constrained by turnover limits, minimum and maximum stock positions, cardinality, a target market capitalization and sometimes the need to hew to a style (such as growth or value). In addition, portfolio managers often use multifactor stock models to choose stocks based upon their respe…
Study develops a multi-pair trading strategy using graph clustering and machine learning.
problem Improving risk-adjusted returns and reducing transaction costs in US equities market.
method Statistical arbitrage, graph clustering algorithms, Kelly criterion, machine learning classifiers.
result Optimal signal detection and risk management techniques outperformed benchmarks.
CPI overcomes limitations of permutation importance by providing accurate variable selection.
problem Misidentification of unimportant variables in complex models due to covariate correlations.
method Developed a model agnostic and computationally lean Conditional Permutation Importance (CPI) approach.
result CPI provides accurate type-I error control and more parsimonious variable selection.
The paper develops a method to accurately estimate the Bayes misclassification error rate.
problem Estimating the best achievable classifier performance without learning a Bayes-optimal classifier.
method Learning to benchmark using an ensemble of ε-ball estimators and Chebyshev approximation.
result The proposed method achieves an optimal mean squared error rate of O(N^(-1)) under a smoothness assumption.
New federated learning protocols resist Byzantine failures and offer privacy guarantees.
problem Resisting Byzantine failures in federated learning.
method Proposes robust federated learning protocols with optimal statistical rates and privacy guarantees.
result Achieves nearly optimal statistical rates and tight rate in terms of all parameters for strongly convex losses.
The CLT fails for LLM evaluations with small data, leading to underestimation of uncertainty.
problem Inaccurate uncertainty estimates in LLM evaluations with small datasets.
method Alternative frequentist and Bayesian methods for uncertainty quantification.
result CLT-based methods underestimate uncertainty in small data settings.
Given a set of empirical observations, conditional density estimation aims to capture the statistical relationship between a conditional variable x and a dependent variable y by modeling their conditional probability p(y∣x). The paper develops best practices for conditional den…
Develops a deep learning approach for statistical arbitrage.
problem Temporal price differences between similar assets.
method Constructs arbitrage portfolios using latent asset pricing factors and a convolutional transformer for time series signals.
result High risk-adjusted returns and Sharpe ratios with optimal trading policy.
Benchmarking deep time series models for equity portfolios
problem Selecting the best deep time series model for equity portfolios
method Using a CRSP benchmark and multi-criteria acceptability analysis
result No architecture dominates the benchmark, with TransEnc-8 having the highest rank-1 acceptability
Machine learning (ML) has become a vital part in many aspects of our daily life. However, building well performing machine learning applications requires highly specialized data scientists and domain experts. Automated machine learning (AutoML) aims to reduce the demand for data scientists by enabling domain experts to…
Enhanced tabular benchmarks for energy-efficient neural architecture search.
problem Energy consumption in deep learning models.
method Introducing EC-NAS, an enhanced tabular benchmark with energy consumption data.
result EC-NAS reveals a balance between energy usage and accuracy in neural architecture search.