Skip to content

Category

data science

3,683 papers

#machine learning Preprint Open access Nov 2026

How deep is your network? Deep vs. shallow learning of transfer operators

We introduce RaNNDy, a randomized neural network framework for learning transfer operators and their spectral decompositions. By fixing the weights of the hidden layers and training only the output layer, RaNNDy achieves significant reductions in computational costs -- often by two orders of magnitude -- with similar a...

Mohammad Tabish, Benedict Leimkuhler, Stefan Klus · 0 citations
#machine learning Preprint Open access Nov 2026

A Random Matrix Analysis of Symmetric Tensor Unfolding

We study a fundamental problem in machine learning: partial recovery of a planted signal $\boldsymbol{v} \in \mathbb{S}^{n-1}$ from a spiked tensor $\boldsymbol{\mathsf{X}} = \lambda \, \boldsymbol{v}^{\otimes p} + \boldsymbol{\mathsf{Z}}$, where $\boldsymbol{\mathsf{Z}}$ has symmetric Gaussian entries of variance $\as...

Tom Szwagier, Xiaoyi Mai, Jos\'e Henrique de Morais Goulart · 0 citations
#machine learning Preprint Open access Nov 2026

One-shot Distributed Learning via Weighted Averaging with Server-side Information

Distributed learning has drawn considerable attention due to its capability of learning from distributed data without aggregating raw observations. However, frequent exchange of model updates can become the main bottleneck of communication. Therefore, one-shot approaches where each worker fits a local model and sends i...

Pavle Tepav\v{c}evi\'{c}, Du\v{s}an Jakoveti\'{c}, Milo\v{s} Savi\'{c} · 0 citations
#machine learning Preprint Open access Nov 2026

Conditional independence and graphical models for rankings

Ranking models define probability distributions over rankings and are fundamental in applications such as preference learning and decision-making. Without structural assumptions, these models are intractable due to their factorial complexity. Although independence assumptions are key to reducing complexity and enabling...

Aritz P\'erez · 0 citations
#machine learning Preprint Open access Nov 2026

Nearly Linear-Time Follow-the-Perturbed-Leader for Weakly Observable Graph Bandits

We study online learning with directed weakly observable feedback graphs and propose a Follow-the-Perturbed-Leader (FTPL) policy that achieves best-of-both-worlds guarantee with nearly linear expected time complexity. To preserve the simple structure of FTPL, we develop a novel graph-based loss estimator that combines...

Jongyeong Lee, Hyundam Yoo · 0 citations
#machine learning Preprint Nov 2026

How Risky Is Your Data-Driven Policy?

Data-driven algorithms are ubiquitous across industries, and there is an extensive literature on analyzing their \emph{average} performance. The risk profile of such algorithms, while critical, is much less understood. This paper quantifies the risk of data-driven policies and isolates its sources. We evaluate a policy...

Omar Besbes, Alon Rieger · 0 citations
#machine learning Preprint Open access Nov 2026

Two-Layer Random ReLU Networks Can Separate Disjoint Classes

Set separation by continuous linear functionals is fundamental in functional analysis and convex optimization and underlies binary classification in machine learning. Support vector machines provide maximum-margin affine separators for linearly separable data, while kernel methods represent nonlinear decision rules thr...

Yichen Liu, Jianbin Yang · 0 citations
#machine learning Preprint Open access Nov 2026

Point interpolation and distributional universality in flow-based generative models

Motivated by the expressive power of neural ordinary differential equations in flow-based generative modeling, we study the approximation of probability measures by pushforwards generated by parameterized families of Lipschitz vector fields. For Wasserstein distances, we establish a quantitative relationship between fi...

Antonio \'Alvarez-L\'opez, Jingpu Cheng, Liyan Zhang et al. · 0 citations
#machine learning Preprint Open access Nov 2026

Descending Everest, Part II: Oracle Complexity of Minimizing a Sum of Convex $(L_0,L_1)$-Smooth Functions

We study the minimization of the average of $n$ convex $(L_0,L_1)$-smooth functions: the Hessian norm of each function is bounded by an affine function of its gradient norm. We assume known upper bounds $R$ on the distance from the starting point to a minimizer and $\delta$ on the difference between the minimum of the...

Mikhail Rudomanov, Ivan Fomin, Alexander V. Gasnikov et al. · 0 citations
#machine learning Preprint Nov 2026

Nonparametric GARCH: An Iterated Neural Estimator

This work studies nonparametric estimation and forecasting for GARCH-type processes and proposes an iterated neural estimator that alternates between estimating the recursion map and updating the unobserved conditional variances, which is minimax rate-optimal up to logarithmic factors.

Rui-Zhi Deng, Guo-Hao Shen, Ngai-Hang Chan · 0 citations
#machine learning Preprint Nov 2026

Logarithmic Regret for Alternating Mirror Descent

Alternating online mirror descent (AltOMD) is a simple learning rule for zero-sum games, which improves upon simultaneous OMD numerically and theoretically. Previous work obtained $O(T^{1/3})$ and $O(T^{1/5})$ regret bounds for AltOMD, by leveraging modified-energy-function-based analyses. However, settling whether Alt...

Tian-Long Nan, C. Kroer · 0 citations
#machine learning Preprint Open access Nov 2026

Privacy for Free in Efficient Agnostic Halfspace Learning

We provide the first computationally efficient, differentially private algorithms for agnostically learning halfspaces. In particular, we study three different settings of agnostic learning: improper learning under Gaussian and log-concave marginals; proper learning under Gaussian marginals; and semi-agnostic learning...

Giorgio Racca, Amartya Sanyal, Vikrant Singhal · 0 citations

From tech blogs

See all →
GPT-Lab Nov 3, 2026

Sovereignty Is the Option to Leave

Is your company’s AI sovereign? A practical guide for CIOs on AI vendor lock-in, EU Data Act switching, cloud sovereignty, and testing your exit plan before you need it. The post Sovereignty Is the Option to Leave appeared first on GPT-Lab.

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