Tootfinder

CycleDistill: Bootstrapping Machine Translation using LLMs with Cyclical Distillation
Deepon Halder, Thanmay Jayakumar, Raj Dabre
https://arxiv.org/abs/2506.19952

CycleDistill: Bootstrapping Machine Translation using LLMs with Cyclical Distillation
Large language models (LLMs), despite their ability to perform few-shot machine translation (MT), often lag behind dedicated MT systems trained on parallel corpora, which are crucial for high quality machine translation (MT). However, parallel corpora are often scarce or non-existent for low-resource languages. In this paper, we propose CycleDistill, a bootstrapping approach leveraging LLMs and few-shot translation to obtain high-quality MT systems. CycleDistill involves iteratively generating …

A look at Swerve Sports, a FAST TV channel for women's sports launched by veteran TV executive Christy Tanner, as FAST TV grows despite data challenges (Claire Atkinson/The Media Mix)
https://www.themediamix.co/p/the-former-cbs-news-boss-bootstrapping
…

The Former CBS News Boss Bootstrapping a Women’s Sports Start-Up.
Christy Tanner is ready for a FAST fight to get more data from the platforms and put women's sport on the map. Plus streaming is almost half of all viewing now.

Bootstrapping Conditional Retrieval for User-to-Item Recommendations
Hongtao Lin, Haoyu Chen, Jaewon Jang, Jiajing Xu
https://arxiv.org/abs/2508.16793 https://

Bootstrapping Conditional Retrieval for User-to-Item Recommendations
User-to-item retrieval has been an active research area in recommendation system, and two tower models are widely adopted due to model simplicity and serving efficiency. In this work, we focus on a variant called \textit{conditional retrieval}, where we expect retrieved items to be relevant to a condition (e.g. topic). We propose a method that uses the same training data as standard two tower models but incorporates item-side information as conditions in query. This allows us to bootstrap new c…

Dr. Boot: Bootstrapping Program Synthesis Language Models to Perform Repairing
Noah van der Vleuten
https://arxiv.org/abs/2507.15889 https://

Dr. Boot: Bootstrapping Program Synthesis Language Models to Perform Repairing
Language models for program synthesis are usually trained and evaluated on programming competition datasets (MBPP, APPS). However, these datasets are limited in size and quality, while these language models are extremely data hungry. Additionally, the language models have a misaligned program synthesis process compared to humans. While humans iteratively develop code with the help of a compiler, most program synthesis models currently produce code in one go. To solve these issues, we introduce …

Data-driven Trust Bootstrapping for Mobile Edge Computing-based Industrial IoT Services
Prabath Abeysekara, Hai Dong
https://arxiv.org/abs/2508.12560 https://

Data-driven Trust Bootstrapping for Mobile Edge Computing-based Industrial IoT Services
We propose a data-driven and context-aware approach to bootstrap trustworthiness of homogeneous Internet of Things (IoT) services in Mobile Edge Computing (MEC) based industrial IoT (IIoT) systems. The proposed approach addresses key limitations in adapting existing trust bootstrapping approaches into MEC-based IIoT systems. These key limitations include, the lack of opportunity for a service consumer to interact with a lesser-known service over a prolonged period of time to get a robust measur…

TRPrompt: Bootstrapping Query-Aware Prompt Optimization from Textual Rewards
Andreea Nica, Ivan Zakazov, Nicolas Mario Baldwin, Saibo Geng, Robert West
https://arxiv.org/abs/2507.18618

TRPrompt: Bootstrapping Query-Aware Prompt Optimization from Textual Rewards
Prompt optimization improves the reasoning abilities of large language models (LLMs) without requiring parameter updates to the target model. Following heuristic-based "Think step by step" approaches, the field has evolved in two main directions: while one group of methods uses textual feedback to elicit improved prompts from general-purpose LLMs in a training-free way, a concurrent line of research relies on numerical rewards to train a special prompt model, tailored for providing optimal prom…

Bootstrapping Flat-band Superconductors: Rigorous Lower Bounds on Superfluid Stiffness
Qiang Gao, Zhaoyu Han, Eslam Khalaf
https://arxiv.org/abs/2506.18969

Bootstrapping Flat-band Superconductors: Rigorous Lower Bounds on Superfluid Stiffness
The superfluid stiffness fundamentally constrains the transition temperature of superconductors, especially in the strongly coupled regime. However, accurately determining this inherently quantum many-body property in microscopic models remains a significant challenge. In this work, we show how the \textit{quantum many-body bootstrap} framework, specifically the reduced density matrix (RDM) bootstrap, can be leveraged to obtain rigorous lower bounds on the superfluid stiffness in frustration fr…

