SearcharxivSearch

arXiv subjects

Dennis Wagner

Publications and source records attributed to Dennis Wagner.

6 recordsLinked to original sources

Minimax-Optimal Generalization Bounds for Smooth Deep Neural Networks Trained by (Stochastic) Gradient Descent

Characterizing the optimization dynamics and statistical performance of over-parameterized deep neural networks (DNNs) remains a central challenge in understanding the remarkable success of deep learning. We establish quantitative bounds showing that kernel gradient descent in the reproducing kernel Hilbert space induced by the deterministic infinite-width neural tangent kernel approximates finite-width deep regression with smooth activations under gradient descent (GD) and stochastic gradient descent (SGD) training. The approximation gap is governed by the network width and training horizon, with an additional stochastic gradient error in the SGD case. This connection provides a general mechanism for transferring learning-theoretic guarantees from kernel methods to deep regression. As an application, under general source and effective dimension conditions, we show that both GD- and SGD-trained DNNs attain the minimax-optimal excess population risk rate, up to logarithmic factors, provided that the network width grows polynomially in the sample size. To the best of our knowledge, these are the first such guarantees for standard fully connected deep neural networks with smooth activations trained by GD and SGD.

stat.ML

Formally Exploring Time-Series Anomaly Detection Evaluation Metrics

Undetected anomalies in time series can trigger catastrophic failures in safety-critical systems, such as chemical plant explosions or power grid outages. Although many detection methods have been proposed, their performance remains unclear because current metrics capture only narrow aspects of the task and often yield misleading results. We address this issue by introducing verifiable properties that formalize essential requirements for evaluating time-series anomaly detection. These properties enable a theoretical framework that supports principled evaluations and reliable comparisons. Analyzing 37 widely used metrics, we show that most satisfy only a few properties, and none satisfy all, explaining persistent inconsistencies in prior results. To close this gap, we propose LARM, a flexible metric that provably satisfies all properties, and extend it to ALARM, an advanced variant meeting stricter requirements.

cs.LG

DiffStyleTS: Diffusion Model for Style Transfer in Time Series

Style transfer combines the content of one signal with the style of another. It supports applications such as data augmentation and scenario simulation, helping machine learning models generalize in data-scarce domains. While well developed in vision and language, style transfer methods for time series data remain limited. We introduce DiffTSST, a diffusion-based framework that disentangles a time series into content and style representations via convolutional encoders and recombines them through a self-supervised attention-based diffusion process. At inference, encoders extract content and style from two distinct series, enabling conditional generation of novel samples to achieve style transfer. We demonstrate both qualitatively and quantitatively that DiffTSST achieves effective style transfer. We further validate its real-world utility by showing that data augmentation with DiffTSST improves anomaly detection in data-scarce regimes.

cs.LG

Non-linear integral equations for the XXX spin-1/2 quantum chain with non-diagonal boundary fields

The XXX spin-$\frac{1}{2}$ Heisenberg chain with non-diagonal boundary fields represents a cornerstone model in the study of integrable systems with open boundaries. Despite its significance, solving this model exactly has remained a formidable challenge due to the breaking of $U(1)$ symmetry. Building on the off-diagonal Bethe Ansatz (ODBA), we derive a set of nonlinear integral equations (NLIEs) that encapsulate the exact spectrum of the model. For $U(1)$ symmetric spin-$\frac{1}{2}$ chains such NLIEs involve two functions $a(x)$ and $\bar{a}(x)$ coupled by an integration kernel with short-ranged elements. The solution functions show characteristic features for arguments at some length scale which grows logarithmically with system size $N$. For the non $U(1)$ symmetric case, the equations involve a novel third function $c(x)$, which captures the inhomogeneous contributions of the $T$-$Q$ relation. The kernel elements coupling this function to the standard ones are long-ranged and lead for the ground-state to a winding phenomenon. In $\log(1+a(x))$ and $\log(1+\bar a(x))$ we observe a sudden change by $2\pi$i at a characteristic scale $x_1$ of the argument. Other features appear at a value $x_0$ which is of order $\log N$. These two length scales, $x_1$ and $x_0$, are independent: their ratio $x_1/x_0$ is large for small $N$ and small for large $N$. Explicit solutions to the NLIEs are obtained numerically for these limiting cases, though intermediate cases ($x_1/x_0 \sim 1$) present computational challenges. This work lays the foundation for studying finite-size corrections and conformal properties of other integrable spin chains with non-diagonal boundaries, opening new avenues for exploring boundary effects in quantum integrable systems.

cond-mat.str-el

Deep Anomaly Detection on Tennessee Eastman Process Data

This paper provides the first comprehensive evaluation and analysis of modern (deep-learning) unsupervised anomaly detection methods for chemical process data. We focus on the Tennessee Eastman process dataset, which has been a standard litmus test to benchmark anomaly detection methods for nearly three decades. Our extensive study will facilitate choosing appropriate anomaly detection methods in industrial applications.

cs.LG

A Concise Guide on the Integration of Battery Electric Buses into Urban Bus Networks

With the increasing market penetration of battery-electric buses into urban bus networks, practitioners face many novel planning problems. As a result, the interest in optimization-based decision-making for these planning problems increases but practitioners' requirements on planning solutions and current academic approaches often diverge. Against this background, this survey aims to provide a concise guide on optimization-based planning approaches for integrating battery-electric buses into urban bus networks for both practitioners and academics. First, we derive practitioners' requirements for integrating battery-electric buses from state-of-the-art specifications, project reports, and expert knowledge. Second, we analyze whether existing optimization-based planning models fulfill these practitioners' requirements. Based on this analysis, we carve out the existing gap between practice and research and discuss how to address these in future research.

eess.SY