Tootfinder

Jobcenter und Rathaus Wedding

Dass die Kantone und der Bund danach lechzen, unsere Daten zu ausländischen Cloudprovidern zu schicken, das ist ja schon länger ein Thema, nicht nur bei DNIP.
https://dnip.ch/2025/05/21/der-microso

This https://arxiv.org/abs/2502.18284 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_sta…

Nested Expectations with Kernel Quadrature
This paper considers the challenging computational task of estimating nested expectations. Existing algorithms, such as nested Monte Carlo or multilevel Monte Carlo, are known to be consistent but require a large number of samples at both inner and outer levels to converge. Instead, we propose a novel estimator consisting of nested kernel quadrature estimators and we prove that it has a faster convergence rate than all baseline methods when the integrands have sufficient smoothness. We then dem…

This https://arxiv.org/abs/1908.10505 has been replaced.
link: https://scholar.google.com/scholar?q=a

Spectral properties of graphs associated to the Basilica group
We provide the foundation of the spectral analysis of the Laplacian on the orbital Schreier graphs of the Basilica group, the iterated monodromy group of the quadratic polynomial $z^2-1$. This group is an important example in the class of self-similar amenable but not elementary amenable finite automata groups studied by Grigorchuk, Żuk, \v Sunić, Bartholdi, Virág, Nekrashevych, Kaimanovich, Nagnibeda et al. We prove that the spectrum of the Laplacian has infinitely many gaps and that the su…

Quadratic Segre indices
Felipe Espreafico, Stephen McKean, Sabrina Pauli
https://arxiv.org/abs/2506.01547 https://arxiv.org/pdf/2506.…

Quadratic Segre indices
We prove that the local Euler class of a line on a degree $2n-1$ hypersurface in projective $n+1$ space is given by a product of indices of Segre involutions. Segre involutions and their associated indices were first defined by Finashin and Kharlamov over the reals. Our result is valid over any field of characteristic not 2 and gives an infinite family of problems in enriched enumerative geometry with a shared geometric interpretation for the local type.

Semi-supervised Community Detection using Glauber Dynamics for an Ising Model
Konstantin Avrachenkov, Diego Goldsztajn
https://arxiv.org/abs/2506.09223 htt…

Semi-supervised Community Detection using Glauber Dynamics for an Ising Model
We consider graphs with two communities and analyze an algorithm for learning the community labels when the edges of the graph and only a small fraction of the labels are known in advance. The algorithm is based on the Glauber dynamics for an Ising model where the energy function includes a quadratic penalty on the magnetization. The analysis focuses on graphs sampled from a Stochastic Block Model (SBM) with slowly growing mean degree. We derive a mean-field limit for the magnetization of each …

This https://arxiv.org/abs/2405.19380 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_sta…

Approximate Thompson Sampling for Learning Linear Quadratic Regulators with $O(\sqrt{T})$ Regret
We propose a novel Thompson sampling algorithm that learns linear quadratic regulators (LQR) with a Bayesian regret bound of $O(\sqrt{T})$. Our method leverages Langevin dynamics with a carefully designed preconditioner and incorporates a simple excitation mechanism. We show that the excitation signal drives the minimum eigenvalue of the preconditioner to grow over time, thereby accelerating the approximate posterior sampling process. Furthermore, we establish nontrivial concentration propertie…

On Characterizations of Convex and Approximately Subadditive Sequences
Angshuman Robin Goswami
https://arxiv.org/abs/2505.22668 https://

On Characterizations of Convex and Approximately Subadditive Sequences
A sequence $\Big(u_n\Big)_{n=0}^{\infty}$ is said to be convex if it satisfies the following inequality $$ 2u_n\leq u_{n-1}+u_{n+1}\qquad \mbox{for all}\qquad n\in\mathbb{N}. $$ We present several characterizations of convex sequences and demonstrate that such sequences can be locally interpolated by quadratic polynomials. Furthermore, the converse assertion of this statement is also established. On the other hand, a sequence $\Big(u_n\Big)_{n=1}^{\infty}$ is called approximately subadditive …

This https://arxiv.org/abs/2502.00168 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_sta…

Supervised Quadratic Feature Analysis: Information Geometry Approach for Dimensionality Reduction
Supervised dimensionality reduction aims to map labeled data to a low-dimensional feature space while maximizing class discriminability. Directly computing discriminability is often impractical, so an alternative approach is to learn features that maximize a distance or dissimilarity measure between classes. The Fisher-Rao distance is an important information geometry distance in statistical manifolds. It is induced by the Fisher information metric, a tool widely used for understanding neural r…

This https://arxiv.org/abs/2505.23240 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Joint estimation of smooth graph signals from partial linear measurements
Given an undirected and connected graph $G$ on $T$ vertices, suppose each vertex $t$ has a latent signal $x_t \in \mathbb{R}^n$ associated to it. Given partial linear measurements of the signals, for a potentially small subset of the vertices, our goal is to estimate $x_t$'s. Assuming that the signals are smooth w.r.t $G$, in the sense that the quadratic variation of the signals over the graph is small, we obtain non-asymptotic bounds on the mean squared error for jointly recovering $x_t$'s, fo…