Skip to content

Category

data science

2,791 papers

#machine learning Preprint May 2025

Multi-Task Learning with Covariate-Overlap Regularization

COVariate-ovERlap regularized multi-task learning (COVER) is proposed to address covariate and posterior heterogeneity and achieves the lowest response-averaged prediction error among the compared methods and reveals tissue-pair integration patterns.

Yang Sui, Qi Xu, Yang Bai et al. · 0 citations

Clustering and Pruning in Causal Data Fusion

This work proposes pruning (removing unnecessary variables) and clustering (combining variables) as preprocessing operations for causal data fusion and gives sufficient conditions for inferring the identifiability or non-identifiability of a causal effect in a larger graph based on a smaller graph.

Otto Tabell, S. Tikka, Juha Karvanen · 4 citations
#machine learning Preprint Open access Sep 2026

DDPM Score Matching and Distribution Learning

Score estimation is the backbone of score-based generative models (SGMs), especially denoising diffusion probabilistic models (DDPMs). A key result in this area shows that with accurate score estimates, SGMs can efficiently generate samples from any realistic data distribution (Chen et al., ICLR'23; Lee et al., ALT'23)...

Sinho Chewi, Alkis Kalavasis, Anay Mehrotra et al. · 0 citations

Approaching the Harm of Gradient Attacks While Only Flipping Labels

This work proposes a novel formalization of label flipping attacks as a per-round constrained optimization problem, derives a greedy label-selection rule for logistic regression, and empirically evaluates it beyond its derivation setting, including on MLPs and robust aggregators.

Abdessamad El-Kabid, El-Mahdi El-Mhamdi · 2 citations
#machine learning Preprint Oct 2024

On Generalisation Error Bounds for Transformers

This paper establishes a collection of covering number bounds for linear function classes under various norm constraints on the inputs and matrices and explicitly incorporates rank constraints on the underlying matrix classes, allowing us to characterize how low-rank structures affect the metric entropy.

Lan V. Truong · 3 citations · ⚡1
#machine learning Preprint Open access Sep 2026

Decision-Centered Abstractions via Orthogonal Estimation of Difference-of-Q Functions

Offline reinforcement learning enables evaluation and optimization of sequential decisions from historical data, when it is not possible to deploy new policies online due to safety, cost, and other concerns. Big data advances enable rich state information, but may naively include reward- and action- irrelevant dynamics...

Defu Cao, Angela Zhou · 0 citations
#machine learning Preprint Open access Sep 2026

Directed mixed membership stochastic blockmodel

Mixed membership modeling for undirected networks has been extensively explored in network science over the past few years. Despite the substantial progress made for undirected cases, handling mixed membership structures in directed networks continues to pose substantial difficulties. To address this gap, we introduce...

Huan Qing, Jingli Wang · 0 citations
#machine learning Preprint Open access Sep 2026

Linear and Quadratic Discriminant Analysis: Tutorial

This tutorial explains Linear Discriminant Analysis (LDA) and Quadratic Discriminant Analysis (QDA) as two fundamental classification methods in statistical and probabilistic learning. We start with the optimization of decision boundary on which the posteriors are equal. Then, LDA and QDA are derived for binary and mul...

Benyamin Ghojogh, Mark Crowley · 0 citations
#machine learning Preprint Aug 2026

K\"ahler landscapes for complex neural network descents and guarantees including a search and destroy of the Calabi-Yau manifold

It has been discovered that negative curvature subverts the loss landscape, specifically sectional curvature, so it has been discovered that negative curvature subverts the loss landscape, so this work expands on this and draw interconnections to negative-definite Ricci curvature.

Andrew Gracyk · 0 citations
#machine learning Preprint Aug 2026

ArborEnum: Decision Tree Rashomon Sets over Continuous Features

This work introduces the first algorithm that exactly enumerates decision-tree Rashomon sets while exploiting the ordered structure of continuous features, and develops a relaxation for approximate enumeration and an anytime algorithm that progressively refines the set of candidate thresholds, producing increasingly de...

Zakk Heile, Hayden McTavish, Margo I. Seltzer et al. · 0 citations
#machine learning Preprint Aug 2026

Noise in Diffusion Models Is a Learnable Input

The results indicate that diffusion noise is not merely a passive stochastic perturbation, but a learnable---and therefore potentially designable---input dimension.

Shengzhi Deng, Chenqi Ye, Yan-Ze Guo · 0 citations

From tech blogs

See all →

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.