mailitics

Category: cs.LG

  • Conformal Prediction with Cellwise Outliers: A Detect-then-Impute Approach

    Conformal Prediction with Cellwise Outliers: A Detect-then-Impute Approach arXiv:2505.04986v1 Announce Type: new Abstract: Conformal prediction is a powerful tool for constructing prediction intervals for black-box models, providing a finite sample coverage guarantee for exchangeable data. However, this exchangeability is compromised when some entries of the test feature are contaminated, such as in the case of…

  • A Two-Sample Test of Text Generation Similarity

    A Two-Sample Test of Text Generation Similarity arXiv:2505.05269v1 Announce Type: new Abstract: The surge in digitized text data requires reliable inferential methods on observed textual patterns. This article proposes a novel two-sample text test for comparing similarity between two groups of documents. The hypothesis is whether the probabilistic mapping generating the textual data is identical…

  • Boosting Statistic Learning with Synthetic Data from Pretrained Large Models

    Boosting Statistic Learning with Synthetic Data from Pretrained Large Models arXiv:2505.04992v1 Announce Type: new Abstract: The rapid advancement of generative models, such as Stable Diffusion, raises a key question: how can synthetic data from these models enhance predictive modeling? While they can generate vast amounts of datasets, only a subset meaningfully improves performance. We propose…

  • Categorical and geometric methods in statistical, manifold, and machine learning

    Categorical and geometric methods in statistical, manifold, and machine learning arXiv:2505.03862v1 Announce Type: new Abstract: We present and discuss applications of the category of probabilistic morphisms, initially developed in cite{Le2023}, as well as some geometric methods to several classes of problems in statistical, machine and manifold learning which shall be, along with many other topics,…

  • Cer-Eval: Certifiable and Cost-Efficient Evaluation Framework for LLMs

    Cer-Eval: Certifiable and Cost-Efficient Evaluation Framework for LLMs arXiv:2505.03814v1 Announce Type: new Abstract: As foundation models continue to scale, the size of trained models grows exponentially, presenting significant challenges for their evaluation. Current evaluation practices involve curating increasingly large datasets to assess the performance of large language models (LLMs). However, there is a lack of…

  • Variational Formulation of the Particle Flow Particle Filter

    Variational Formulation of the Particle Flow Particle Filter arXiv:2505.04007v1 Announce Type: new Abstract: This paper provides a formulation of the particle flow particle filter from the perspective of variational inference. We show that the transient density used to derive the particle flow particle filter follows a time-scaled trajectory of the Fisher-Rao gradient flow in the…

  • A Tutorial on Discriminative Clustering and Mutual Information

    A Tutorial on Discriminative Clustering and Mutual Information arXiv:2505.04484v1 Announce Type: new Abstract: To cluster data is to separate samples into distinctive groups that should ideally have some cohesive properties. Today, numerous clustering algorithms exist, and their differences lie essentially in what can be perceived as “cohesive properties”. Therefore, hypotheses on the nature of clusters…

  • From Two Sample Testing to Singular Gaussian Discrimination

    From Two Sample Testing to Singular Gaussian Discrimination arXiv:2505.04613v1 Announce Type: new Abstract: We establish that testing for the equality of two probability measures on a general separable and compact metric space is equivalent to testing for the singularity between two corresponding Gaussian measures on a suitable Reproducing Kernel Hilbert Space. The corresponding Gaussians are…

  • Modeling Spatial Extremes using Non-Gaussian Spatial Autoregressive Models via Convolutional Neural Networks

    Modeling Spatial Extremes using Non-Gaussian Spatial Autoregressive Models via Convolutional Neural Networks arXiv:2505.03034v1 Announce Type: new Abstract: Data derived from remote sensing or numerical simulations often have a regular gridded structure and are large in volume, making it challenging to find accurate spatial models that can fill in missing grid cells or simulate the process…

  • GeoERM: Geometry-Aware Multi-Task Representation Learning on Riemannian Manifolds

    GeoERM: Geometry-Aware Multi-Task Representation Learning on Riemannian Manifolds arXiv:2505.02972v1 Announce Type: new Abstract: Multi-Task Learning (MTL) seeks to boost statistical power and learning efficiency by discovering structure shared across related tasks. State-of-the-art MTL representation methods, however, usually treat the latent representation matrix as a point in ordinary Euclidean space, ignoring its often non-Euclidean geometry, thus…

  • A Symbolic and Statistical Learning Framework to Discover Bioprocessing Regulatory Mechanism: Cell Culture Example

    A Symbolic and Statistical Learning Framework to Discover Bioprocessing Regulatory Mechanism: Cell Culture Example arXiv:2505.03177v1 Announce Type: new Abstract: Bioprocess mechanistic modeling is essential for advancing intelligent digital twin representation of biomanufacturing, yet challenges persist due to complex intracellular regulation, stochastic system behavior, and limited experimental data. This paper introduces a symbolic and statistical learning…

  • Weighted Average Gradients for Feature Attribution

    Weighted Average Gradients for Feature Attribution arXiv:2505.03201v1 Announce Type: new Abstract: In explainable AI, Integrated Gradients (IG) is a widely adopted technique for assessing the significance of feature attributes of the input on model outputs by evaluating contributions from a baseline input to the current input. The choice of the baseline input significantly influences the…

  • Lower Bounds for Greedy Teaching Set Constructions

    Lower Bounds for Greedy Teaching Set Constructions arXiv:2505.03223v1 Announce Type: new Abstract: A fundamental open problem in learning theory is to characterize the best-case teaching dimension $operatorname{TS}_{min}$ of a concept class $mathcal{C}$ with finite VC dimension $d$. Resolving this problem will, in particular, settle the conjectured upper bound on Recursive Teaching Dimension posed by [Simon…

  • TV-SurvCaus: Dynamic Representation Balancing for Causal Survival Analysis

    TV-SurvCaus: Dynamic Representation Balancing for Causal Survival Analysis arXiv:2505.01785v1 Announce Type: new Abstract: Estimating the causal effect of time-varying treatments on survival outcomes is a challenging task in many domains, particularly in medicine where treatment protocols adapt over time. While recent advances in representation learning have improved causal inference for static treatments, extending these methods…

  • Fast Likelihood-Free Parameter Estimation for L’evy Processes

    Fast Likelihood-Free Parameter Estimation for L’evy Processes arXiv:2505.01639v1 Announce Type: new Abstract: L’evy processes are widely used in financial modeling due to their ability to capture discontinuities and heavy tails, which are common in high-frequency asset return data. However, parameter estimation remains a challenge when associated likelihoods are unavailable or costly to compute. We propose…

  • Bayesian learning of the optimal action-value function in a Markov decision process

    Bayesian learning of the optimal action-value function in a Markov decision process arXiv:2505.01859v1 Announce Type: new Abstract: The Markov Decision Process (MDP) is a popular framework for sequential decision-making problems, and uncertainty quantification is an essential component of it to learn optimal decision-making strategies. In particular, a Bayesian framework is used to maintain beliefs about…

  • Extended Fiducial Inference for Individual Treatment Effects via Deep Neural Networks

    Extended Fiducial Inference for Individual Treatment Effects via Deep Neural Networks arXiv:2505.01995v1 Announce Type: new Abstract: Individual treatment effect estimation has gained significant attention in recent data science literature. This work introduces the Double Neural Network (Double-NN) method to address this problem within the framework of extended fiducial inference (EFI). In the proposed method, deep…

  • Learning the Simplest Neural ODE

    Learning the Simplest Neural ODE arXiv:2505.02019v1 Announce Type: new Abstract: Since the advent of the “Neural Ordinary Differential Equation (Neural ODE)” paper, learning ODEs with deep learning has been applied to system identification, time-series forecasting, and related areas. Exploiting the diffeomorphic nature of ODE solution maps, neural ODEs has also enabled their use in generative…

  • On the emergence of numerical instabilities in Next Generation Reservoir Computing

    On the emergence of numerical instabilities in Next Generation Reservoir Computing arXiv:2505.00846v1 Announce Type: new Abstract: Next Generation Reservoir Computing (NGRC) is a low-cost machine learning method for forecasting chaotic time series from data. However, ensuring the dynamical stability of NGRC models during autonomous prediction remains a challenge. In this work, we uncover a key…

  • DOLCE: Decomposing Off-Policy Evaluation/Learning into Lagged and Current Effects

    DOLCE: Decomposing Off-Policy Evaluation/Learning into Lagged and Current Effects arXiv:2505.00961v1 Announce Type: new Abstract: Off-policy evaluation (OPE) and off-policy learning (OPL) for contextual bandit policies leverage historical data to evaluate and optimize a target policy. Most existing OPE/OPL methods–based on importance weighting or imputation–assume common support between the target and logging policies. When this assumption…

  • Characterization and Learning of Causal Graphs from Hard Interventions

    Characterization and Learning of Causal Graphs from Hard Interventions arXiv:2505.01037v1 Announce Type: new Abstract: A fundamental challenge in the empirical sciences involves uncovering causal structure through observation and experimentation. Causal discovery entails linking the conditional independence (CI) invariances in observational data to their corresponding graphical constraints via d-separation. In this paper, we consider a general…

  • Gaussian Differential Private Bootstrap by Subsampling

    Gaussian Differential Private Bootstrap by Subsampling arXiv:2505.01197v1 Announce Type: new Abstract: Bootstrap is a common tool for quantifying uncertainty in data analysis. However, besides additional computational costs in the application of the bootstrap on massive data, a challenging problem in bootstrap based inference under Differential Privacy consists in the fact that it requires repeated access…

  • Provable Efficiency of Guidance in Diffusion Models for General Data Distribution

    Provable Efficiency of Guidance in Diffusion Models for General Data Distribution arXiv:2505.01382v1 Announce Type: new Abstract: Diffusion models have emerged as a powerful framework for generative modeling, with guidance techniques playing a crucial role in enhancing sample quality. Despite their empirical success, a comprehensive theoretical understanding of the guidance effect remains limited. Existing studies only…

  • Inference for max-linear Bayesian networks with noise

    Inference for max-linear Bayesian networks with noise arXiv:2505.00229v1 Announce Type: new Abstract: Max-Linear Bayesian Networks (MLBNs) provide a powerful framework for causal inference in extreme-value settings; we consider MLBNs with noise parameters with a given topology in terms of the max-plus algebra by taking its logarithm. Then, we show that an estimator of a parameter…

  • On the expressivity of deep Heaviside networks

    On the expressivity of deep Heaviside networks arXiv:2505.00110v1 Announce Type: new Abstract: We show that deep Heaviside networks (DHNs) have limited expressiveness but that this can be overcome by including either skip connections or neurons with linear activation. We provide lower and upper bounds for the Vapnik-Chervonenkis (VC) dimensions and approximation rates of these network…

  • Reinforcement Learning with Continuous Actions Under Unmeasured Confounding

    Reinforcement Learning with Continuous Actions Under Unmeasured Confounding arXiv:2505.00304v1 Announce Type: new Abstract: This paper addresses the challenge of offline policy learning in reinforcement learning with continuous action spaces when unmeasured confounders are present. While most existing research focuses on policy evaluation within partially observable Markov decision processes (POMDPs) and assumes discrete action spaces, we…

  • Statistical Learning for Heterogeneous Treatment Effects: Pretraining, Prognosis, and Prediction

    Statistical Learning for Heterogeneous Treatment Effects: Pretraining, Prognosis, and Prediction arXiv:2505.00310v1 Announce Type: new Abstract: Robust estimation of heterogeneous treatment effects is a fundamental challenge for optimal decision-making in domains ranging from personalized medicine to educational policy. In recent years, predictive machine learning has emerged as a valuable toolbox for causal estimation, enabling more flexible…

  • Hypothesis-free discovery from epidemiological data by automatic detection and local inference for tree-based nonlinearities and interactions

    Hypothesis-free discovery from epidemiological data by automatic detection and local inference for tree-based nonlinearities and interactions arXiv:2505.00571v1 Announce Type: new Abstract: In epidemiological settings, Machine Learning (ML) is gaining popularity for hypothesis-free discovery of risk (or protective) factors. Although ML is strong at discovering non-linearities and interactions, this power is currently compromised by a lack…

  • Kernel Density Machines

    Kernel Density Machines arXiv:2504.21419v1 Announce Type: new Abstract: We introduce kernel density machines (KDM), a novel density ratio estimator in a reproducing kernel Hilbert space setting. KDM applies to general probability measures on countably generated measurable spaces without restrictive assumptions on continuity, or the existence of a Lebesgue density. For computational efficiency, we incorporate a…

  • Generate-then-Verify: Reconstructing Data from Limited Published Statistics

    Generate-then-Verify: Reconstructing Data from Limited Published Statistics arXiv:2504.21199v1 Announce Type: new Abstract: We study the problem of reconstructing tabular data from aggregate statistics, in which the attacker aims to identify interesting claims about the sensitive data that can be verified with 100% certainty given the aggregates. Successful attempts in prior work have conducted studies in…

  • Wasserstein-Aitchison GAN for angular measures of multivariate extremes

    Wasserstein-Aitchison GAN for angular measures of multivariate extremes arXiv:2504.21438v1 Announce Type: new Abstract: Economically responsible mitigation of multivariate extreme risks — extreme rainfall in a large area, huge variations of many stock prices, widespread breakdowns in transportation systems — requires estimates of the probabilities that such risks will materialize in the future. This paper develops…

  • A comparison of generative deep learning methods for multivariate angular simulation

    A comparison of generative deep learning methods for multivariate angular simulation arXiv:2504.21505v1 Announce Type: new Abstract: With the recent development of new geometric and angular-radial frameworks for multivariate extremes, reliably simulating from angular variables in moderate-to-high dimensions is of increasing importance. Empirical approaches have the benefit of simplicity, and work reasonably well in low dimensions,…

  • Balancing Interpretability and Flexibility in Modeling Diagnostic Trajectories with an Embedded Neural Hawkes Process Model

    Balancing Interpretability and Flexibility in Modeling Diagnostic Trajectories with an Embedded Neural Hawkes Process Model arXiv:2504.21795v1 Announce Type: new Abstract: The Hawkes process (HP) is commonly used to model event sequences with self-reinforcing dynamics, including electronic health records (EHRs). Traditional HPs capture self-reinforcement via parametric impact functions that can be inspected to understand how each…

  • Coreset selection for the Sinkhorn divergence and generic smooth divergences

    Coreset selection for the Sinkhorn divergence and generic smooth divergences arXiv:2504.20194v1 Announce Type: new Abstract: We introduce CO2, an efficient algorithm to produce convexly-weighted coresets with respect to generic smooth divergences. By employing a functional Taylor expansion, we show a local equivalence between sufficiently regular losses and their second order approximations, reducing the coreset selection…

  • Learning and Generalization with Mixture Data

    Learning and Generalization with Mixture Data arXiv:2504.20651v1 Announce Type: new Abstract: In many, if not most, machine learning applications the training data is naturally heterogeneous (e.g. federated learning, adversarial attacks and domain adaptation in neural net training). Data heterogeneity is identified as one of the major challenges in modern day large-scale learning. A classical way…

  • Sobolev norm inconsistency of kernel interpolation

    Sobolev norm inconsistency of kernel interpolation arXiv:2504.20617v1 Announce Type: new Abstract: We study the consistency of minimum-norm interpolation in reproducing kernel Hilbert spaces corresponding to bounded kernels. Our main result give lower bounds for the generalization error of the kernel interpolation measured in a continuous scale of norms that interpolate between $L^2$ and the hypothesis…

  • Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms

    Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms arXiv:2504.20877v1 Announce Type: new Abstract: The objective of canonical multi-armed bandits is to identify and repeatedly select an arm with the largest reward, often in the form of the expected value of the arm’s probability distribution. Such a utilitarian perspective and focus on the probability models’ first…

  • Decoding Latent Spaces: Assessing the Interpretability of Time Series Foundation Models for Visual Analytics

    Decoding Latent Spaces: Assessing the Interpretability of Time Series Foundation Models for Visual Analytics arXiv:2504.20099v1 Announce Type: cross Abstract: The present study explores the interpretability of latent spaces produced by time series foundation models, focusing on their potential for visual analysis tasks. Specifically, we evaluate the MOMENT family of models, a set of transformer-based, pre-trained…

  • Statistical Inference for Clustering-based Anomaly Detection

    Statistical Inference for Clustering-based Anomaly Detection arXiv:2504.18633v1 Announce Type: new Abstract: Unsupervised anomaly detection (AD) is a fundamental problem in machine learning and statistics. A popular approach to unsupervised AD is clustering-based detection. However, this method lacks the ability to guarantee the reliability of the detected anomalies. In this paper, we propose SI-CLAD (Statistical Inference…

  • Local Polynomial Lp-norm Regression

    Local Polynomial Lp-norm Regression arXiv:2504.18695v1 Announce Type: new Abstract: The local least squares estimator for a regression curve cannot provide optimal results when non-Gaussian noise is present. Both theoretical and empirical evidence suggests that residuals often exhibit distributional properties different from those of a normal distribution, making it worthwhile to consider estimation based on other…

  • Foundations of Safe Online Reinforcement Learning in the Linear Quadratic Regulator: $sqrt{T}$-Regret

    Foundations of Safe Online Reinforcement Learning in the Linear Quadratic Regulator: $sqrt{T}$-Regret arXiv:2504.18657v1 Announce Type: new Abstract: Understanding how to efficiently learn while adhering to safety constraints is essential for using online reinforcement learning in practical applications. However, proving rigorous regret bounds for safety-constrained reinforcement learning is difficult due to the complex interaction between safety,…

  • A Dictionary of Closed-Form Kernel Mean Embeddings

    A Dictionary of Closed-Form Kernel Mean Embeddings arXiv:2504.18830v1 Announce Type: new Abstract: Kernel mean embeddings — integrals of a kernel with respect to a probability distribution — are essential in Bayesian quadrature, but also widely used in other computational tools for numerical integration or for statistical inference based on the maximum mean discrepancy. These methods…

  • ReLU integral probability metric and its applications

    ReLU integral probability metric and its applications arXiv:2504.18897v1 Announce Type: new Abstract: We propose a parametric integral probability metric (IPM) to measure the discrepancy between two probability measures. The proposed IPM leverages a specific parametric family of discriminators, such as single-node neural networks with ReLU activation, to effectively distinguish between distributions, making it applicable in…

  • Learning Operators by Regularized Stochastic Gradient Descent with Operator-valued Kernels

    Learning Operators by Regularized Stochastic Gradient Descent with Operator-valued Kernels arXiv:2504.18184v1 Announce Type: new Abstract: This paper investigates regularized stochastic gradient descent (SGD) algorithms for estimating nonlinear operators from a Polish space to a separable Hilbert space. We assume that the regression operator lies in a vector-valued reproducing kernel Hilbert space induced by an operator-valued…

  • Learning Enhanced Ensemble Filters

    Learning Enhanced Ensemble Filters arXiv:2504.17836v1 Announce Type: new Abstract: The filtering distribution in hidden Markov models evolves according to the law of a mean-field model in state–observation space. The ensemble Kalman filter (EnKF) approximates this mean-field model with an ensemble of interacting particles, employing a Gaussian ansatz for the joint distribution of the state and…

  • Post-Transfer Learning Statistical Inference in High-Dimensional Regression

    Post-Transfer Learning Statistical Inference in High-Dimensional Regression arXiv:2504.18212v1 Announce Type: new Abstract: Transfer learning (TL) for high-dimensional regression (HDR) is an important problem in machine learning, particularly when dealing with limited sample size in the target task. However, there currently lacks a method to quantify the statistical significance of the relationship between features and the…

  • Generalization Guarantees for Multi-View Representation Learning and Application to Regularization via Gaussian Product Mixture Prior

    Generalization Guarantees for Multi-View Representation Learning and Application to Regularization via Gaussian Product Mixture Prior arXiv:2504.18455v1 Announce Type: new Abstract: We study the problem of distributed multi-view representation learning. In this problem, $K$ agents observe each one distinct, possibly statistically correlated, view and independently extracts from it a suitable representation in a manner that a…

  • Enhancing Visual Interpretability and Explainability in Functional Survival Trees and Forests

    Enhancing Visual Interpretability and Explainability in Functional Survival Trees and Forests arXiv:2504.18498v1 Announce Type: new Abstract: Functional survival models are key tools for analyzing time-to-event data with complex predictors, such as functional or high-dimensional inputs. Despite their predictive strength, these models often lack interpretability, which limits their value in practical decision-making and risk analysis. This…

  • Physics-informed features in supervised machine learning

    Physics-informed features in supervised machine learning arXiv:2504.17112v1 Announce Type: new Abstract: Supervised machine learning involves approximating an unknown functional relationship from a limited dataset of features and corresponding labels. The classical approach to feature-based machine learning typically relies on applying linear regression to standardized features, without considering their physical meaning. This may limit model explainability,…

  • Causal rule ensemble approach for multi-arm data

    Causal rule ensemble approach for multi-arm data arXiv:2504.17166v1 Announce Type: new Abstract: Heterogeneous treatment effect (HTE) estimation is critical in medical research. It provides insights into how treatment effects vary among individuals, which can provide statistical evidence for precision medicine. While most existing methods focus on binary treatment situations, real-world applications often involve multiple interventions.…

  • Likelihood-Free Variational Autoencoders

    Likelihood-Free Variational Autoencoders arXiv:2504.17622v1 Announce Type: new Abstract: Variational Autoencoders (VAEs) typically rely on a probabilistic decoder with a predefined likelihood, most commonly an isotropic Gaussian, to model the data conditional on latent variables. While convenient for optimization, this choice often leads to likelihood misspecification, resulting in blurry reconstructions and poor data fidelity, especially for…

  • Evaluating Uncertainty in Deep Gaussian Processes

    Evaluating Uncertainty in Deep Gaussian Processes arXiv:2504.17719v1 Announce Type: new Abstract: Reliable uncertainty estimates are crucial in modern machine learning. Deep Gaussian Processes (DGPs) and Deep Sigma Point Processes (DSPPs) extend GPs hierarchically, offering promising methods for uncertainty quantification grounded in Bayesian principles. However, their empirical calibration and robustness under distribution shift relative to baselines…

  • (Im)possibility of Automated Hallucination Detection in Large Language Models

    (Im)possibility of Automated Hallucination Detection in Large Language Models arXiv:2504.17004v1 Announce Type: cross Abstract: Is automated hallucination detection possible? In this work, we introduce a theoretical framework to analyze the feasibility of automatically detecting hallucinations produced by large language models (LLMs). Inspired by the classical Gold-Angluin framework for language identification and its recent adaptation to…

  • Covariate-dependent Graphical Model Estimation via Neural Networks with Statistical Guarantees

    Covariate-dependent Graphical Model Estimation via Neural Networks with Statistical Guarantees arXiv:2504.16356v1 Announce Type: new Abstract: Graphical models are widely used in diverse application domains to model the conditional dependencies amongst a collection of random variables. In this paper, we consider settings where the graph structure is covariate-dependent, and investigate a deep neural network-based approach to…

  • Behavior of prediction performance metrics with rare events

    Behavior of prediction performance metrics with rare events arXiv:2504.16185v1 Announce Type: new Abstract: Area under the receiving operator characteristic curve (AUC) is commonly reported alongside binary prediction models. However, there are concerns that AUC might be a misleading measure of prediction performance in the rare event setting. This setting is common since many events of…

  • Towards Accurate Forecasting of Renewable Energy : Building Datasets and Benchmarking Machine Learning Models for Solar and Wind Power in France

    Towards Accurate Forecasting of Renewable Energy : Building Datasets and Benchmarking Machine Learning Models for Solar and Wind Power in France arXiv:2504.16100v1 Announce Type: cross Abstract: Accurate prediction of non-dispatchable renewable energy sources is essential for grid stability and price prediction. Regional power supply forecasts are usually indirect through a bottom-up approach of plant-level forecasts,…

  • Physics-Informed Inference Time Scaling via Simulation-Calibrated Scientific Machine Learning

    Physics-Informed Inference Time Scaling via Simulation-Calibrated Scientific Machine Learning arXiv:2504.16172v1 Announce Type: cross Abstract: High-dimensional partial differential equations (PDEs) pose significant computational challenges across fields ranging from quantum chemistry to economics and finance. Although scientific machine learning (SciML) techniques offer approximate solutions, they often suffer from bias and neglect crucial physical insights. Inspired by inference-time…

  • Probabilistic Emulation of the Community Radiative Transfer Model Using Machine Learning

    Probabilistic Emulation of the Community Radiative Transfer Model Using Machine Learning arXiv:2504.16192v1 Announce Type: cross Abstract: The continuous improvement in weather forecast skill over the past several decades is largely due to the increasing quantity of available satellite observations and their assimilation into operational forecast systems. Assimilating these observations requires observation operators in the form…

  • Transfer Learning for High-dimensional Reduced Rank Time Series Models

    Transfer Learning for High-dimensional Reduced Rank Time Series Models arXiv:2504.15691v1 Announce Type: new Abstract: The objective of transfer learning is to enhance estimation and inference in a target data by leveraging knowledge gained from additional sources. Recent studies have explored transfer learning for independent observations in complex, high-dimensional models assuming sparsity, yet research on time…

  • From predictions to confidence intervals: an empirical study of conformal prediction methods for in-context learning

    From predictions to confidence intervals: an empirical study of conformal prediction methods for in-context learning arXiv:2504.15722v1 Announce Type: new Abstract: Transformers have become a standard architecture in machine learning, demonstrating strong in-context learning (ICL) abilities that allow them to learn from the prompt at inference time. However, uncertainty quantification for ICL remains an open challenge,…

  • How Private is Your Attention? Bridging Privacy with In-Context Learning

    How Private is Your Attention? Bridging Privacy with In-Context Learning arXiv:2504.16000v1 Announce Type: new Abstract: In-context learning (ICL)-the ability of transformer-based models to perform new tasks from examples provided at inference time-has emerged as a hallmark of modern language models. While recent works have investigated the mechanisms underlying ICL, its feasibility under formal privacy constraints…

  • Explainable Unsupervised Anomaly Detection with Random Forest

    Explainable Unsupervised Anomaly Detection with Random Forest arXiv:2504.16075v1 Announce Type: new Abstract: We describe the use of an unsupervised Random Forest for similarity learning and improved unsupervised anomaly detection. By training a Random Forest to discriminate between real data and synthetic data sampled from a uniform distribution over the real data bounds, a distance measure…

  • Significativity Indices for Agreement Values

    Significativity Indices for Agreement Values arXiv:2504.15325v1 Announce Type: cross Abstract: Agreement measures, such as Cohen’s kappa or intraclass correlation, gauge the matching between two or more classifiers. They are used in a wide range of contexts from medicine, where they evaluate the effectiveness of medical treatments and clinical trials, to artificial intelligence, where they can…

  • Learning over von Mises-Fisher Distributions via a Wasserstein-like Geometry

    Learning over von Mises-Fisher Distributions via a Wasserstein-like Geometry arXiv:2504.14164v1 Announce Type: new Abstract: We introduce a novel, geometry-aware distance metric for the family of von Mises-Fisher (vMF) distributions, which are fundamental models for directional data on the unit hypersphere. Although the vMF distribution is widely employed in a variety of probabilistic learning tasks involving…

  • Optimal Scheduling of Dynamic Transport

    Optimal Scheduling of Dynamic Transport arXiv:2504.14425v1 Announce Type: new Abstract: Flow-based methods for sampling and generative modeling use continuous-time dynamical systems to represent a {transport map} that pushes forward a source measure to a target measure. The introduction of a time axis provides considerable design freedom, and a central question is how to exploit this…

  • Expected Free Energy-based Planning as Variational Inference

    Expected Free Energy-based Planning as Variational Inference arXiv:2504.14898v1 Announce Type: new Abstract: We address the problem of planning under uncertainty, where an agent must choose actions that not only achieve desired outcomes but also reduce uncertainty. Traditional methods often treat exploration and exploitation as separate objectives, lacking a unified inferential foundation. Active inference, grounded in…

  • On the Tunability of Random Survival Forests Model for Predictive Maintenance

    On the Tunability of Random Survival Forests Model for Predictive Maintenance arXiv:2504.14744v1 Announce Type: new Abstract: This paper investigates the tunability of the Random Survival Forest (RSF) model in predictive maintenance, where accurate time-to-failure estimation is crucial. Although RSF is widely used due to its flexibility and ability to handle censored data, its performance is…

  • Advanced posterior analyses of hidden Markov models: finite Markov chain imbedding and hybrid decoding

    Advanced posterior analyses of hidden Markov models: finite Markov chain imbedding and hybrid decoding arXiv:2504.15156v1 Announce Type: new Abstract: Two major tasks in applications of hidden Markov models are to (i) compute distributions of summary statistics of the hidden state sequence, and (ii) decode the hidden state sequence. We describe finite Markov chain imbedding (FMCI)…

  • Gradient-Free Sequential Bayesian Experimental Design via Interacting Particle Systems

    Gradient-Free Sequential Bayesian Experimental Design via Interacting Particle Systems arXiv:2504.13320v1 Announce Type: new Abstract: We introduce a gradient-free framework for Bayesian Optimal Experimental Design (BOED) in sequential settings, aimed at complex systems where gradient information is unavailable. Our method combines Ensemble Kalman Inversion (EKI) for design optimization with the Affine-Invariant Langevin Dynamics (ALDI) sampler for…

  • Predicting Forced Responses of Probability Distributions via the Fluctuation-Dissipation Theorem and Generative Modeling

    Predicting Forced Responses of Probability Distributions via the Fluctuation-Dissipation Theorem and Generative Modeling arXiv:2504.13333v1 Announce Type: new Abstract: We present a novel data-driven framework for estimating the response of higher-order moments of nonlinear stochastic systems to small external perturbations. The classical Generalized Fluctuation-Dissipation Theorem (GFDT) links the unperturbed steady-state distribution to the system’s linear response.…

  • On the minimax optimality of Flow Matching through the connection to kernel density estimation

    On the minimax optimality of Flow Matching through the connection to kernel density estimation arXiv:2504.13336v1 Announce Type: new Abstract: Flow Matching has recently gained attention in generative modeling as a simple and flexible alternative to diffusion models, the current state of the art. While existing statistical guarantees adapt tools from the analysis of diffusion models,…

  • On the Convergence of Irregular Sampling in Reproducing Kernel Hilbert Spaces

    On the Convergence of Irregular Sampling in Reproducing Kernel Hilbert Spaces arXiv:2504.13623v1 Announce Type: new Abstract: We analyse the convergence of sampling algorithms for functions in reproducing kernel Hilbert spaces (RKHS). To this end, we discuss approximation properties of kernel regression under minimalistic assumptions on both the kernel and the input data. We first prove…

  • Near-optimal algorithms for private estimation and sequential testing of collision probability

    Near-optimal algorithms for private estimation and sequential testing of collision probability arXiv:2504.13804v1 Announce Type: new Abstract: We present new algorithms for estimating and testing emph{collision probability}, a fundamental measure of the spread of a discrete distribution that is widely used in many scientific fields. We describe an algorithm that satisfies $(alpha, beta)$-local differential privacy and…

  • Robust and Scalable Variational Bayes

    Robust and Scalable Variational Bayes arXiv:2504.12528v1 Announce Type: new Abstract: We propose a robust and scalable framework for variational Bayes (VB) that effectively handles outliers and contamination of arbitrary nature in large datasets. Our approach divides the dataset into disjoint subsets, computes the posterior for each subset, and applies VB approximation independently to these posteriors.…

  • Resonances in reflective Hamiltonian Monte Carlo

    Resonances in reflective Hamiltonian Monte Carlo arXiv:2504.12374v1 Announce Type: new Abstract: In high dimensions, reflective Hamiltonian Monte Carlo with inexact reflections exhibits slow mixing when the particle ensemble is initialised from a Dirac delta distribution and the uniform distribution is targeted. By quantifying the instantaneous non-uniformity of the distribution with the Sinkhorn divergence, we elucidate…

  • Spectral Algorithms under Covariate Shift

    Spectral Algorithms under Covariate Shift arXiv:2504.12625v1 Announce Type: new Abstract: Spectral algorithms leverage spectral regularization techniques to analyze and process data, providing a flexible framework for addressing supervised learning problems. To deepen our understanding of their performance in real-world scenarios where the distributions of training and test data may differ, we conduct a rigorous investigation…

  • When do Random Forests work?

    When do Random Forests work? arXiv:2504.12860v1 Announce Type: new Abstract: We study the effectiveness of randomizing split-directions in random forests. Prior literature has shown that, on the one hand, randomization can reduce variance through decorrelation, and, on the other hand, randomization regularizes and works in low signal-to-noise ratio (SNR) environments. First, we bring together and…

  • Propagation of Chaos in One-hidden-layer Neural Networks beyond Logarithmic Time

    Propagation of Chaos in One-hidden-layer Neural Networks beyond Logarithmic Time arXiv:2504.13110v1 Announce Type: new Abstract: We study the approximation gap between the dynamics of a polynomial-width neural network and its infinite-width counterpart, both trained using projected gradient descent in the mean-field scaling regime. We demonstrate how to tightly bound this approximation gap through a differential…

  • FEAT: Free energy Estimators with Adaptive Transport

    FEAT: Free energy Estimators with Adaptive Transport arXiv:2504.11516v1 Announce Type: new Abstract: We present Free energy Estimators with Adaptive Transport (FEAT), a novel framework for free energy estimation — a critical challenge across scientific domains. FEAT leverages learned transports implemented via stochastic interpolants and provides consistent, minimum-variance estimators based on escorted Jarzynski equality and controlled…

  • Normalizing Flow Regression for Bayesian Inference with Offline Likelihood Evaluations

    Normalizing Flow Regression for Bayesian Inference with Offline Likelihood Evaluations arXiv:2504.11554v1 Announce Type: new Abstract: Bayesian inference with computationally expensive likelihood evaluations remains a significant challenge in many scientific domains. We propose normalizing flow regression (NFR), a novel offline inference method for approximating posterior distributions. Unlike traditional surrogate approaches that require additional sampling or inference…

  • Towards Interpretable Deep Generative Models via Causal Representation Learning

    Towards Interpretable Deep Generative Models via Causal Representation Learning arXiv:2504.11609v1 Announce Type: new Abstract: Recent developments in generative artificial intelligence (AI) rely on machine learning techniques such as deep learning and generative modeling to achieve state-of-the-art performance across wide-ranging domains. These methods’ surprising performance is due in part to their ability to learn implicit “representations”…

  • Discrimination-free Insurance Pricing with Privatized Sensitive Attributes

    Discrimination-free Insurance Pricing with Privatized Sensitive Attributes arXiv:2504.11775v1 Announce Type: new Abstract: Fairness has emerged as a critical consideration in the landscape of machine learning algorithms, particularly as AI continues to transform decision-making across societal domains. To ensure that these algorithms are free from bias and do not discriminate against individuals based on sensitive attributes…

  • Generalized probabilistic canonical correlation analysis for multi-modal data integration with full or partial observations

    Generalized probabilistic canonical correlation analysis for multi-modal data integration with full or partial observations arXiv:2504.11610v1 Announce Type: new Abstract: Background: The integration and analysis of multi-modal data are increasingly essential across various domains including bioinformatics. As the volume and complexity of such data grow, there is a pressing need for computational models that not only…

  • AB-Cache: Training-Free Acceleration of Diffusion Models via Adams-Bashforth Cached Feature Reuse

    AB-Cache: Training-Free Acceleration of Diffusion Models via Adams-Bashforth Cached Feature Reuse arXiv:2504.10540v1 Announce Type: new Abstract: Diffusion models have demonstrated remarkable success in generative tasks, yet their iterative denoising process results in slow inference, limiting their practicality. While existing acceleration methods exploit the well-known U-shaped similarity pattern between adjacent steps through caching mechanisms, they lack…

  • Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed Benchmarks

    Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed Benchmarks arXiv:2504.10598v1 Announce Type: new Abstract: We revisit online binary classification by shifting the focus from competing with the best-in-class binary loss to competing against relaxed benchmarks that capture smoothed notions of optimality. Instead of measuring regret relative to the exact minimal binary error — a…

  • Differentially Private Geodesic and Linear Regression

    Differentially Private Geodesic and Linear Regression arXiv:2504.11304v1 Announce Type: new Abstract: In statistical applications it has become increasingly common to encounter data structures that live on non-linear spaces such as manifolds. Classical linear regression, one of the most fundamental methodologies of statistical learning, captures the relationship between an independent variable and a response variable which…

  • Energy Matching: Unifying Flow Matching and Energy-Based Models for Generative Modeling

    Energy Matching: Unifying Flow Matching and Energy-Based Models for Generative Modeling arXiv:2504.10612v1 Announce Type: cross Abstract: Generative models often map noise to data by matching flows or scores, but these approaches become cumbersome for incorporating partial observations or additional priors. Inspired by recent advances in Wasserstein gradient flows, we propose Energy Matching, a framework that…

  • Double Machine Learning for Causal Inference under Shared-State Interference

    Double Machine Learning for Causal Inference under Shared-State Interference arXiv:2504.08836v1 Announce Type: new Abstract: Researchers and practitioners often wish to measure treatment effects in settings where units interact via markets and recommendation systems. In these settings, units are affected by certain shared states, like prices, algorithmic recommendations or social signals. We formalize this structure, calling…

  • An Incremental Non-Linear Manifold Approximation Method

    An Incremental Non-Linear Manifold Approximation Method arXiv:2504.09068v1 Announce Type: new Abstract: Analyzing high-dimensional data presents challenges due to the “curse of dimensionality”, making computations intensive. Dimension reduction techniques, categorized as linear or non-linear, simplify such data. Non-linear methods are particularly essential for efficiently visualizing and processing complex data structures in interactive and graphical applications. This…

  • Improving the evaluation of samplers on multi-modal targets

    Improving the evaluation of samplers on multi-modal targets arXiv:2504.08916v1 Announce Type: new Abstract: Addressing multi-modality constitutes one of the major challenges of sampling. In this reflection paper, we advocate for a more systematic evaluation of samplers towards two sources of difficulty that are mode separation and dimension. For this, we propose a synthetic experimental setting…

  • Dose-finding design based on level set estimation in phase I cancer clinical trials

    Dose-finding design based on level set estimation in phase I cancer clinical trials arXiv:2504.09157v1 Announce Type: new Abstract: The primary objective of phase I cancer clinical trials is to evaluate the safety of a new experimental treatment and to find the maximum tolerated dose (MTD). We show that the MTD estimation problem can be regarded…

  • No-Regret Generative Modeling via Parabolic Monge-Amp`ere PDE

    No-Regret Generative Modeling via Parabolic Monge-Amp`ere PDE arXiv:2504.09279v1 Announce Type: new Abstract: We introduce a novel generative modeling framework based on a discretized parabolic Monge-Amp`ere PDE, which emerges as a continuous limit of the Sinkhorn algorithm commonly used in optimal transport. Our method performs iterative refinement in the space of Brenier maps using a mirror…

  • Can SGD Select Good Fishermen? Local Convergence under Self-Selection Biases and Beyond

    Can SGD Select Good Fishermen? Local Convergence under Self-Selection Biases and Beyond arXiv:2504.07133v1 Announce Type: new Abstract: We revisit the problem of estimating $k$ linear regressors with self-selection bias in $d$ dimensions with the maximum selection criterion, as introduced by Cherapanamjeri, Daskalakis, Ilyas, and Zampetakis [CDIZ23, STOC’23]. Our main result is a $operatorname{poly}(d,k,1/varepsilon) + {k}^{O(k)}$…

  • Throughput-Optimal Scheduling Algorithms for LLM Inference and AI Agents

    Throughput-Optimal Scheduling Algorithms for LLM Inference and AI Agents arXiv:2504.07347v1 Announce Type: new Abstract: As demand for Large Language Models (LLMs) and AI agents rapidly grows, optimizing systems for efficient LLM inference becomes critical. While significant efforts have targeted system-level engineering, little is explored through a mathematical modeling and queuing perspective. In this paper, we…

  • Performance of Rank-One Tensor Approximation on Incomplete Data

    Performance of Rank-One Tensor Approximation on Incomplete Data arXiv:2504.07818v1 Announce Type: new Abstract: We are interested in the estimation of a rank-one tensor signal when only a portion $varepsilon$ of its noisy observation is available. We show that the study of this problem can be reduced to that of a random matrix model whose spectral…

  • Gradient-based Sample Selection for Faster Bayesian Optimization

    Gradient-based Sample Selection for Faster Bayesian Optimization arXiv:2504.07742v1 Announce Type: new Abstract: Bayesian optimization (BO) is an effective technique for black-box optimization. However, its applicability is typically limited to moderate-budget problems due to the cubic complexity in computing the Gaussian process (GP) surrogate model. In large-budget scenarios, directly employing the standard GP model faces significant…

  • Smoothed Distance Kernels for MMDs and Applications in Wasserstein Gradient Flows

    Smoothed Distance Kernels for MMDs and Applications in Wasserstein Gradient Flows arXiv:2504.07820v1 Announce Type: new Abstract: Negative distance kernels $K(x,y) := – |x-y|$ were used in the definition of maximum mean discrepancies (MMDs) in statistics and lead to favorable numerical results in various applications. In particular, so-called slicing techniques for handling high-dimensional kernel summations profit…

  • Deep spatio-temporal point processes: Advances and new directions

    Deep spatio-temporal point processes: Advances and new directions arXiv:2504.06364v1 Announce Type: new Abstract: Spatio-temporal point processes (STPPs) model discrete events distributed in time and space, with important applications in areas such as criminology, seismology, epidemiology, and social networks. Traditional models often rely on parametric kernels, limiting their ability to capture heterogeneous, nonstationary dynamics. Recent innovations…

  • Sparsified-Learning for Heavy-Tailed Locally Stationary Processes

    Sparsified-Learning for Heavy-Tailed Locally Stationary Processes arXiv:2504.06477v1 Announce Type: new Abstract: Sparsified Learning is ubiquitous in many machine learning tasks. It aims to regularize the objective function by adding a penalization term that considers the constraints made on the learned parameters. This paper considers the problem of learning heavy-tailed LSP. We develop a flexible and…

  • Deep Fair Learning: A Unified Framework for Fine-tuning Representations with Sufficient Networks

    Deep Fair Learning: A Unified Framework for Fine-tuning Representations with Sufficient Networks arXiv:2504.06470v1 Announce Type: new Abstract: Ensuring fairness in machine learning is a critical and challenging task, as biased data representations often lead to unfair predictions. To address this, we propose Deep Fair Learning, a framework that integrates nonlinear sufficient dimension reduction with deep…