Study compares different scoring rules for machine-learned weather forecasts, finding scale-awareness improves forecast realism.
problem Improving the accuracy of machine-learned probabilistic weather forecasts.
method Comparison of scoring rules (CRPS, fair global energy score, graph energy score) and analysis of their impact on forecast field spectra.
result Scale-awareness improves forecast realism, particularly in the tropics.
Paper provides conditions for reliable use of pre-trained embeddings in econometrics.
problem Uncertainty in using pre-trained embeddings for econometric tasks.
method Derives sufficient conditions and convergence rates for machine learning models with pre-trained embeddings.
result Establishes theoretical foundations for reliable use of pre-trained embeddings in econometrics.
Develops a machine learning model to predict ALS progression and assistive device use.
problem Challenges in predicting clinically meaningful milestones in ALS.
method Integrates longitudinal ALSFRS-R trajectories with survival modeling.
result Generates individualized survival curves and predicts wheelchair-free survival.
Microdata improves inflation forecasts after major shocks, study finds.
problem Forecasting inflation in a non-stationary environment with microeconomic data.
method Developed a scan test to detect periods of micro forecast outperformance, combined with adaptive machine learning.
result Micro forecasts improve inflation predictions after major shocks, especially after 2020.
Paper proposes new methods for improving interatomic potentials.
problem Limitations of conventional SO(2) Linear architectures in MLIPs.
method Direct Cartesian construction, recursive Clebsch-Gordan construction, Edge Complex Product Basis, Radial Rotary Complex Attention.
result TECE-OAM-RRA-1.0 achieves SOTA performance on Matbench Discovery.
Spectral deconfounding improves machine learning models by reducing hidden confounding effects.
problem Machine learning models can be misled by hidden confounders, leading to unreliable predictions.
method Develops a nonlinear spectral deconfounding framework for gradient boosting that modifies boosting dynamics to slow down in confounding-aligned directions.
result Spectrally deconfounded boosting improves estimation of the target function under hidden confounding and is more scalable.
A new imputation method estimates missing values by matching observed marginals from masked data.
problem Missing values in data undermine statistical and machine learning analysis.
method Estimates a distribution from masked observations using positive semi-definite kernel density estimation.
result The method yields both single and multiple imputations from the same fitted density, with statistical consistency and fast adaptive excess risk.
Methodology to measure lag relevance in time series models.
problem Measuring lag relevance in machine learning models for univariate time series.
method Ghost variables, Shapley values, additive importance measures, auto-relevance and partial auto-relevance functions, one-step forecast.
result Calculated relevance measures successfully demonstrate expected lag structure in almost all cases.
CIT and CIF improve feature selection for downstream prediction.
problem Feature selection bias in machine learning models.
method Conditional inference trees and forests with Bonferroni correction.
result CIF ranks top 3 among 18 regression methods and top 4 among 17 classification methods.
Optimizes data splitting for shorter conformal prediction intervals.
problem Minimizing prediction interval length while maintaining coverage.
method Theoretical framework for optimal data splitting in split conformal prediction.
result Analytical characterizations of length-optimal split ratios in various settings.
Improves numerical solution of ill-conditioned linear systems for machine learning.
problem Wastefulness and instability in solving ill-conditioned linear systems.
method autonugget combines Richardson extrapolation to determine the solution of the ill-conditioned system, improving accuracy over a single nugget.
result Improves accuracy of numerical solution of ill-conditioned linear systems.
Study identifies and estimates treatment effect heterogeneity within principal stratification subpopulations.
problem Causal inference with intermediate outcomes and treatment effect heterogeneity.
method Proposes a novel doubly cross-fit doubly robust machine learner to efficiently learn conditional principal causal effects under principal ignorability.
result Demonstrates informative patterns of treatment effect heterogeneity within the always-survivor subpopulation in an acute lung injury trial.
Improves full conformal prediction for stochastic non-conformity measures.
problem Inability of existing conditions to guarantee full conformal prediction validity under stochastic settings.
method Introduces a new sufficient condition: Conditional Independence & Permutation Invariance in Distribution.
result Corrects the insufficient condition and provides a new sufficient condition for full conformal prediction validity.
The paper introduces a framework to select efficient datasets for preserving model rankings.
problem Efficient evaluation of machine learning models on small, representative datasets.
method Bootstrap aggregation, clustering, design criteria, random baselines, and greedy farthest-first (FAFI).
result Several selection strategies improve rank preservation compared to random subsets, especially in time series classification.
Machine learning models outperform traditional econometric methods for forecasting term structure of government bonds
problem Forecasting the term structure of government bonds
method Combining traditional econometric models with neural network architectures
result Neural network models consistently outperform traditional models in both forecasting accuracy and portfolio performance
Algorithmic fairness is a field of study that addresses the systematic disadvantage of marginalized groups in machine learning systems.
problem Modern machine learning systems increasingly determine access to economic and social opportunities, leading to structural inequalities and prejudices.
method Statistical and structural approaches to algorithmic fairness.
result The field of algorithmic fairness emerged to address the systematic disadvantage of marginalized groups in machine learning systems.
FairBED: A Bayesian Experimental Design Approach to Gathering Fairer Data
problem Ensuring fairness in machine learning
method Bayesian Experimental Design
result Improved fairness-accuracy trade-offs
MLShrink integrates machine learning with wavelet shrinkage for denoising.
problem Denoising signals with uncertain magnitudes
method Combines wavelet shrinkage with machine learning
result Preserves simplicity for signal coefficients while allowing data-adaptive decisions for ambiguous coefficients
Develops local population-risk certificates for model updates
problem Model updates in machine learning
method Certify population-risk increments around a model
result Certified upper endpoint yields a risk-controlled update rule
Machine learning methods struggle with geometric data, but shape space analysis provides a framework for studying and analyzing geometric variability.
problem Machine learning methods struggle with geometric data
method Shape space analysis provides a mathematical and computational framework
result Characterizes shape variability, compares geometric objects, and analyzes structural trajectories
Uncertainty modeling for dynamical systems
problem Uncertainty modeling for dynamical systems
method Discussing sources of uncertainty, their nature, and task-specific objectives
result Identifying the types of uncertainty needed for dynamical systems
Time series analysis is a key component of machine learning, with applications in various fields.
problem Time series analysis in machine learning
method Basic concepts, classical statistical models, modern machine learning approaches
result Machine learning techniques for time series analysis
Surrogate-based analysis of interactions via local effect smooths
problem Detecting and characterizing feature interactions in machine learning models
method Surrogate-based analysis using generalized additive models
result Empirical validation of effectiveness for pairwise interactions
MEC-Cox: A Machine-Learning-Assisted Generalized Entropy Calibration Method for Estimating ATT Marginal Hazard-Ratio
problem Estimating ATT marginal hazard-ratio in externally controlled survival trials
method Machine-learning-assisted generalized entropy calibration for IPW Cox regression
result Reduces bias, increases efficiency, and improves coverage
Recovering hidden influence networks from cascade data using Jacobian-based machine learning.
problem Recovering influence networks behind dynamic cascades.
method CascadeNet, a Jacobian-based machine learning framework.
result CascadeNet achieves high accuracy in network recovery.
This paper speeds up mean curvature computation for high-dimensional data.
problem Efficiently computing mean curvature in high-dimensional datasets.
method Two contributions: algebraic identity and truncated SVD approximation.
result Mean curvature computation reduced from O(m4) to O(k2m+kmp2). The paper identifies five extreme learning regimes for large linear autoencoders.
problem Understanding the learning dynamics of large weight-tied linear autoencoders.
method Formal loss-expansion hierarchy and analysis of gradient flow.
result Five extreme regimes associated with faces of a triangular prism.
New Roman pipeline detects astronomical transients.
problem Automated detection of transients from Roman Space Telescope data.
method Machine learning model RuBR for distinguishing real from fake detections.
result Effective real-bogus classification in Roman era.
ReSGA model improves VaR and ES forecasting with millions of parameters.
problem Limited parameter models are vulnerable to big data.
method Retrieval-enhanced self-grouping autoencoder (ReSGA) with millions of parameters.
result ReSGA outperforms competitors in VaR and ES forecasting.
New deep learning model estimates scattering timescale of FRBs efficiently.
problem Estimating scattering timescale of fast radio bursts (FRBs) is a bottleneck.
method Multimodal Transformer Based Generic Mixture Density Network (MT-GMDN) that ingests dynamic spectrum and timeseries profile.
result Achieves 94% R2 on expected value of τ for measurable scattering. OPAL optimizes labeling strategy for precise inference from uncertain models.
problem Inference from uncertain machine learning models is brittle.
method OPAL learns a smooth policy to adaptively label data points based on model uncertainty.
result OPAL yields estimators with the lowest variance and achieves nominal coverage in finite samples.
Sampling a fraction of pairs can match full evaluation in machine learning losses.
problem High computational cost of full pairwise loss evaluation.
method Survey sampling techniques targeting informative pairs.
result Performance close to full pairwise evaluation achieved with frugal sampling.
Bayesian approach improves Shapley value estimation efficiency.
problem Efficiently estimating Shapley values in machine learning models.
method Bayesian experimental design using Gaussian process surrogate and adaptive coalition selection.
result Consistently improves sample efficiency in low-budget settings.
New adaptive scheduler improves SAM for better model training.
problem Training machine learning models requires selecting a learning rate, which is often difficult and time-consuming.
method Derive Polyak schedulers tailored to SAM-style updates, proving linear convergence for strongly convex objectives and an O(1/T) rate for convex objectives.
result Polyak schedulers achieve comparable or better performance than tuned SAM baselines, reducing the need for learning-rate tuning.
The paper automates policy learning for nonlinear welfare criteria using machine learning and debiasing techniques.
problem Learning optimal policies from observational data with nonlinear welfare criteria.
method Modeling a nonlinear welfare criterion with a utility function, estimating propensity scores with machine learning, and using sieve approximations and cross-validation for model selection.
result The proposed policy learning method satisfies oracle inequalities, providing theoretical guarantees on performance.
New optimization method helps models generalize better after achieving near-perfect training performance.
problem Models can achieve near-perfect training performance but fail to generalize well to unseen examples.
method GROKtimizer combines rapid convergence to interpolation with post-interpolation norm minimization using Critically Damped Momentum.
result GROKtimizer provides a quadratic speedup over classical gradient descent, offering a natural solution for selecting low-norm interpolating solutions.
QTAML models quantum tunneling errors for AI robustness.
problem Quantum tunneling errors in AI inference.
method Derives weight-error distribution using WKB approximation, introduces TAC algorithm.
result TAC achieves 95% clean accuracy with 3.4-33.6x less ECC overhead.
New method predicts model performance under selection bias in healthcare.
problem Selection bias limits model generalizability in healthcare.
method Proposes a novel upper bound method for estimating model performance.
result Validates and demonstrates the practical utility of the method.
This paper develops nudging algorithms using learned surrogates for state estimation in dynamical systems.
problem Estimating the state of a dynamical system from partial observations when dynamics are unknown or expensive to simulate.
method Unified finite-dimensional analysis of nudging algorithms employing learned surrogate models of the dynamics.
result Nudging algorithms with surrogate models retain exponential convergence up to an explicit error floor.
New method approximates curvature from symmetries in deep networks.
problem Hard to approximate curvature in large deep networks.
method Analytically averaging over group actions that leave the loss invariant to construct structured Hessian approximations.
result Structured Hessian approximations from single gradients can be estimated, stored, and inverted.
AI methods broaden signal discovery in scientific data.
problem Limited coverage of possible signals in model-dependent searches.
method Model-agnostic AI strategies for broad exploration.
result Enhanced discovery potential in experimental science.
Last-layer approximation improves UQ performance without sacrificing computational efficiency.
problem Epistemic uncertainty quantification for deep neural networks.
method Comparison of full-network and last-layer linearization using theoretical and empirical approaches.
result Last-layer approximation yields comparable UQ performance with improved computational efficiency.
The paper develops deep learning models for personalized treatment rules in survival analysis.
problem Deriving optimal treatment rules for bivariate survival outcomes in randomized trials.
method Adaptive prediction-powered learning using deep neural networks and stochastic policies.
result Maximizes joint survival probability beyond fixed time points (t1,t2). The conditional-mean barrier helps diagnose deterministic surrogates missing uncertainty.
problem Uncertainty in deterministic surrogates for complex systems.
method Developed diagnostics to locate the conditional-mean barrier and prove its necessity for distributional objectives.
result Crossing the barrier requires a loss that scores distributions, not point predictions.
Develops efficient inference for noise heterogeneity in machine learning models.
problem Downstream procedures based on residuals can be biased in additive noise models.
method Semiparametrically efficient inference using a novel Hilbert-valued one-step estimator.
result Constructs tests and confidence intervals for residual independence and goodness of fit.
Paper proposes SCQ and P-TAMS for structured OOD testing in high-stakes ML.
problem Difficulty of incorporating auxiliary information in traditional conformal methods.
method Structure-adaptive conformal q-value (SCQ) and pseudo-score-guided transductive automated model selection (P-TAMS).
result Unified framework controls false discovery rate and improves power across diverse settings.
New algorithms improve approximation of matrix norms, with applications in statistics and machine learning.
problem Improving approximation of matrix norms for 2ightarrowq in polynomial time. method Polynomial-time multiplicative approximation algorithms for 2ightarrowq norm, leveraging sum-of-squares certificates. result Achieved polynomially improved approximation factors, notably d1/8 for q=4. This paper proposes a new clustering method based on Stochastic Dominance for asset allocation.
problem Traditional clustering methods fail to capture risk dominance relationships among assets.
method Integrates Stochastic Dominance theory with machine learning algorithms to construct a Stochastic Dominance Coefficient Matrix and modify clustering algorithms.
result The proposed method effectively facilitates customized asset allocation for investors.
Joint training improves model accuracy by selectively using privileged information.
problem Two-stage training can lead to model failure with noisy privileged information.
method Joint training of two models to use privileged information selectively.
result Joint training outperforms two-stage baselines on synthetic and real-world tasks.
Develops a new approach to establish universality for any-dimensional machine learning models.
problem Understanding universality for models with inputs of varying sizes.
method Identifies any-dimensional functions with a unique function in an infinite-dimensional limit space, using symmetries and relations between inputs of different sizes.
result Establishes universality for several existing architectures and proposes modifications to restore it.
The paper proposes a new method for creating interpretable models using convex optimization.
problem Creating models that are both accurate and interpretable for decision-making.
method Formulates convex learning problems that combine interpretability with accuracy, using operator theory and parametric nonlinear models.
result Shows how to create efficient surrogate models that are both accurate and interpretable.
Bayesian neural networks improve SHD classification and uncertainty quantification.
problem Improving screening for structural heart disease using noninvasive ECG and echocardiography.
method Comparing frequentist and Bayesian neural network classifiers on the EchoNext dataset.
result Bayesian classifiers provide more robust uncertainty quantification.
ProxySHAP approximates Shapley and Banzhaf interactions efficiently.
problem Efficient estimation of complex machine learning interactions.
method ProxySHAP combines tree-based proxy models with residual correction.
result ProxySHAP achieves state-of-the-art interaction approximation quality.
Machine learning reconstructs aerodynamic forces from noisy data.
problem Accurately modeling aerodynamic forces with limited or noisy data.
method Physics-informed Gaussian processes trained on noisy structural responses.
result Strong agreement between true and predicted aerodynamic loads.
A new method for multiclass calibration using vector quantization.
problem Challenges in multiclass calibration, especially in high-stakes settings.
method Compositional approach via Vector Quantization (VQ) to learn region-specific calibration maps.
result Significant improvements in local calibration with competitive global calibration and predictive performance.
Generalizes machine learning models using localization kernels and local means.
problem Understanding and unifying diverse machine learning models.
method Formal definition of localization method through localization kernels and local means.
result Unified theoretical lens and new methodological tools for designing flexible learning systems.
New analysis shows transfer learning can significantly reduce sample size for complex models.
problem Reducing sample size needed for complex models like large language models.
method Optimal transport viewpoint applied to analyze transfer learning efficiency.
result Transfer learning can achieve better sample efficiency for complex models.
FLUXtrapolation benchmarks machine learning for extrapolating ecosystem fluxes under distribution shifts.
problem Machine learning challenges in extrapolating ecosystem fluxes under distribution shifts.
method Defined temporal, spatial, and temperature-based extrapolation scenarios; evaluated performance across domains, temporal aggregations, and tail errors.
result Baselines perform similarly under median hourly RMSE but differ under tail-focused and multi-scale evaluations.
Study on thermodynamic costs of simple linear regression.
problem Understanding thermodynamic costs in machine learning models.
method Approximated thermodynamic lower bounds for exact and stochastic linear regression.
result Derived scaling laws for optimal dataset size based on generalization error.
The paper extends IPC framework to stationary physical systems and validates it with a photonic system.
problem Characterizing the computational capabilities of stationary physical systems in a principled, data-efficient way.
method Extended IPC framework, established fundamental results, derived asymptotic bias, introduced data-efficient estimation methods.
result IPC strongly correlates with machine-learning performance and provides a reliable estimate of system dimensionality.