Tootfinder

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

Learned Controllers for Agile Quadrotors in Pursuit-Evasion Games
Alejandro Sanchez Roncero, Olov Andersson, Petter Ogren
https://arxiv.org/abs/2506.02849 …

Learned Controllers for Agile Quadrotors in Pursuit-Evasion Games
The increasing proliferation of small UAVs in civilian and military airspace has raised critical safety and security concerns, especially when unauthorized or malicious drones enter restricted zones. In this work, we present a reinforcement learning (RL) framework for agile 1v1 quadrotor pursuit-evasion. We train neural network policies to command body rates and collective thrust, enabling high-speed pursuit and evasive maneuvers that fully exploit the quadrotor's nonlinear dynamics. To mitigat…

A Hybrid Perspective on Suboptimal Mixed-Integer Quadratic Programming
Luke Fina, Christopher Petersen
https://arxiv.org/abs/2507.02772 https://

A Hybrid Perspective on Suboptimal Mixed-Integer Quadratic Programming
This work solves suboptimal mixed-integer quadratic programs recursively for feedback control of dynamical systems. The proposed framework leverages parametric mixed-integer quadratic programming (MIQP) and hybrid systems theory to model a recursive MIQP feedback controller and a feedback controlled dynamical system. The proposed hybrid framework theoretically encodes the suboptimal part via solver parameters as bounded perturbations from the optimal solution set. The stability of the proposed …

Cusp forms of weight 1/2 and pairs of quadratic forms
Andr\'as Bir\'o
https://arxiv.org/abs/2507.02522 https://arxiv.org/pdf/…

Cusp forms of weight 1/2 and pairs of quadratic forms
We prove a spectral summation formula for the product of four Fourier coefficients of half-integral weight cusp forms in Kohnen's subspace. The other side of the formula involves certain generalized class numbers of pairs of quadratic forms with integer coefficients.

Isotopisms of quadratic quasigroups
Jack Allsop
https://arxiv.org/abs/2506.02446 https://arxiv.org/pdf/2506.02446

Isotopisms of quadratic quasigroups
A quasigroup is a pair $(Q, \cdot)$ where $Q$ is a non-empty set and $\cdot$ is a binary operation on $Q$ such that for every $(u, v) \in Q^2$ there exists a unique $(x, y) \in Q^2$ such that $u \cdot x = v = y \cdot u$. Let $q$ be an odd prime power, let $\mathbb{F}_q$ denote the finite field of order $q$, and let $\mathcal{R}_q$ denote the set of non-zero squares in $\mathbb{F}_q$. Let $\{a, b\} \subseteq \mathbb{F}_q$ be such that $\{ab, (a-1)(b-1)\} \subseteq \mathcal{R}_q$. Let $\mathcal{Q…

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…

Efficient Quadratic Corrections for Frank-Wolfe Algorithms
Jannis Halbey, Seta Rakotomandimby, Mathieu Besan\c{c}on, Sebastian Pokutta
https://arxiv.org/abs/2506.02635

Efficient Quadratic Corrections for Frank-Wolfe Algorithms
We develop a Frank-Wolfe algorithm with corrective steps, generalizing previous algorithms including blended pairwise conditional gradients and fully-corrective Frank-Wolfe, and propose a highly efficient corrective algorithm in the case of convex quadratic objectives based on linear optimization or linear system solving, akin to Wolfe's minimum-norm point. Beyond optimization problems that are directly quadratic, we revisit two algorithms, split conditional gradient for the intersection of two…

HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming
Kaihuang Chen, Defeng Sun, Yancheng Yuan, Guojun Zhang, Xinyuan Zhao
https://arxiv.org/abs/2507.02470

HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming
In this paper, we introduce HPR-QP, a dual Halpern Peaceman-Rachford (HPR) method designed for solving large-scale convex composite quadratic programming. One distinctive feature of HPR-QP is that, instead of working with the primal formulations, it builds on the novel restricted Wolfe dual introduced in recent years. It also leverages the symmetric Gauss-Seidel technique to simplify subproblem updates without introducing auxiliary slack variables that typically lead to slow convergence. By res…

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

Efficient Quadratic Corrections for Frank-Wolfe Algorithms
We develop a Frank-Wolfe algorithm with corrective steps, generalizing previous algorithms including blended pairwise conditional gradients and fully-corrective Frank-Wolfe, and propose a highly efficient corrective algorithm in the case of convex quadratic objectives based on linear optimization or linear system solving, akin to Wolfe's minimum-norm point. Beyond optimization problems that are directly quadratic, we revisit two algorithms, split conditional gradient for the intersection of two…

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

First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts
In this paper, we propose a systematic approach for constructing first-order projected algorithms for optimization problems with general set constraints, building upon their unconstrained counterparts. We show that these projected algorithms retain the same linear convergence rate bounds, when the latter are obtained for the unconstrained algorithms via quadratic Lyapunov functions arising from integral quadratic constraint (IQC) characterizations. The projected algorithms are constructed by ap…