from my link log —
Bootstrapping HTTP/1.1, HTTP/2, and HTTP/3.
https://www.netmeister.org/blog/http-123.html
saved 2025-05-29 http…

Bootstrapping HTTP/1.1, HTTP/2, and HTTP/3
How do we get from HTTP/1.1 all the way to 11... I mean, to HTTP/3? Let's look at the path browsers take.

Nonlinearities of Schwarzschild Black Hole Head-on Collisions
Alex Kehagias, Davide Perrone, Antonio Riotto
https://arxiv.org/abs/2508.17993 https://arxiv.…

Nonlinearities of Schwarzschild Black Hole Head-on Collisions
We derive analytically the amplitude of the quadratic quasi-normal mode generated in the ringdown stage of the gravitational waveform produced by the ultra-relativistic head-on collision of two non-spinning Schwarzschild black holes. Although being a highly nonlinear event, second-order perturbation theory suffices and that nonlinearities may be derived by a simple bootstrapping procedure.

Bootstrapping Gravity with Crossing Symmetric Dispersion Relations
Celina Pasiecznik
https://arxiv.org/abs/2506.09884 https://arxiv.o…

Bootstrapping Gravity with Crossing Symmetric Dispersion Relations
We derive bounds on Wilson coefficients in gravitational effective field theories using fully crossing symmetric dispersion relations. These sum rules naturally isolate finite subsets of low-energy couplings without relying on the forward limit or specific high-energy completions. We validate our method by matching bounds computed previously for scalar scattering with gravity as well as for supergraviton scattering. For graviton scattering we use crossing symmetric functions that combine variou…

CueLearner: Bootstrapping and local policy adaptation from relative feedback
Giulio Schiavi, Andrei Cramariuc, Lionel Ott, Roland Siegwart
https://arxiv.org/abs/2507.04730

CueLearner: Bootstrapping and local policy adaptation from relative feedback
Human guidance has emerged as a powerful tool for enhancing reinforcement learning (RL). However, conventional forms of guidance such as demonstrations or binary scalar feedback can be challenging to collect or have low information content, motivating the exploration of other forms of human input. Among these, relative feedback (i.e., feedback on how to improve an action, such as "more to the left") offers a good balance between usability and information richness. Previous research has shown th…

Bootstrapping Grounded Chain-of-Thought in Multimodal LLMs for Data-Efficient Model Adaptation
Jiaer Xia, Bingkui Tong, Yuhang Zang, Rui Shao, Kaiyang Zhou
https://arxiv.org/abs/2507.02859

Bootstrapping Grounded Chain-of-Thought in Multimodal LLMs for Data-Efficient Model Adaptation
Multimodal Large Language Models (MLLMs) have demonstrated remarkable capabilities in interpreting images using natural language. However, without using large-scale datasets for retraining, these models are difficult to adapt to specialized vision tasks, e.g., chart understanding. This problem is caused by a mismatch between pre-training and downstream datasets: pre-training datasets primarily concentrate on scenes and objects but contain limited information about specialized, non-object images…

On an Iterative Scheme for the Spinorial Yamabe Equation on Manifolds with Boundary
Eric Tr\'ebuchon
https://arxiv.org/abs/2506.18546 https://

On an Iterative Scheme for the Spinorial Yamabe Equation on Manifolds with Boundary
We study the existence of solutions to the spinorial Yamabe equation -- that is, the Euler--Lagrange equation associated with the conformal invariant introduced by S. Raulot -- for compact manifolds with boundary. For the inhomogeneous equation, we employ an iterative scheme to establish existence under smallness assumptions on the relevant parameters. Using bootstrapping methods, we extend the regularity of the solution to $C^\infty$ away from its zero set in the interior, and up to the bounda…

Replaced article(s) found for q-bio.NC. https://arxiv.org/list/q-bio.NC/new
[1/1]:
- Inverted Inference and Recursive Bootstrapping: A Primal-Dual Theory of Structured Cognition
Xin Li

Faster negative length shortest paths by bootstrapping hop reducers
Yufan Huang, Peter Jin, Kent Quanrud
https://arxiv.org/abs/2506.00428 https://

