Machine Learning (Statistics)
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 31 August
This paper develops a general convolutional neural network (CNN) framework for detecting heterogeneous event-driven dynamics in univariate time series windows. We show that the induced CNN class exactly represents classifiers based on range, maximum drawup, maximum drawdown and slope change, and uniformly approximates realised volatility and autoregressive explosiveness on compact domains. We further establish error bounds for representative rules in finite samples and an oracle inequality for learning across them. Simulations show that the proposed model can match or outperform classifiers based on individual statistics as the training sample grows. In an application to six daily energy price series, a hierarchical CNN distinguishes event windows and event families. Applied without retraining to observations withheld after 20 February 2026, the fitted model identifies predominantly geopolitical dynamics in several oil and refined product series around the outbreak of the 2026 Iran war, while distinguishing a contemporaneous natural gas spike associated with weather.
Optimization and Control
Bus Fleet Electrification Under Capital Cost and Scheduling Constraints: A Five-Agency Case Study
As transit agencies consider bus fleet electrification, understanding the efficiency and cost of replacing diesel buses (DBs) with battery electric buses (BEBs) is critical. To evaluate this, this study applies a mixed-fleet optimization model, integrating scheduling, charging, and fleet composition decisions, across five agencies: Santa Monica's Big Blue Bus (BBB), the Chicago Transit Authority (CTA), Knoxville Area Transit (KAT), the Metropolitan Atlanta Rapid Transit Authority (MARTA), and Manhattan's Metropolitan Transportation Authority (MTA) bus service. By calculating electric fleet share, the BEB/DB replacement ratio, transit-link density, and vehicle activity-time allocation, the study finds that while optimized fleets remain majority-electric, vehicle substitution is rarely one-to-one. Average replacement ratios range from 1.101 for CTA to 1.245 for KAT, with higher transit-link density networks like CTA and MTA requiring fewer replacement buses per diesel bus displaced than lower-density networks like MARTA and KAT. While these relationships are descriptive rather than causal, non-revenue vehicle activity may help explain the differences. By shifting the focus from simple electric fleet share to diesel replacement efficiency, this multi-agency comparison demonstrates that transit agencies should use the replacement ratio to accurately forecast additional fleet capacity requirements and avoid the costly assumption of strict one-to-one vehicle substitution.
Read the full abstract
Distributed Computing
Client-side transparent caching for remote ROOT data analysis
High-energy physics analyses often process the same data as physicists refine algorithms and test new ideas. With data increasingly read from remote storage, each iteration is subject to network latency and depends on network bandwidth and shared-storage throughput, which can vary substantially under load. We present uCache (xrd-ucache), a transparent client-side cache implemented as an XRootD client plugin that requires neither server-side deployment nor changes to analysis code. It uses local storage on the analysis machine as a cache layer between the network and memory. The cache stores only the data actually read by an analysis. It can also rebuild cached data into a branch-aligned, recompressed form, eliminating most of the input/output and decompression costs of subsequent passes. We benchmark the cache using the Analysis Grand Challenge top quark pair analysis on public CMS Open Data compressed with zlib and LZMA. Filling the cache adds essentially no overhead compared with a direct read. Subsequent passes are 1.6-8.8 times faster from the byte cache and 2.1-15.7 times faster from the recompressed cache. For a typical analysis, a 1 TB cache suffices for datasets of 10-20 TB. The largest improvements occur when the remote data source is heavily loaded or geographically distant.
Read the full abstract
Probability
Shannon's problem on the monotonicity of entropy and a Conjecture of Tao
Let $X_1,X_2,\ldots$ be i.i.d. finitely supported random variables in a torsion-free abelian group, and write $S_k=X_1+\cdots+X_k$, and $H(S_k)$ is the Shannon entropy $S_k$, for all $k \ge 1$. We prove that, for every fixed $n\geq1$, \[ H(S_{n+1})-H(S_n) \geq \frac12\log\frac{n+1}{n} -o_{H(X_1)\to\infty}(1), \] uniformly over the ambient group and the input law. This proves a conjecture of Tao [29] in 2010.
Read the full abstract
Earth and Planetary Astrophysics
Where planetary solids survive sublimation around young and hot white dwarfs
All observed planetary systems orbiting single white dwarfs have lived through the hot stellar transition from an asymptotic giant branch star. In this post-nebular transition period, the initial conditions for planetary system evolution throughout white dwarf cooling are established. The hottest ($\gtrsim$ 20,000 K) and youngest ($\lesssim$ 20 Myr-old) white dwarf planetary system host stars differ significantly from their canonical older and colder counterparts by failing to support solid body accumulation in the immediate vicinity (a few $R_{\odot}$) of the white dwarf. Here, we analyse the likely locations of both solid-body survival and the sublimated gaseous content during this pivotal epoch, and the consequences. We find that (i) reservoirs of iron-rich, rocky and water-rich asteroids of radius $R$ that later observably enrich, or pollute, the white dwarf need to remain parked for the first tens of Myr of white dwarf cooling beyond critical distances of (16 au)$\times(1 {\rm km}/R)^{1/2}$ (for iron), (30 au)$\times(1 {\rm km}/R)^{1/2}$ (for rock) and (130 au)$\times(1 {\rm km}/R)^{1/2}$ (for snow), (ii) sublimation acts much more quickly than radiatively-driven orbital drifts from Poynting-Robertson drag or the Yarkovsky effect, and (iii) although large asteroids ($R \approx$ 10-1000 km) that are kicked on highly eccentric orbits around newly born white dwarfs could survive sublimation, they may fragment into debris which will sublime before the white dwarf cools. These results support, but do not necessitate, dynamical origin scenarios of polluted white dwarfs that feature delayed gravitational instability subsequent to the host star's asymptotic giant branch phase at Kuiper Belt-like distances, and beyond.
Read the full abstract
Combinatorics
On Unavoidable Faces of High-Dimensional Polytopes
Kalai's cube–simplex conjecture asserts that for all positive integers $\ell,k$, there is an integer $f(\ell,k)$ such that every polytope of dimension at least $f(\ell,k)$ has either a simplex $\ell$-face or a cube $k$-face; let $f_s(\ell,k)$ denote the threshold restricted to simple polytopes. Finiteness of $f(\ell,k)$ is known only for $\ell,k \leq 2$. In addition, Kalai proved that $f_s(2,k) \leq 2k^2$. Here we prove that $f_s(\ell,k)$ is finite for all $\ell \geq 2$ and $k \geq 3$, the first such result beyond $\ell = 2$, with $f_s(2,k) \leq 2k^2-1$ and $f_s(\ell,k) \leq \tfrac{1}{2}k^2\ell\,2^k$ for $\ell \geq 3$. In the opposite direction, we obtain the lower bounds $f(\ell,k) \geq (5\lfloor \ell/2 \rfloor + (\ell \bmod 2) - 1)(k-1)+1$ and $f_s(\ell,k) \geq \max\{4,\,2(\ell-1)\}(k-1)+1$. A companion question asks for the minimum possible size of a 3-face within a higher-dimensional polytope. Meisinger, Kleinschmidt and Kalai proved that every rational $d$-polytope with $d \geq 9$ has a $3$-face with fewer than $78$ vertices or fewer than $78$ facets. Here we improve their bound: every convex polytope of dimension at least $15$ has a $3$-face with at most $13$ facets. One step of our proof requires an explicit exact rational certificate or identity on flag numbers. This certificate is computed using linear programming.
Read the full abstract
Computer Vision
SlideMix: Enhancing Whole Slide Image Analysis via Multimodal Shuffling
Histopathological whole slide images (WSIs) are central to cancer diagnosis, but their gigapixel scale, tissue heterogeneity, weak slide-level supervision, sparse diagnostic regions, and multi-scale evidence make robust automated analysis challenging. Multiple instance learning (MIL) is widely used to aggregate tile-level features into slide-level predictions, yet existing augmentation strategies often perturb tissue regions without preserving diagnostic relevance, slide context, or cross-scale structure. We propose SlideMix, a model-agnostic multimodal augmentation framework for MIL-based WSI analysis. SlideMix uses a retrieval-augmented vision-language model (VLM)-based Visual-Language Adaptive Region selector to identify diagnostically relevant regions and reduce weak-label noise. It then performs In-place Tile Shuffling within meaningful tissue regions to mix feature embeddings while preserving slide-level context. A VLM-based soft-labeling module supervises mixed samples, while a multi-factor, loss-driven online Curriculum-Learning Feedback scheme adaptively controls shuffle granularity, feature similarity, and shuffle ratio to promote cross-scale representation learning. Across 11 WSI datasets comprising 20,523 slides, 8 diagnostic tasks, and 10 WSI backbones, SlideMix improves accuracy and generalization in most settings and compares favorably with established augmentation baselines, providing a simple plug-and-play approach for more robust and scalable digital pathology models. Source code: https://github.com/Xia-Research-Lab/SlideMix
Read the full abstract
Soft Condensed Matter
Nonlinear force response of modular lattice-based metamaterials
Lattice-based metamaterials provide lightweight platforms where local instabilities can govern the global mechanical response, enabling applications in energy routing, vibration isolation, and impact mitigation. Although much progress has been made in controlling deformation and buckling sequences through geometric design, the behavior of coupled nonlinear units over a large range of strain rates and their history-dependent response is less explored. Here, we investigate lattice-based mechanical metamaterials whose nonlinear buckling behavior can be harnessed through modular architectures. By combining modular units in series, we show that their interaction gives rise to emergent force responses, including transient weakening and enhanced force attenuation, that are absent in the individual modules. Furthermore, selected designs exhibit training behavior under cyclic loading, transitioning between distinct buckling states and revealing a history-dependent mechanical response. Our results demonstrate that modular, instability-driven metamaterials can be programmed and tuned not only through geometry but also through loading history, opening new avenues for designing a nonlinear stress-response in mechanical systems.
Read the full abstract
Combinatorics
Graphs with Long Pseudosimilarity Chains under Consecutive Vertex Deletions
Pseudosimilar vertices are vertices in distinct automorphism orbits whose deletions produce isomorphic graphs. Classical work has studied the existence, group-theoretic origin, and construction of large sets of such vertices. We ask a different recursive question: how long can one repeatedly delete a vertex that is pseudosimilar at the moment of deletion? We define the pseudosimilarity depth of a graph and construct connected graphs in which this process continues through all but a sublinear number of vertices. A two-clock construction gives a square-root deficit uniformly in the order, while a Chinese-remainder construction with many cyclic clocks yields an infinite family of asymmetric graphs with only a polylogarithmic number of vertices left outside the active chain. The mechanism realizes pseudosimilarity by breaking a long hidden automorphism orbit and enlarging the break one vertex at a time. Thus pseudosimilarity can persist through an asymptotically full sequence of vertex deletions, even though every graph encountered in the main construction is asymmetric.
Read the full abstract
Computational Geometry
A Dimension-Reducing Fréchet Simplification Oracle
Let $P$ be a polygonal curve with $n$ vertices in the plane. We construct a data structure of size $O(n \log n)$ suited for simplification queries of the following kind. Given a query line $\ell$ and an integer $k\ge1$, find a curve $Q$ on $\ell$ with at most $k$ vertices that minimizes the discrete Fréchet distance to $P$, among all such curves. Using our data structure, a query can be handled in $O(k^2 \log^3 n + k\log^4 n)$ time. More generally, a geometric tree $T$ on $n$ vertices in the plane can be preprocessed into a near-linear-size structure so that, given a pair $u$, $v$ of its vertices, a line $\ell$, and an integer $k\ge1$, one can find a curve $Q$ on $\ell$ with at most $k$ vertices that minimizes the discrete Fréchet distance to the path from $u$ to $v$ in $T$, in time $O(k^2 \mathop{polylog} n)$. For the general dimension-reduction problem, where $P$ is a curve in $\mathbb{R}^d$ ($d \ge 3$), $0 < \varepsilon_0 < 1$ is a real parameter, and a query specifies a $g$-flat $h$ ($1 \le g \le d-1$) and an integer $k \ge 1$, we construct a data structure of size $O(n\log n + f(\varepsilon_0) n)$, where $f(\varepsilon_0)=(1+1/\varepsilon_0)^{(d-1)/2}$, that allows us to find a curve $Q$ on $h$ with at most $k$ vertices, whose discrete Fréchet distance to $P$ is at most $1+\varepsilon_0$ times the distance of $Q^*$ to $P$, where $Q^*$ is such a curve that minimizes the distance to $P$. The query handling time is $O(f(\varepsilon_0) k^2 \log^2 n)$.
Read the full abstract
Algebraic Geometry
Infinite transitivity of tame groups of automorphisms of affine spaces
For positive integers $n$ and $m$, we study the actions of the groups of tame automorphisms of the $n$-dimensional affine spaces over finite fields on ordered subsets of $m$ points. Our primary interest lies in constructing tame automorphisms that take one ordered sequence to another and in proving upper and lower bounds on the maximal complexity of such automorphisms. Our preferred measure of complexity of an automorphism is the maximum of the degrees of the polynomials that define it and its inverse. Using methods and results from various branches of mathematics, including the theory of symmetric groups, affine geometry over finite fields, polynomial interpolation, combinatorics of projective spaces over fields, and polynomial automorphisms, we obtain a wide variety of qualitative and quantitative results.
Read the full abstract
Cryptography and Security
NeuroPriv: Adversarial Representation Learning for Privacy in Wearable EEG Systems
Wearable EEG systems may expose sensitive information beyond their intended health function, creating substantial risks to neuroprivacy. In this work, we show that commonly used EEG features can reveal participant identity and demographic attributes in addition to supporting the intended cognitive task. Wearable EEG is increasingly being explored for cognitive monitoring, neurological assessment, and longitudinal digital-health applications, yet many systems assume that transmitting compact spectral or spatial features instead of raw EEG provides sufficient privacy protection. Using EEGMAT as a motivating case study, we find that compact EEG features achieve a balanced accuracy of 0.788 for cognitive-state classification while enabling gender, age, and subject-identity inference with balanced accuracies of 0.858, 0.789, and 0.692, respectively. We further show that privacy-aware representation learning preserves task performance at 0.781 while reducing these inference accuracies to 0.563, 0.467, and 0.206. These findings motivate purpose-limited representations and explicit privacy auditing in wearable neurohealth systems.
Read the full abstract
Systems and Control
An Open Synthetic Test System for the Jordanian Transmission Grid
Open synthetic test systems are essential for reproducible power system research, yet the available cases represent almost exclusively North American and European grids. No open transmission test system exists for any Middle Eastern country, whose grids raise different questions such as single corridor fuel-supply resilience and high-renewable operation within small synchronous systems, and established benchmarks cannot demonstrate. This paper presents a synthetic test system for the Jordanian transmission grid, assembled entirely from public sources, where the real topology is reconstructed from a published diagram and restored to its 2018 energized state, with plant-level generation and renewable fleets, per-site hourly profiles, and loads calibrated to the values published by Jordan's grid operators. The case is validated through structural statistics against real-grid criteria, power flow and $N\!-\!1$ screening, an energy-weighted loss decomposition, in addition to a full-year production-cost run compared against the published per-plant energy, and cross-solver verification. The model reproduces the annual energy mix at technology level (largest producers within 4%, system total within 0.1%), and the released dataset includes the bus-identity key, all scripts, and a post-2019 scenario variant. This test case is designed to benchmark system-level resource adequacy, time-series dispatch and unit commitment, renewable integration, fuel-supply resilience scenarios, interconnection studies and steady-state studies.
Read the full abstract
Computational Engineering
Hidden relationships in a document-derived property graph: top-k chunk embeddings and inverse-distance weighting over a dynamically evolving ontology
Large language models extracting knowledge graphs from text capture only explicitly stated facts, often leaving semantically related entities disconnected across documents. We present an additive, engine-neutral second pass that discovers these latent ties without altering extracted facts. Each document is chunked and embedded once; top-k nearest- neighbor queries across existing chunks yield candidate node pairs via entity membership maps. Candidate pairs are scored using Shepard inverse-distance weighting with a rescaled chord distance metric, avoiding the threshold-collapsing flaw of affine cosine scoring behind a k-NN gate. Un-gated per-pair accumulators form a commutative monoid, ensuring the pipeline is strictly order-independent and scales incrementally without recomputing prior documents. Implemented across FalkorDB, Kinetica, ArangoDB, and Neo4j, our method shows that 768- and 240-dimensional embeddings retain 92% and 72% edge fidelity against a 3072-D baseline while achieving a 25x faster top-k formulation.
Read the full abstract
Artificial Intelligence
RestoreBench: Can AI Agents Restore Power Flow Convergence?
Large Language Model (LLM) agents increasingly automate multi-step engineering workflows through tool use, interpretation of intermediate results, and iterative planning. Diagnosing and resolving non-convergent power flow cases is a promising yet largely unexplored application, as it requires engineering judgment, experimentation, and decision-making within constrained action spaces. We introduce a benchmark that evaluates these capabilities across multiple LLMs and three architectures: chatbot, single agent, and multi-agent systems. The evaluation covers two power grids and 46 cases per grid, each requiring one or more corrective actions to restore convergence. The benchmark defines the simulation environment, observation and action spaces, and evaluation metrics, providing a reproducible foundation for developing agentic AI systems for power system planning and operation. The code is available at https://github.com/Mansutti081/RestoreBench
Read the full abstract
Group Theory
Two problems about bases and independent sets in free groups
We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.
Read the full abstract
Theoretical Economics
Communicating About Endogenous Issues
Limited attention forces organizations to decide not only how much to discuss, but also which issues merit discussion. We study strategic communication about a multidimensional decision when a receiver can respond only along a few endogenously chosen issues. Players agree on the ideal action but prioritize different errors. In equilibrium, communicated and omitted issues must be statistically unrelated and separable according to the sender's preferences. Thus, the sender's priorities determine the agenda; the receiver's do not. Synchronized priorities raise the receiver's best equilibrium payoff but lower his worst, so he may prefer a less synchronized sender.
Read the full abstract
Formal Languages and Automata
A note on the reduction from LTLf to LTL
LTLf, a finite word variant of LTL, can be reduced to LTL by introducing a new atomic proposition indicating the prefix of the infinite words that correspond to the finite words that the original LTLf formula was considering. Such a reduction was originally proposed by De Giacomo and Vardi (IJCAI'13). However, while any LTL formula reduced from LTLf describes an obligation property in the hierarchy of Manna and Pnueli (PODC'90), the aforementioned reduction does not provide an LTL formula that belongs to the syntactic obligation fragment of LTL. This note shows how the reduction was fixed in Spot in order to ensure that the resulting LTL formula is always a syntactic obligation. Doing so allows algorithms specialized to syntactic obligation to be used on LTLf formulas. For instance, in previous work (CAV'26) we described a specialized translation from syntactic obligations to minimal, weak, deterministic Büchi automata that would not be usable with the original reduction.
Read the full abstract
Computer Vision
FoldingAgent: Inferring Parametric Origami Procedures from Demonstration Videos
We present FoldingAgent, an agentic framework for inferring explicit parametric folding programs directly from origami demonstration videos. Our framework leverages the reasoning power of a pre-trained Vision-Language Model (VLM) equipped with a suite of specialized tools that enable the agent to simulate geometric transitions, verify physical plausibility, retrieve and compare visual content, and evaluate its own predictions. To translate visual content into folding programs, we define a parametric space that consists of the paper's geometry and a set of parametric folding actions. Unlike models that predict static crease patterns, our agent operates sequentially and possesses the ability to re-plan its actions, effectively mitigating the compounding errors inherent in multi-step folding. Our approach takes a step toward closing the gap between human origami knowledge, which is primarily shared through unstructured visual demonstrations, and computational methods, which typically rely on structured, parametric representations such as a crease pattern or an executable parametric plan. We evaluate our approach on PurelandFold, a newly curated benchmark of diverse Pureland origami videos with ground-truth geometry and action labels. Our results demonstrate that by combining VLM reasoning with a set of specialized tools and physical simulation, we can successfully transform unstructured visual demonstrations into executable, physically plausible folding procedures.
Read the full abstract
Number Theory
Smooth Diffeomorphisms and Mahler's Problem on Liouville Numbers
A classical theorem of Maillet asserts that every nonconstant rational function over $\mathbb{Q}$ maps Liouville numbers to Liouville numbers. In 1984, Mahler asked whether a transcendental entire function can have the same property. We prove a strong smooth counterpart: writing $\mathscr{L}$ for the set of Liouville numbers, there exist orientation-preserving $C^\infty$ diffeomorphisms $f:\mathbb{R}\to\mathbb{R}$, arbitrarily close to the identity and transcendental over $\mathbb{R}(x)$, such that for every real number field $K\subset\mathbb{R}$, every $n\geq 1$, and every $m\geq 0$, \[ D^m(f^{\circ n})(K)\subseteq K, \qquad D^m(f^{\circ n})(\mathscr{L})\subseteq\mathscr{L}. \] In fact, the non-analyticity locus may be prescribed as any nonempty compact perfect nowhere-dense set disjoint from the real algebraic and Liouville numbers. The proof combines Maillet's theorem with an arithmetic refinement of Körner's smooth polynomial sewing method and a rational-germ construction.
Read the full abstract
Machine Learning
Adapting Without Gradients: Affine Statistics Transport and What Its Certificate Can Tell You
Test-time adaptation (TTA) typically assumes that model parameters can be updated at inference time. This assumption is restrictive for inference-only accelerators, frozen or third-party models, and memory-constrained deployments, and standard BatchNorm-based TTA configurations may also become inactive on architectures without BatchNorm. We study adaptation when the learned model must remain frozen. We introduce CASTER, a gradient-free method that stores source class statistics in a discriminative subspace, estimates a class-shared affine transformation from target-batch moments, and analytically transports the source class distributions before classification. CASTER requires no backward pass, optimizer state, or stored source feature bank. Across four backbones and seven datasets, it outperforms k-NN on identical frozen features in 27 of 28 backbone-dataset settings while retaining a median of 18x less state. Affine transport is not always reliable. On ImageNet-C, where batches contain only 64 samples for 1000 classes, unconditional transport loses 21.2 top-1 points. We therefore introduce an empirical residual-to-margin transportability certificate. Across 307 evaluation cells, every transport losing more than 10 points has certificate value above 3.9, although benign and destructive regimes are not perfectly separated. Gating converts an average $-3.35$-point effect of unconditional transport into a +1.69-point gain, and performance remains within 0.3 points of the best threshold over a broad threshold range. Finally, we show that this certificate is mechanism-specific: when applied to Tent, it accepts only $4.3\%$ of updates and preserves 0.6% of Tent's available gain. These results position CASTER as a lightweight adaptation mechanism for frozen-model deployment, together with an explicit account of when its safety signal is informative and when it is not.
Read the full abstract
Quantum Physics
Towards unsupervised representation learning for quantum data: quantum models with inference and generation
With quantum sensors, simulators and networks emerging, a future of quantum technology may produce quantum states as data—that is, coherently rather than as classical measurement records—thus motivating the study of suitable quantum generalisations of modern machine learning, including the automated, unsupervised extraction of useful representations. Two ingredients are central to the latter: inference, mapping observations to latent representations, and generation, mapping latent states back to synthetic data. Both are related to each other and to joint distributions for training models by the chain-rule of classical probability theory. The fact that quantum states however lack such universal, standard factorisation property thus poses a challenge. Here we develop a conceptual and mathematical framework for unsupervised representation learning from quantum data. Models are joint quantum states over visible and latent systems; state-over-time maps provide a notion of factorisation into a marginal state and inference (generation) channel; models with inference (generation) are ambiguous states—states for which such factorisation obtains—subject to a further consistency condition on extended inference maps as data extension. These stipulations are restrictive: we show that non-trivial models must feature non-linear such maps to the extended space. For three representative state-over-time maps, we completely characterise the ambiguous states, uncovering a hierarchy tied to the positive-partial-transpose (PPT) criterion from entanglement theory. Notably, the Leifer-Spekkens construction supports inference and generation exactly for model classes of PPT states, thus allowing genuinely quantum visible-latent correlations. We also formulate quantum counterparts of exact and approximate inference training, explore weaker notions of data extension and sketch a future research programme.
Read the full abstract
Computer Vision
Puppeteer: Object-Grounded Posture-Aware Co-Speech Gesture Generation
Generating co-speech gestures that are temporally coherent, semantically aligned with speech, and grounded with surrounding objects remains challenging. Prior speech-driven gesture models emphasize audio-gesture alignment but do not explicitly account for posture constraints or surrounding objects, failing to capture the inherent correlation between body gestures and the physical space. We present Puppeteer, a posture-aware, object-grounded co-speech gesture diffusion model operating in a causal latent space. We decompose long gestures into structured primitives and learn a causal variational autoencoder that encodes them into temporally ordered latent tokens, each depending only on the past. We then perform conditional diffusion directly in the causal latent space, conditioning on speech signals, motion history, an initial posture reference, and object geometry to synthesize physically consistent gestures. This temporally ordered latent formulation enables explicit temporal control and supports tasks such as gesture in-betweening and gesture completion. To better assess co-speech gesture synthesis beyond existing measures, we introduce new evaluation metrics tailored to this task. We also created SceneGes, the first curated synthetic 3D dataset of embodied co-speech gestures and corresponding 3D objects, enabling object-grounded gesture generation. Experiments show that Puppeteer generates more diverse and temporally synchronized gestures than prior methods, while enabling object-grounded gesture synthesis.
Read the full abstract
Mesoscale and Nanoscale Physics
Chiral phonons driven by chiral cavities
Lattice vibrations carrying angular momentum give rise to fundamental phenomena such as the phonon Hall effect and the Einstein-de Haas effect, offering new opportunities for manipulating angular momentum in condensed-matter systems. Generating such circularly polarized phonons requires either the use of an external magnetic field, or of polarized light pulses. The latter approach does not require the use of any magnetic response of the material, but it has limitations, in particular regarding the duration of the pulse. Consequently, any effect stemming from phonons generated by light pulses is transient. In this paper, we propose the use of a driven electromagnetic cavity as a route to generate a steady-state population of chiral phonons. We derive a general description of cavity-chiral phonon interaction, with a particular focus on modes of chiral cavities. We show that, under optimized conditions, a significant effective phonon-induced magnetic field can be generated by means of an external drive with realistic power. Our approach is specially tailored for Gamma point phonons with THz frequencies, and opens a new route for investigating chiral phonons with electromagnetic cavities.
Read the full abstract
Artificial Intelligence
Dr. Claw: An AI Scientist Workspace for Vibe Research
Command-line coding agents (e.g., Claude Code, Gemini CLI) can already read and write files and sustain long sessions, yet end-to-end research still fragments across chat tools, IDEs, terminals, and writing environments, and the decisions that make it auditable are rarely preserved. We present Dr. Claw, an open-source workspace that wraps existing coding-agent executors in a controllable and auditable human-in-the-loop workflow rather than introducing another autonomous agent. Persistent state objects, a reusable skill library, and multi-executor coordination link human decisions to AI execution, turning planning, execution, and writing into one traceable, recoverable loop. We demonstrate Dr. Claw through an interactive three-view scenario and a failure-recovery walkthrough, and evaluate it against a bare command-line agent sharing the same backend executor, so the comparison contrasts the whole orchestration layer (task graph, state objects, and skill library) with the agent it wraps. Holding the executor fixed, Dr. Claw scores higher on research completeness while persisting an auditable, recoverable process trail. Demo access: repository https://github.com/OpenLAIR/dr-claw, released under AGPL-3.0 with GPL-3.0 upstream components.
Read the full abstract
Information Retrieval
Closed Forms and Synthetic Twins: Predicting Approximate Nearest Neighbor Recall from Embedding Statistics
Embedding models are trained and evaluated as if retrieval were exact; in production they serve behind approximate indexes – HNSW, IVF, product quantization, or the fixed-dimensional encodings (FDEs) of late-interaction models – whose behavior the encoder's benchmarks never see: one modern encoder recovers just 14% of its exact top-10 through its raw FDE index. Such failures surface only after an index is built, and the standard patches – corpus-fitted transforms such as whitening – must be fitted, stored, and refit as the corpus changes, and can silently rewrite what the encoder returns. This paper shows that index behavior is predictable before anything is built, from label-free statistics of the raw embeddings, through a ladder of instruments matched to what each index family consumes: (1) closed-form moment statistics for the fixed-grid quantizers (PQ, FDE); (2) simulation on a synthetic twin corpus – cluster statistics made generative, on which any index, composed production systems included, can be built and tested – for partition indexes; (3) size-extrapolated, lightly calibrated twins for graph indexes at million-document scale. Predictions land within 0.03 of measured recall on an unseen million-document corpus. The same geometry is trainable: targeting the one statistic no post-hoc transform can move – the score margin – lifts recall for every index family at once, at a small measured task cost. The result: index choice, correction pricing, and production recall forecast from one cheap measurement pass, on new corpora and new indexes alike; serving without per-corpus transform machinery, suited to continuously changing corpora; and a recall-compute frontier pushed by adapting encoders to geometry rather than coupling them to any single index.
Read the full abstract
Software Engineering
Revisiting Feedback-Driven LLM Code Repair: A Replication and Exploratory Java Extension
Since the advent of Large Language Models (LLMs), practitioners have increasingly leveraged them to support their software engineering tasks, including automated code repair, showing promising results. Yet, concerns regarding reproducibility and generalizability remain largely unexplored. To further evaluate these concerns and associated impacts, we partially reproduce and conduct an exploratory Java extension of the FeedbackEval benchmark [1], which evaluates how LLMs leverage different feedback types for Python code repair. First, we partially replicate the original study on 394 repair tasks using GPT-4o and Claude 3.5 Sonnet, reproducing and observing the main qualitative trends reported in the original work. Second, we conduct an exploratory Java extension by constructing 100 erroneous repair instances from 50 Java tasks and evaluating feedback effectiveness. Our results show that previous conclusions from Python may be sensitive to benchmark construction, feedback representation, and tooling ecosystem, motivating more controlled multilingual benchmarks. Specifically, while test feedback remains the strongest feedback type in our Python replication, the same ranking is not observed in our Java extension, as simple and JUnit-based test feedback do not differ significantly. We hypothesize that differences in feedback informativeness and tooling ecosystems, such as the verbosity of test frameworks, may partly explain such a difference. Finally, lighter prompts reduce cost without significant differences in repair effectiveness. Overall, our findings confirm key trends under a partially controlled replication and highlight the need for more rigorous multilingual evaluation and careful feedback design in LLMbased repair systems.
Read the full abstract
Computers and Society
Detoxifying Toxic Communication: A Design Science Approach to Responsible AI
Toxic language in digital workplaces such as pejoratives, sarcasm, condescension, and subtle incivility can erode trust, morale, and collaboration. Existing moderation tools primarily delete or block harmful messages, disrupting communication and offering no constructive resolution. This study adopts a Design Science Research approach to create a responsible AI artifact that detects and detoxifies toxic communication. The artifact integrates fine-tuned transformer-based classifiers (DistilBERT, DistilRoBERTa) with a generative detoxification model (mT0-XL-Detox-ORPO) that rewrites toxic text into semantically equivalent, non-offensive paraphrases. Technical evaluation demonstrates high accuracy in toxicity detection and strong semantic preservation in rewritten messages, supporting conversation continuity while reinforcing respectful discourse. The paper contributes design principles for responsible AI moderation that prioritize meaning preservation and fairness.
Read the full abstract
High Energy Physics (Experiment)
Improved Threshold for Particle-Induced Magnetic Avalanche in Single-Molecule Magnets Using Fe$_8$ Molecule
Extending the original work on the development of a magnetic avalanche detector using Mn$_{12}$-ac single-molecule magnet (SMM), we report the results on a significantly lower threshold magnetic avalanche detector using Fe$_8$ SMM. Fe$_8$ has an order of magnitude smaller relaxation time that is expected to produce at least 3 orders of magnitude lower avalanche threshold compared to Mn$_{12}$-ac. We confirm this experimentally through the detection of gamma particles with energy at least two orders of magnitude lower than the original Mn$_{12}$-ac detection demonstrated using alpha particles, limited by the experimentally available radiation source. The true threshold of avalanche may be significantly lower and will be explored with lower energy x-rays and potentially infrared photons.
Read the full abstract
Computational Physics
Mixture of Polyconvex Neural Potentials for Parametric Hyperelasticity: Towards Foundation Material Models
Hyperelastic constitutive models enable modeling large deformations in elastic solids. In common practice, a strain energy density function is prescribed in advance and model-specific parameters are calibrated from experiments. However, many applications require constitutive models for a family of related materials whose mechanical behavior varies with composition. A fixed constitutive model-form may not capture the full range of behavior across the family, while fitting separate forms does not provide a direct way to predict the response of new compositions. Recent work has developed data-driven constitutive models that learn flexible strain energy functions while incorporating key physical constraints. In this work, we propose using mixtures of convex neural potentials based on input convex neural networks as a modular and data efficient approach to modeling material families. Each potential is convex and monotonic with respect to polyconvex strain invariants, while a conditioning network maps material descriptors to mixture weights. We compare the approach with a monolithic partially input-convex neural network using experimental data from PolyJet 3D-printed materials and a synthetic Gent-type benchmark. Across both benchmarks, the mixture architecture generalized better to material descriptors not seen during training. In the PolyJet experimental benchmark, we showed that the mixture architecture is less sensitive to model hyperparameters, while in the Gent-type benchmark it generalized more reliably with sparse data in the material-descriptor space. These results suggest that representing a material family through a small set of shared convex neural potentials provides a useful structural prior for learning descriptor-dependent constitutive behavior from limited data.