High-Dimensional Robust Mean Estimation with Untrusted Batches
Maryam Aliakbarpour, Vladimir Braverman, Yuhan Liu, Junze Yin
https://arxiv.org/abs/2602.20698 https://arxiv.org/pdf/2602.20698 https://arxiv.org/html/2602.20698
arXiv:2602.20698v1 Announce Type: new
Abstract: We study high-dimensional mean estimation in a collaborative setting where data is contributed by $N$ users in batches of size $n$. In this environment, a learner seeks to recover the mean $\mu$ of a true distribution $P$ from a collection of sources that are both statistically heterogeneous and potentially malicious. We formalize this challenge through a double corruption landscape: an $\varepsilon$-fraction of users are entirely adversarial, while the remaining ``good'' users provide data from distributions that are related to $P$, but deviate by a proximity parameter $\alpha$.
Unlike existing work on the untrusted batch model, which typically measures this deviation via total variation distance in discrete settings, we address the continuous, high-dimensional regime under two natural variants for deviation: (1) good batches are drawn from distributions with a mean-shift of $\sqrt{\alpha}$, or (2) an $\alpha$-fraction of samples within each good batch are adversarially corrupted. In particular, the second model presents significant new challenges: in high dimensions, unlike discrete settings, even a small fraction of sample-level corruption can shift empirical means and covariances arbitrarily.
We provide two Sum-of-Squares (SoS) based algorithms to navigate this tiered corruption. Our algorithms achieve the minimax-optimal error rate $O(\sqrt{\varepsilon/n} \sqrt{d/nN} \sqrt{\alpha})$, demonstrating that while heterogeneity $\alpha$ represents an inherent statistical difficulty, the influence of adversarial users is suppressed by a factor of $1/\sqrt{n}$ due to the internal averaging afforded by the batch structure.
toXiv_bot_toot
Crosslisted article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Graph-Based Nearest-Neighbor Search without the Spread
Jeff Giliberti, Sariel Har-Peled, Jonas Sauer, Ali Vakilian
https://arxiv.org/abs/2602.06633 https://mastoxiv.page/@arXiv_csCG_bot/116039510003959758
- Tensor Hinted Mv Conjectures
Zhao Song
https://arxiv.org/abs/2602.07242 https://mastoxiv.page/@arXiv_csCC_bot/116045166832661818
- Compact Conformal Subgraphs
Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala, Aravindan Vijayaraghavan
https://arxiv.org/abs/2602.07530 https://mastoxiv.page/@arXiv_csLG_bot/116046310688959095
- The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching...
Jan Dreier, Nikolas M\"ahlmann, Sebastian Siebertz
https://arxiv.org/abs/2602.07606 https://mastoxiv.page/@arXiv_csCC_bot/116045172877973476
- A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
Owen Shen, Haoran Xu, Yinyu Ye, Peter Glynn, Patrick Jaillet
https://arxiv.org/abs/2602.07663 https://mastoxiv.page/@arXiv_mathOC_bot/116046008531918566
- Efficient Adaptive Data Analysis over Dense Distributions
Joon Suk Huh
https://arxiv.org/abs/2602.07732 https://mastoxiv.page/@arXiv_csLG_bot/116046380158677039
- Wheeler Bisimulations
Nicola Cotumaccio
https://arxiv.org/abs/2602.07964 https://mastoxiv.page/@arXiv_csFL_bot/116045203254419984
- Trellis codes with a good distance profile constructed from expander graphs
Yubin Zhu, Zitan Chen
https://arxiv.org/abs/2602.08718 https://mastoxiv.page/@arXiv_csIT_bot/116046151403913561
- Near-optimal Swap Regret Minimization for Convex Losses
Lunjia Hu, Jon Schneider, Yifan Wu
https://arxiv.org/abs/2602.08862 https://mastoxiv.page/@arXiv_csLG_bot/116046574152052711
- Distortion of Metric Voting with Bounded Randomness
Ziyi Cai, D. D. Gao, Prasanna Ramakrishnan, Kangning Wang
https://arxiv.org/abs/2602.08871 https://mastoxiv.page/@arXiv_csGT_bot/116045826992016756
toXiv_bot_toot
Experimental Validation of HomHBFEM Simulations of Fast Corrector Magnets for PETRA IV
Jan-Magnus Christmann, Laura Anna Maria D'Angelo, Herbert De Gersem, Sven Pfeiffer, Sajjad Hussain Mirza, Adeel Amjad, Lucas Rousselange, Matthias Thede
https://arxiv.org/abs/2602.14824 https://arxiv.org/pdf/2602.14824 https://arxiv.org/html/2602.14824
arXiv:2602.14824v1 Announce Type: new
Abstract: This paper presents experimental validation of the homogenized harmonic balance finite element method (HomHBFEM), which we have developed as a dedicated simulation technique for magnets with fast excitation cycles, in particular the fast corrector (FC) magnets for PETRA IV at DESY. The HomHBFEM allows efficient three-dimensional nonlinear eddy-current simulations of laminated magnets at elevated frequencies with a relatively coarse finite element (FE) mesh and without computationally expensive time-stepping. This is achieved by combining a frequency-domain-based homogenization technique with the harmonic balance FE method. The simulation results for the magnetic flux density along the axis of the FC magnets as a function of frequency and the resulting integrated transfer function (ITF) are compared to Hall probe and search coil measurements of the first prototype FC magnet for PETRA IV. A good agreement between simulated and measured ITFs is achieved for excitation frequencies from 10 Hz to 10 kHz.
toXiv_bot_toot
🇺🇦 Auf radioeins läuft...
Sault:
🎵 Good Things Will Come After the Pressure
#NowPlaying #Sault
https://saultglobal.bandcamp.com/track/good-things-will-come-after-the-pressure
https://open.spotify.com/track/1Q3UUPU4Pl4zVsmIDsQxDU
Schon gewusst❓
Wenn Du einen Beitrag des Bots ⭐ FAVORISIERST, erfährt das nur der Bot - nicht Deine FollowerInnen.
Wenn Du einen Song weitererempfehlen möchtest, dann 🔁 TEILE ihn❗
For a project to be truly #OpenSource (not to mention #FreeSoftware), it really needs to:
1. Have a *public* issue tracker that enables you to browse and search through issue reports *without* having to create an account.
2. Accept issue reports, with no strings attached. Yes, expecting registration is fine. Yes, expecting some effort to file a good bug report is fine. No, expecting people to ask permission, donate or otherwise put a lot of extra work to report a problem is not.
3. Do not close issue reports as "stale". Yes, it's fine to close a report if you really believe it was fixed, or if you asked for something and the user didn't reply for a long time. It's not fine to run a bot expecting users to jump every month so that the issue report that *you are ignoring* doesn't get closed.
If a project doesn't meet these, it's just a glorified throwaway code.
Good catch der automatischen Accounts.
Replaced article(s) found for q-bio.CB. https://arxiv.org/list/q-bio.CB/new
[1/1]:
- Is E. coli good at chemotaxis?
Robert G. Endres
https://
Both Ends Count! Just How Good are LLM Agents at "Text-to-Big SQL"?
Germ\'an T. Eizaguirre, Lars Tissen, Marc S\'anchez-Artigas
https://arxiv.org/abs/2602.21480
Kelvin wave and soliton propagation in classical viscous vortex filaments
Elio Sterkers, Giorgio Krstulovic
https://arxiv.org/abs/2602.22439 https://arxiv.org/pdf/2602.22439 https://arxiv.org/html/2602.22439
arXiv:2602.22439v1 Announce Type: new
Abstract: Vortex filaments are highly rotating localized structures of fluids that admits several types of excitation. Here, we study them by using numerical simulations of the three-dimensional incompressible Navier-Stokes equations. We first address the propagation of Kelvin waves, helicoidal excitations propagating along the filament, and measure their dispersion relation which turns out to be in good agreement with the original Lord Kelvin predictions. Then, inspired by the connection between vortex line dynamics and an integrable system, we show numerically the existence of solitons propagating along vortex filaments and study the collision of two of such structures. Finally, we show numerically the experimental feasibility of studying vortex solitons in the lab, by proposing an experiment for their generation.
toXiv_bot_toot
High-bandwidth frequency domain multiplexed readout of transition-edge sensors for neutrinoless double beta decay searches
M. Adami\v{c} (McGill,LBNL), M. Beretta (UCB,INFN), J. Camilleri (LBNL,Virginia Tech), C. Capelli (LBNL,Zurich U.), M. A. Dobbs (McGill), T. Elleflot (LBNL), B. K. Fujikawa (LBNL), Yu. G. Kolomensky (LBNL,UCB), D. Mayer (MIT), J. Montgomery (McGill), V. Novosad (ANL), A. M. Sindhwad (UCB), V. Singh (UCB), G. Smecher (t0.technology), A. Suzuki (LBNL), B. Welliver (UCB)
https://arxiv.org/abs/2601.23106 https://arxiv.org/pdf/2601.23106 https://arxiv.org/html/2601.23106
arXiv:2601.23106v1 Announce Type: new
Abstract: The next-generation of cryogenic neutrinoless double-beta decay experiments require increasingly fast readout in order to improve background discrimination. These experiments, operated as cryogenic calorimeters at $\sim$10 mK, are usually read out by high-impedance neutron transmutation doped (NTD) thermistors, which provide good energy resolution, but are limited by $\sim$1 ms response times. Superconducting detectors, such as transition-edge sensors (TESs) with a time resolution of $\sim$100 $\mu$s, offer superior timing performance over NTD semiconductor bolometers. To make this technology viable for an application to a thousand or more channels, multiplexed readout is necessary in order to minimize the thermal load and radioactive contamination induced by the readout. Frequency-domain multiplexing readout (fMux) for TESs, previously developed at Berkeley Lab and McGill University, is currently in use for mm-wave telescopes with detector sampling rates in the order of 100 Hz. We demonstrate a new readout system, based on the McGill/Berkeley digital fMux readout, to satisfy the higher bandwidth and noise requirements of the next generation of TES-instrumented cryogenic calorimeters. The new readout samples detectors at 156 kHz, three orders of magnitude faster than its cosmology-oriented predecessor. Each multiplexing readout module comprises ten superconducting resonators in the MHz range and a superconducting quantum interference device (SQUID), interfaced to high-bandwidth field programmable gate array (FPGA)-based electronics for digital signal processing and low-latency feedback.
toXiv_bot_toot
Towards Efficient Data Structures for Approximate Search with Range Queries
Ladan Kian, Dariusz R. Kowalski
https://arxiv.org/abs/2602.06860 https://arxiv.org/pdf/2602.06860 https://arxiv.org/html/2602.06860
arXiv:2602.06860v1 Announce Type: new
Abstract: Range queries are simple and popular types of queries used in data retrieval. However, extracting exact and complete information using range queries is costly. As a remedy, some previous work proposed a faster principle, {\em approximate} search with range queries, also called single range cover (SRC) search. It can, however, produce some false positives. In this work we introduce a new SRC search structure, a $c$-DAG (Directed Acyclic Graph), which provably decreases the average number of false positives by logarithmic factor while keeping asymptotically same time and memory complexities as a classic tree structure. A $c$-DAG is a tunable augmentation of the 1D-Tree with denser overlapping branches ($c \geq 3$ children per node). We perform a competitive analysis of a $c$-DAG with respect to 1D-Tree and derive an additive constant time overhead and a multiplicative logarithmic improvement of the false positives ratio, on average. We also provide a generic framework to extend our results to empirical distributions of queries, and demonstrate its effectiveness for Gowalla dataset. Finally, we quantify and discuss security and privacy aspects of SRC search on $c$-DAG vs 1D-Tree, mainly mitigation of structural leakage, which makes $c$-DAG a good data structure candidate for deployment in privacy-preserving systems (e.g., searchable encryption) and multimedia retrieval.
toXiv_bot_toot
@… well done bot, you were mostly pretty good. There's a few little, mostly painless, tweaks I'll be doing before next week but don't worry, you won't feel a thing.
@arXiv_csLG_bot@mastoxiv.page