Faster negative length shortest paths by bootstrapping hop reducers
The textbook algorithm for real-weighted single-source shortest paths takes $O(m n)$ time on a graph with $m$ edges and $n$ vertices. The breakthrough algorithm by Fineman [Fin24] takes $\tilde{O}(m n^{8/9})$ randomized time. The running time was subsequently improved to $\tilde{O}(mn^{4/5})$ [HJQ25]. We build on [Fin24; HJQ25] to obtain an $\tilde{O}(m n^{3/4} + m^{4/5} n)$ randomized running time. (Equivalently, $\tilde{O}(mn^{3/4})$ for $m \geq n^{5/4}$, and $\tilde{O}(m^{4/5} n)$ for $m \…

Bootstrapping the Simplest Deconfined Quantum Critical Point
Shai M. Chester, Alessandro Piazza, Marten Reehorst, Ning Su
https://arxiv.org/abs/2507.06283 …

Bootstrapping the Simplest Deconfined Quantum Critical Point
We study the $N=3$ case of the $CP^{N-1}$ model, which is a field theory of $N$ complex scalars in $3d$ coupled to an Abelian gauge field with $SU(N) \times U(1)$ global symmetry. Recent evidence suggests the $N=2$ theory is not critical, which makes the $N=3$ theory the simplest possibility of deconfined quantum criticality. We apply the conformal bootstrap to correlators of charge $q=0,1,2$ scalar operators under the $U(1)$ symmetry, which gives us access also to $q=3,4$ operators. After impo…

Stability for multiple Lamb dipoles
Ken Abe, In-Jee Jeong, Yao Yao
https://arxiv.org/abs/2507.16474 https://arxiv.org/pdf/2507.16474

Stability for multiple Lamb dipoles
In the class of nonnegative vorticities on the half-plane, we establish the Lyapunov stability of finite sums of Lamb dipoles under the initial assumptions that the dipoles are sufficiently separated and that the faster dipoles are positioned to the right of the slower ones. Our approach combines sharp energy estimates near the Lamb dipoles with a Lagrangian bootstrapping scheme, enabling us to quantify the exchanges of circulation, enstrophy, impulse, and energy between various parts of the so…

Reinforcement Learning with Data Bootstrapping for Dynamic Subgoal Pursuit in Humanoid Robot Navigation
Chengyang Peng, Zhihao Zhang, Shiting Gong, Sankalp Agrawal, Keith A. Redmill, Ayonga Hereid
https://arxiv.org/abs/2506.02206

Reinforcement Learning with Data Bootstrapping for Dynamic Subgoal Pursuit in Humanoid Robot Navigation
Safe and real-time navigation is fundamental for humanoid robot applications. However, existing bipedal robot navigation frameworks often struggle to balance computational efficiency with the precision required for stable locomotion. We propose a novel hierarchical framework that continuously generates dynamic subgoals to guide the robot through cluttered environments. Our method comprises a high-level reinforcement learning (RL) planner for subgoal selection in a robot-centric coordinate syste…

Estimating prevalence with precision and accuracy
Aime Bienfait Igiraneza, Christophe Fraser, Robert Hinch
https://arxiv.org/abs/2507.06061 https://…

Estimating prevalence with precision and accuracy
Unlike classification, whose goal is to estimate the class of each data point in a dataset, prevalence estimation or quantification is a task that aims to estimate the distribution of classes in a dataset. The two main tasks in prevalence estimation are to adjust for bias, due to the prevalence in the training dataset, and to quantify the uncertainty in the estimate. The standard methods used to quantify uncertainty in prevalence estimates are bootstrapping and Bayesian quantification methods. …

Replaced article(s) found for cs.ET. https://arxiv.org/list/cs.ET/new
[1/1]:
- Bootstrapping, Autonomous Testing, and Initialization System for Si/SiGe Multi-quantum Dot Devices
Kovach, Schug, Wolfe, MacQuarrie, Walsh, Eskandari, Benson, Friesen, Eriksson, Zwolak

Replaced article(s) found for nlin.AO. https://arxiv.org/list/nlin.AO/new
[1/1]:
- Inverted Inference and Recursive Bootstrapping: A Primal-Dual Theory of Structured Cognition
Xin Li

Bootstrapping form factor squared in ${\cal N}=4$ super-Yang-Mills
Song He, Xiang Li, Jingwen Lin, Jiahao Liu, Kai Yan
https://arxiv.org/abs/2506.07796 htt…

Bootstrapping form factor squared in ${\cal N}=4$ super-Yang-Mills
We propose a bootstrap program for the {\it form factor squared} with operator ${\rm tr}(ϕ^2)$ in maximally supersymmetric Yang-Mills theory in the planar limit, which plays a central role for perturbative calculations of important physical observables such as energy correlators. The tree-level $N$-point form factor (FF) squared can be obtained by cutting $N$ propagators of a collection of two-point ``master diagrams" at $(N{-}1)$ loops: for $N=3,4,5,6$ there are merely $1, 2, 4, 13$ topologie…

Uncertainty quantification of synchrosqueezing transform under complicated nonstationary noise
Hau-Tieng Wu, Zhou Zhou
https://arxiv.org/abs/2506.00779 htt…

Uncertainty quantification of synchrosqueezing transform under complicated nonstationary noise
We propose a bootstrapping algorithm to quantify the uncertainty of the time-frequency representation (TFR) generated by the short-time Fourier transform (STFT)-based synchrosqueezing transform (SST) when the input signal is oscillatory with time-varying amplitude and frequency and contaminated by complex nonstationary noise. To this end, we leverage a recently developed high-dimensional Gaussian approximation technique to establish a sequential Gaussian approximation for nonstationary random p…

Crosslisted article(s) found for stat.CO. https://arxiv.org/list/stat.CO/new
[1/1]:
- Twin-Boot: Uncertainty-Aware Optimization via Online Two-Sample Bootstrapping
Carlos Stein Brito

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

Probabilistic Net Load Forecasting for High-Penetration RES Grids Utilizing Enhanced Conditional Diffusion Model
The proliferation of intermittent distributed renewable energy sources (RES) in modern power systems has fundamentally compromised the reliability and accuracy of deterministic net load forecasting. Generative models, particularly diffusion models, demonstrate exceptional potential in uncertainty quantification for scenario forecasting. Nevertheless, their probabilistic predictive capabilities and conditional bootstrapping mechanisms still remain underexplored. In this paper, a day-ahead probab…

Conventional and Fuzzy Data Envelopment Analysis with deaR
Vicente J. Bolos, Rafael Benitez, Vicente Coll-Serrano
https://arxiv.org/abs/2506.03766 https://…

Conventional and Fuzzy Data Envelopment Analysis with deaR
deaR is a recently developed R package for data envelopment analysis (DEA) that implements a large number of conventional and fuzzy models, along with super-efficiency models, cross-efficiency analysis, Malmquist index, bootstrapping, and metafrontier analysis. It should be noted that deaR is the only package to date that incorporates Kao-Liu, Guo-Tanaka and possibilistic fuzzy models. The versatility of the package allows the user to work with different returns to scale and orientations, as we…

Graph-based method for constructing consensus trees
Elio Torquet, Jesper Jansson, Nadia Tahiri
https://arxiv.org/abs/2508.08569 https://arxiv.org/pdf/2508.…

Graph-based method for constructing consensus trees
A consensus tree is a phylogenetic tree that synthesizes a given collection of phylogenetic trees, all of which share the same leaf labels but may have different topologies, typically obtained through bootstrapping. Our research focuses on creating a consensus tree from a collection of phylogenetic trees, each detailed with branch-length data. We integrate branch lengths into the consensus to encapsulate the progression rate of genetic mutations. However, traditional consensus trees, such as th…

Reconstructing the Milky Way chemical map with Galactic Chemical Evolution tool OMEGA from SDSS-MWM
Viola Heged\H{u}s, Szabolcs M\'esz\'aros, Blanka Vil\'agos, Marco Pignatari, J. Emily Griffith, Diogo Souto, Maria Lugaro
https://arxiv.org/abs/2506.00503

Reconstructing the Milky Way chemical map with Galactic Chemical Evolution tool OMEGA+ from SDSS-MWM
We obtain two-infall galactic chemical evolution (GCE) models simulating the chemical evolution of the Milky Way as constrained by a golden sample of $394,000$ stellar abundances of the Milky Way Mapper survey from the 19th data release of SDSS-V. The separation between the chemical thin and thick disks is defined using [Mg/M]. We use the chemical evolution environment $\texttt{OMEGA+}$, combined with Levenberg-Marquardt and bootstrapping. We simulate the entire Galactic disk and six galactocen…

Bootstrapping periodic quantum systems
Zhijian Huang, Wenliang Li
https://arxiv.org/abs/2507.02386 https://arxiv.org/pdf/2507.02386…

Bootstrapping periodic quantum systems
Periodic structures are ubiquitous in quantum many-body systems and quantum field theories, ranging from lattice models, compact spaces, to topological phenomena. However, previous bootstrap studies encountered technical challenges even for one-body periodic problems, such as a failure in determining the accurate dispersion relations for Bloch bands. In this work, we develop a new bootstrap procedure to resolve these issues, which does not make use of positivity constraints. We mainly consider …

What the hell is happening today?!
Trying to install rocky #linux on a server:
- Access the IPMI web interface, configured the samba share pointing to the ISO
- The boot starts, after a few seconds of bootstrapping systemd services are hanging
- Trying to access the IPMI web interface: timeout on 443
- Using ipmitool, I can boot again, but the web interface is stil…

A proof of the Fourier extension conjecture for the paraboloid in three dimensions
Cristian Rios, Eric T. Sawyer
https://arxiv.org/abs/2506.23376 https://

A proof of the Fourier extension conjecture for the paraboloid in three dimensions
We prove the Fourier extension conjecture on the paraboloid in three dimensions by combining our previous papers arXiv:2506.03992 and arXiv:2506.21315 with a bootstrapping argument in BeCaTa.