Search

Gaia astrometry of nearby stars is precise enough to detect the tiny displacements induced by substellar companions, but radial velocity data are needed for definitive confirmation. Here we present radial velocity follow-up observations of 28 M and K stars with candidate astrometric substellar companions, which led to the confirmation of two systems, Gaia-4b and Gaia-5b, and the refutation of 21 systems as stellar binaries. Gaia-4b is a massive planet ($M = 11.8 \pm 0.7 \:\mathrm{M_J}$) in a $P = 571.3 \pm 1.4\:\mathrm{day}$ orbit with a projected semi-major axis $a_0=0.312 \pm 0.040\:\mathrm{mas}$ orbiting a $0.644 \pm 0.02 \:\mathrm{M_\odot}$ star. Gaia-5b is a brown dwarf ($M = 20.9 \pm 0.5\:\mathrm{M_J}$) in a $P = 358.58 \pm 0.19\:\mathrm{days}$ eccentric $e=0.6412 \pm 0.0027$ orbit with a projected angular semi-major axis of $a_0 = 0.947 \pm 0.038\:\mathrm{mas}$ around a $0.34 \pm 0.03 \mathrm{M_\odot}$ star. Gaia-4b is one of the first exoplanets discovered via the astrometric technique, and is one of the most massive planets known to orbit a low-mass star., Comment: Submitted to AAS journals. 26 pages, 12 figures, 4 tables

Understanding and modeling pedestrian movements in the real world is crucial for applications like motion forecasting and scene simulation. Many factors influence pedestrian movements, such as scene context, individual characteristics, and goals, which are often ignored by the existing human generation methods. Web videos contain natural pedestrian behavior and rich motion context, but annotating them with pre-trained predictors leads to noisy labels. In this work, we propose learning diverse pedestrian movements from web videos. We first curate a large-scale dataset called CityWalkers that captures diverse real-world pedestrian movements in urban scenes. Then, based on CityWalkers, we propose a generative model called PedGen for diverse pedestrian movement generation. PedGen introduces automatic label filtering to remove the low-quality labels and a mask embedding to train with partial labels. It also contains a novel context encoder that lifts the 2D scene context to 3D and can incorporate various context factors in generating realistic pedestrian movements in urban scenes. Experiments show that PedGen outperforms existing baseline methods for pedestrian movement generation by learning from noisy labels and incorporating the context factors. In addition, PedGen achieves zero-shot generalization in both real-world and simulated environments. The code, model, and data will be made publicly available at https://genforce.github.io/PedGen/ ., Comment: Project Page: https://genforce.github.io/PedGen/

Previous work has shown that training "helpful-only" LLMs with reinforcement learning on a curriculum of gameable environments can lead models to generalize to egregious specification gaming, such as editing their own reward function or modifying task checklists to appear more successful. We show that gpt-4o, gpt-4o-mini, o1-preview, and o1-mini - frontier models trained to be helpful, harmless, and honest - can engage in specification gaming without training on a curriculum of tasks, purely from in-context iterative reflection (which we call in-context reinforcement learning, "ICRL"). We also show that using ICRL to generate highly-rewarded outputs for expert iteration (compared to the standard expert iteration reinforcement learning algorithm) may increase gpt-4o-mini's propensity to learn specification-gaming policies, generalizing (in very rare cases) to the most egregious strategy where gpt-4o-mini edits its own reward function. Our results point toward the strong ability of in-context reflection to discover rare specification-gaming strategies that models might not exhibit zero-shot or with normal training, highlighting the need for caution when relying on alignment of LLMs in zero-shot settings., Comment: 20 pages, 9 figures

Federated graph learning is an emerging field with significant practical challenges. While many algorithms have been proposed to enhance model accuracy, their system performance, crucial for real-world deployment, is often overlooked. To address this gap, we present FedGraph, a research library designed for practical distributed deployment and benchmarking in federated graph learning. FedGraph supports a range of state-of-the-art methods and includes profiling tools for system performance evaluation, focusing on communication and computation costs during training. FedGraph can then facilitate the development of practical applications and guide the design of future algorithms., Comment: https://github.com/FedGraph/fedgraph

We study topological lower bounds on the number of small Laplacian eigenvalues on hyperbolic surfaces. We show there exist constants $a,b>0$ such that when $(g+1)

Classically, the splitting principle says how to pull back a vector bundle in such a way that it splits into line bundles and the pullback map induces an injection on $K$-theory. Here we categorify the splitting principle and generalize it to the context of 2-rigs. A 2-rig is a kind of categorified "ring without negatives", such as a category of vector bundles with $\oplus$ as addition and $\otimes$ as multiplication. Technically, we define a 2-rig to be a Cauchy complete $k$-linear symmetric monoidal category where $k$ has characteristic zero. We conjecture that for any suitably finite-dimensional object $r$ of a 2-rig $\mathsf{R}$, there is a 2-rig map $E \colon \mathsf{R} \to \mathsf{R'}$ such that $E(r)$ splits as a direct sum of finitely many "subline objects" and $E$ has various good properties: it is faithful, conservative, essentially injective, and the induced map of Grothendieck rings $K(E) \colon K(\mathsf{R}) \to K(\mathsf{R'})$ is injective. We prove this conjecture for the free 2-rig on one object, namely the category of Schur functors, whose Grothendieck ring is the free $\lambda$-ring on one generator, also known as the ring of symmetric functions. We use this task as an excuse to develop the representation theory of affine categories - that is, categories enriched in affine schemes - using the theory of 2-rigs., Comment: 47 pages

The most powerful stellar flares driven by magnetic energy occur during the early pre-main sequence (PMS) phase. The Orion Nebula represents the nearest region populated by young stars, showing the greatest number of flares accessible to a single pointing of Chandra. This study is part of a multi-observatory project to explore stellar surface magnetic fields (with HET-HPF), particle ejections (VLBA), and disk ionization (ALMA) immediately following the detection of PMS super-flares with Chandra. In December 2023, we successfully conducted such a multi-telescope campaign. Additionally, by analyzing Chandra data from 2003, 2012, and 2016, we examine the multi-epoch behavior of PMS X-ray emission related to PMS magnetic cyclic activity and ubiquitous versus sample-confined mega-flaring. Our findings follow. 1) We report detailed stellar quiescent and flare X-ray properties for numerous HET/ALMA/VLBA targets, facilitating ongoing multi-wavelength analyses. 2) For numerous moderately energetic flares, we report correlations (or lack thereof) between flare energies and stellar mass/size (presence/absence of disks) for the first time. The former is attributed to the correlation between convection-driven dynamo and stellar volume, while the latter suggests the operation of solar-type flare mechanisms in PMS stars. 3) We find that most PMS stars exhibit minor long-term baseline variations, indicating the absence of intrinsic magnetic dynamo cycles or observational mitigation of cycles by saturated PMS X-rays. 4) We conclude that X-ray mega-flares are ubiquitous phenomena in PMS stars, which suggests that all protoplanetary disks and nascent planets are subject to violent high-energy emission and particle irradiation events., Comment: 32 pages, 9 figures, 8 tables. Accepted for publication in The Astrophysical Journal, October 7, 2024

The energy cost of erasing a bit of information was fundamentally lower bounded by Landauer, in terms of the temperature of its environment: $W\geq k_\mathrm{B} T \ln 2$. However, in real electronic devices, the information-bearing system is usually in contact with two or more electrodes, with different temperatures and chemical potentials. It is not clear what sets the cost of erasure in such nonequilibrium situations. One promising technology for testing the thermodynamic limits of information processing is quantum dots, in which a bit is encoded in the presence or absence of a single electron. We here develop a thermodynamic description of devices of this type and find that, in addition to the electrode temperatures, the potential difference across the quantum dot and lifetime broadening of its energy level contribute to the minimum work cost of erasure. In practical contexts, these contributions may significantly outweigh the cost due to temperature alone., Comment: 6 pages plus 8-page supplemental material. 3 figures

Generating commonsense assertions within a given story context remains a difficult task for modern language models. Previous research has addressed this problem by aligning commonsense inferences with stories and training language generation models accordingly. One of the challenges is determining which topic or entity in the story should be the focus of an inferred assertion. Prior approaches lack the ability to control specific aspects of the generated assertions. In this work, we introduce "hinting," a data augmentation technique that enhances contextualized commonsense inference. "Hinting" employs a prefix prompting strategy using both hard and soft prompts to guide the inference process. To demonstrate its effectiveness, we apply "hinting" to two contextual commonsense inference datasets: ParaCOMET and GLUCOSE, evaluating its impact on both general and context-specific inference. Furthermore, we evaluate "hinting" by incorporating synonyms and antonyms into the hints. Our results show that "hinting" does not compromise the performance of contextual commonsense inference while offering improved controllability., Comment: Submitted to ACL Rolling Review. arXiv admin note: text overlap with arXiv:2302.05406

Red teaming assesses how large language models (LLMs) can produce content that violates norms, policies, and rules set during their safety training. However, most existing automated methods in the literature are not representative of the way humans tend to interact with AI models. Common users of AI models may not have advanced knowledge of adversarial machine learning methods or access to model internals, and they do not spend a lot of time crafting a single highly effective adversarial prompt. Instead, they are likely to make use of techniques commonly shared online and exploit the multiturn conversational nature of LLMs. While manual testing addresses this gap, it is an inefficient and often expensive process. To address these limitations, we introduce the Generative Offensive Agent Tester (GOAT), an automated agentic red teaming system that simulates plain language adversarial conversations while leveraging multiple adversarial prompting techniques to identify vulnerabilities in LLMs. We instantiate GOAT with 7 red teaming attacks by prompting a general-purpose model in a way that encourages reasoning through the choices of methods available, the current target model's response, and the next steps. Our approach is designed to be extensible and efficient, allowing human testers to focus on exploring new areas of risk while automation covers the scaled adversarial stress-testing of known risk territory. We present the design and evaluation of GOAT, demonstrating its effectiveness in identifying vulnerabilities in state-of-the-art LLMs, with an ASR@10 of 97% against Llama 3.1 and 88% against GPT-4 on the JailbreakBench dataset.

Real-life robot navigation involves more than just reaching a destination; it requires optimizing movements while addressing scenario-specific goals. An intuitive way for humans to express these goals is through abstract cues like verbal commands or rough sketches. Such human guidance may lack details or be noisy. Nonetheless, we expect robots to navigate as intended. For robots to interpret and execute these abstract instructions in line with human expectations, they must share a common understanding of basic navigation concepts with humans. To this end, we introduce CANVAS, a novel framework that combines visual and linguistic instructions for commonsense-aware navigation. Its success is driven by imitation learning, enabling the robot to learn from human navigation behavior. We present COMMAND, a comprehensive dataset with human-annotated navigation results, spanning over 48 hours and 219 km, designed to train commonsense-aware navigation systems in simulated environments. Our experiments show that CANVAS outperforms the strong rule-based system ROS NavStack across all environments, demonstrating superior performance with noisy instructions. Notably, in the orchard environment, where ROS NavStack records a 0% total success rate, CANVAS achieves a total success rate of 67%. CANVAS also closely aligns with human demonstrations and commonsense constraints, even in unseen environments. Furthermore, real-world deployment of CANVAS showcases impressive Sim2Real transfer with a total success rate of 69%, highlighting the potential of learning from human demonstrations in simulated environments for real-world applications., Comment: project page https://worv-ai.github.io/canvas

Generative artificial intelligence (AI) technology is revolutionizing the computing industry. Not only its applications have broadened to various sectors but also poses new system design and optimization opportunities. The technology is capable of understanding and responding in multiple modalities. However, the advanced capability currently comes with significant system resource demands. To sustainably scale generative AI capabilities to billions of users in the world, inference must be fast and efficient. This paper pinpoints key system design and optimization opportunities by characterizing a family of emerging multi-modal generation models on real systems. Auto-regressive token generation is a critical latency performance bottleneck, typically dominated by GPU idle time. In addition to memory-intensive attention across the generative AI models, linear operations constitute significant inference latency due to the feed forward networks in Transformer-based models. We demonstrate that state-of-the-art optimization levers, spanning from applications to system software and hardware, set a 3.88x better baseline., Comment: 13 pages including references. 8 Figures. Under review to HPCA 2025 Industry Track

Despite being operational for only a short time, the Einstein Probe mission has already significantly advanced the study of rapid variability in the soft X-ray sky. We report the discovery of luminous and variable radio emission from the Einstein Probe fast X-ray transient EP240414a, the second such source with a radio counterpart. The radio emission at $3\,\rm{GHz}$ peaks at $\sim30$ days post explosion and with a spectral luminosity $\sim2\times10^{30}\,\rm{erg}\,\rm{s}^{-1}\,\rm{Hz}^{-1}$, similar to what is seen from long gamma-ray bursts, and distinct from other extra-galactic transients including supernovae and tidal disruption events, although we cannot completely rule out emission from engine driven stellar explosions e.g. the fast blue optical transients. An equipartition analysis of our radio data reveals that an outflow with at least a moderate bulk Lorentz factor ($\Gamma\gtrsim1.6$) with a minimum energy of $\sim10^{48}\,\rm{erg}$ is required to explain our observations. The apparent lack of reported gamma-ray counterpart to EP240414a could suggest that an off-axis or choked jet could be responsible for the radio emission, although a low luminosity gamma-ray burst may have gone undetected. Our observations are consistent with the hypothesis that a significant fraction of extragalactic fast X-ray transients are associated with the deaths of massive stars., Comment: 11 pages, 6 figures, submitted to ApJL

Fix a prime number $p$. Inspired by the notion of $F$-pure or $F$-split singularities, we study the condition that a Noetherian ring with $p$ in its Jacobson radical is pure inside some perfectoid (classical) ring, a condition we call \emph{perfectoid pure}. We also study a related a priori weaker condition which asks that $R$ is pure in its absolute perfectoidization, a condition we call \emph{lim-perfectoid pure}. We show that both these notions coincide when $R$ is LCI. Mixed characteristic analogs of $F$-injective and Du Bois singularities are also explored. We study these notions of singularity, proving that they are weakly normal and that they are Du Bois after inverting $p$. We also explore the behavior of perfectoid singularities under finite covers and their relation to log canonical singularities. Finally, we prove an inversion of adjunction result in the LCI setting, and use it to prove that many common examples are perfectoid pure., Comment: 46 pages, comments welcome

Cat qubits, a type of bosonic qubit encoded in a harmonic oscillator, can exhibit an exponential noise bias against bit-flip errors with increasing mean photon number. Here, we focus on cat qubits stabilized by two-photon dissipation, where pairs of photons are added and removed from a harmonic oscillator by an auxiliary, lossy buffer mode. This process requires a large loss rate and strong nonlinearities of the buffer mode that must not degrade the coherence and linearity of the oscillator. In this work, we show how to overcome this challenge by coloring the loss environment of the buffer mode with a multi-pole filter and optimizing the circuit to take into account additional inductances in the buffer mode. Using these techniques, we achieve near-ideal enhancement of cat-qubit bit-flip times with increasing photon number, reaching over $0.1$ seconds with a mean photon number of only $4$. Concurrently, our cat qubit remains highly phase coherent, with phase-flip times corresponding to an effective lifetime of $T_{1,\text{eff}} \simeq 70$ $\mu$s, comparable with the bare oscillator lifetime. We achieve this performance even in the presence of an ancilla transmon, used for reading out the cat qubit states, by engineering a tunable oscillator-ancilla dispersive coupling. Furthermore, the low nonlinearity of the harmonic oscillator mode allows us to perform pulsed cat-qubit stabilization, an important control primitive, where the stabilization can remain off for a significant fraction (e.g., two thirds) of a $3~\mathrm{\mu s}$ cycle without degrading bit-flip times. These advances are important for the realization of scalable error-correction with cat qubits, where large noise bias and low phase-flip error rate enable the use of hardware-efficient outer error-correcting codes., Comment: Comments welcome!

Addressing intermittent client availability is critical for the real-world deployment of federated learning algorithms. Most prior work either overlooks the potential non-stationarity in the dynamics of client unavailability or requires substantial memory/computation overhead. We study federated learning in the presence of heterogeneous and non-stationary client availability, which may occur when the deployment environments are uncertain or the clients are mobile. The impacts of the heterogeneity and non-stationarity in client unavailability can be significant, as we illustrate using FedAvg, the most widely adopted federated learning algorithm. We propose FedAPM, which includes novel algorithmic structures that (i) compensate for missed computations due to unavailability with only $O(1)$ additional memory and computation with respect to standard FedAvg, and (ii) evenly diffuse local updates within the federated learning system through implicit gossiping, despite being agnostic to non-stationary dynamics. We show that FedAPM converges to a stationary point of even non-convex objectives while achieving the desired linear speedup property. We corroborate our analysis with numerical experiments over diversified client unavailability dynamics on real-world data sets., Comment: Accepted to NeurIPS 2024

We report on the discovery of a transiting giant planet around the 3500 K M3-dwarf star TOI-6383A located 172 pc from Earth. It was detected by the Transiting Exoplanet Survey Satellite (TESS) and confirmed by a combination of ground-based follow-up photometry and precise radial velocity measurements. This planet has an orbital period of $\sim$1.791 days, mass of 1.040$\pm$0.094 $M_J$ and a radius of 1d.008$^{+0.036}_{-0.033} ~R_J$, resulting in a mean bulk density of 1.26$^{+0.18}_{-0.17}$ g cm$^{-3}$. TOI-6383A has an M-dwarf companion star, TOI-6383B, which has a stellar effective temperature $T_{eff}$ $\sim$ 3100 K and a projected orbital separation of 3100 AU. TOI-6383A is a low-mass dwarf star hosting a giant planet and is an intriguing object for planetary evolution studies due to its high planet-to-star mass ratio. This discovery is part of the \textit{Searching for Giant Exoplanets around M-dwarf Stars (GEMS)} Survey, intending to provide robust and accurate estimates of the occurrence of GEMS and the statistics on their physical and orbital parameters. This paper presents an interesting addition to the small number of confirmed GEMS, particularly notable since its formation necessitates massive, ust-rich protoplanetary discs and high accretion efficiency ($>$ 10\%)., Comment: 20 pages, 8 figures

The advent of new and near-future observatories probing the earliest epochs of the Universe has opened the opportunity to investigate the formation and growth of the first massive black holes (MBHs). Additionally, the use of high resolution cosmological simulations to investigate these high-redshift environments is needed to predict the dark matter halos in which these MBH seeds will form. We use the $\textit{Renaissance}$ simulations to analyse the formation and growth of so-called heavy seed black holes. Other past work has investigated the formation and growth of light (black hole) seeds with $\textit{Renaissance}$ and found that these black holes do not grow in the environments in which they reside. In this work we seed MBHs, in post-processing, and track accretion onto the MBHs as well as mergers with other MBHs at high-redshift. We show that the heavy seeds struggle to achieve high accretion rates with only the most massive black holes ($\gtrsim 10^5 \text{M}_\odot$) growing at close to the Eddington limit under optimistic conditions. Despite the lack of significant growth for these early MBHs, the signals from their merger events will be sufficiently strong (SNR $\sim 10^2$) to be probed by the next generation of gravitational wave observatories, such as $\textit{LISA}$. We predict that $\textit{LISA}$ will observe of the order of $10$ MBH merger events per year where the mergers occur at z $\gtrsim$ 10 or at least begin their early inspiral phase at z $\gtrsim$ 10., Comment: 15 pages, 10 figures, Submitted to the Open Journal of Astrophysics for review

Physics-based simulation is essential for developing and evaluating robot manipulation policies, particularly in scenarios involving deformable objects and complex contact interactions. However, existing simulators often struggle to balance computational efficiency with numerical accuracy, especially when modeling deformable materials with frictional contact constraints. We introduce an efficient subspace representation for the Incremental Potential Contact (IPC) method, leveraging model reduction to decrease the number of degrees of freedom. Our approach decouples simulation complexity from the resolution of the input model by representing elasticity in a low-resolution subspace while maintaining collision constraints on an embedded high-resolution surface. Our barrier formulation ensures intersection-free trajectories and configurations regardless of material stiffness, time step size, or contact severity. We validate our simulator through quantitative experiments with a soft bubble gripper grasping and qualitative demonstrations of placing a plate on a dish rack. The results demonstrate our simulator's efficiency, physical accuracy, computational stability, and robust handling of frictional contact, making it well-suited for generating demonstration data and evaluating downstream robot training applications.

Dynamic quantum simulation is a leading application for achieving quantum advantage. However, high circuit depths remain a limiting factor on near-term quantum hardware. We present a compilation algorithm based on Matrix Product Operators for generating compressed circuits enabling real-time simulation on digital quantum computers, that for a given depth are more accurate than all Trotterizations of the same depth. By the efficient use of environment tensors, the algorithm is scalable in depth beyond prior work, and we present circuit compilations of up to 64 layers of $SU(4)$ gates. Surpassing only 1D circuits, our approach can flexibly target a particular quasi-2D gate topology. We demonstrate this by compiling a 52-qubit 2D Transverse-Field Ising propagator onto the IBM Heavy-Hex topology. For all circuit depths and widths tested, we produce circuits with smaller errors than all equivalent depth Trotter unitaries, corresponding to reductions in error by up to 4 orders of magnitude and circuit depth compressions with a factor of over 6., Comment: 9+1 pages, 6 figures

Large language models are rapidly gaining popularity and have been widely adopted in real-world applications. While the quality of training data is essential, privacy concerns arise during data collection. Federated learning offers a solution by allowing multiple clients to collaboratively train LLMs without sharing local data. However, FL introduces new challenges, such as model convergence issues due to heterogeneous data and high communication costs. A comprehensive study is required to address these challenges and guide future research. This paper surveys Federated learning for LLMs (FedLLM), highlighting recent advances and future directions. We focus on two key aspects: fine-tuning and prompt learning in a federated setting, discussing existing work and associated research challenges. We finally propose potential research directions for federated LLMs, including pre-training and how LLMs can further enhance federated learning.

Given a graph $H$, we say a graph $G$ is properly rainbow $H$-saturated if there is a proper edge-coloring of $G$ which contains no rainbow copy of $H$, but adding any edge to $G$ makes such an edge-coloring impossible. The proper rainbow saturation number, denoted $\text{sat}^*(n,H)$, is the minimum number of edges in an $n$-vertex rainbow $H$-saturated graph. We determine the proper rainbow saturation number for paths up to an additive constant and asymptotically determine $\text{sat}^*(n,K_4)$. In addition, we bound $\text{sat}^*(n,H)$ when $H$ is a larger clique, tree of diameter at least 4, or odd cycle.

Large Language models (LLMs) have brought about substantial advancements in the field of Question Answering (QA) systems. These models do remarkably well in addressing intricate inquiries in a variety of disciplines. However, because of domain-specific vocabulary, complex technological concepts, and the requirement for exact responses applying LLMs to specialized sectors like telecommunications presents additional obstacles. GPT-3.5 has been used in recent work, to obtain noteworthy accuracy for telecom-related questions in a Retrieval Augmented Generation (RAG) framework. Notwithstanding these developments, the practical use of models such as GPT-3.5 is restricted by their proprietary nature and high computing demands. This paper introduces QMOS, an innovative approach which uses a Question-Masked loss and Option Shuffling trick to enhance the performance of LLMs in answering Multiple-Choice Questions in the telecommunications domain. Our focus was on using opensource, smaller language models (Phi-2 and Falcon-7B) within an enhanced RAG framework. Our multi-faceted approach involves several enhancements to the whole LLM-RAG pipeline of finetuning, retrieval, prompt engineering and inference. Our approaches significantly outperform existing results, achieving accuracy improvements from baselines of 24.70% to 49.30% with Falcon-7B and from 42.07% to 84.65% with Phi-2.

We consider the convergence problem in the setting of mean field control with common noise and degenerate idiosyncratic noise. Our main results establish a rate of convergence of the finite-dimensional value functions $V^N$ towards the mean field value function $U$. In the case that the idiosyncratic noise is constant (but possibly degenerate), we obtain the rate $N^{-1/(d+7)}$, which is close to the conjectured optimal rate $N^{-1/d}$, and improves on the existing literature even in the non-degenerate setting. In the case that the idiosyncratic noise can be both non-constant and degenerate, the argument is more complicated, and we instead find the rate $N^{-1/(3d + 19)}$. Our proof strategy builds on the one initiated in [Daudin, Delarue, Jackson - JFA, 2024] in the case of non-degenerate idiosyncratic noise and zero common noise, which consists of approximating $U$ by more regular functions which are almost subsolutions of the infinite-dimensional Hamilton-Jacobi equation solved by $U$. Because of the different noise structure, several new steps are necessary in order to produce an appropriate mollification scheme. In addition to our main convergence results, we investigate the case of zero idiosyncratic noise, and show that sharper results can be obtained there by purely control-theoretic arguments. We also provide examples to demonstrate that the value function is sensitive to the choice of admissible controls in the zero noise setting.

We present recent laboratory results demonstrating high-contrast coronagraphy for the future space-based large IR/Optical/Ultraviolet telescope recommended by the Decadal Survey. The High-contrast Imager for Complex Aperture Telescopes (HiCAT) testbed aims to implement a system-level hardware demonstration for segmented aperture coronagraphs with wavefront control. The telescope hardware simulator employs a segmented deformable mirror with 37 hexagonal segments that can be controlled in piston, tip, and tilt. In addition, two continuous deformable mirrors are used for high-order wavefront sensing and control. The low-order sensing subsystem includes a dedicated tip-tilt stage, a coronagraphic target acquisition camera, and a Zernike wavefront sensor that is used to measure and correct low-order aberration drifts. We explore the performance of a segmented aperture coronagraph both in static operations (limited by natural drifts and instabilities) and in dynamic operations (in the presence of artificial wavefront drifts added to the deformable mirrors), and discuss the estimation and control strategies used to reach and maintain the dark-zone contrast using our low-order wavefront sensing and control. We summarize experimental results that quantify the performance of the testbed in terms of contrast, inner/outer working angle and bandpass, and analyze limiting factors., Comment: 17 pages, 14 figures, SPIE Astronomical Telescopes + Instrumentation, 2022, Montr\'eal, Qu\'ebec, Canada

In order to solve problems of practical importance, quantum computers will likely need to incorporate quantum error correction, where a logical qubit is redundantly encoded in many noisy physical qubits. The large physical-qubit overhead typically associated with error correction motivates the search for more hardware-efficient approaches. Here, using a microfabricated superconducting quantum circuit, we realize a logical qubit memory formed from the concatenation of encoded bosonic cat qubits with an outer repetition code of distance $d=5$. The bosonic cat qubits are passively protected against bit flips using a stabilizing circuit. Cat-qubit phase-flip errors are corrected by the repetition code which uses ancilla transmons for syndrome measurement. We realize a noise-biased CX gate which ensures bit-flip error suppression is maintained during error correction. We study the performance and scaling of the logical qubit memory, finding that the phase-flip correcting repetition code operates below threshold, with logical phase-flip error decreasing with code distance from $d=3$ to $d=5$. Concurrently, the logical bit-flip error is suppressed with increasing cat-qubit mean photon number. The minimum measured logical error per cycle is on average $1.75(2)\%$ for the distance-3 code sections, and $1.65(3)\%$ for the longer distance-5 code, demonstrating the effectiveness of bit-flip error suppression throughout the error correction cycle. These results, where the intrinsic error suppression of the bosonic encodings allows us to use a hardware-efficient outer error correcting code, indicate that concatenated bosonic codes are a compelling paradigm for reaching fault-tolerant quantum computation., Comment: Comments on the manuscript welcome!

With close to three years of observations in hand, the NEID Earth Twin Survey (NETS) is starting to unearth new astrophysical signals for a curated sample of bright, radial velocity (RV)-quiet stars. We present the discovery of the first NETS exoplanet, HD 86728 b, a $m_p\sin i = 9.16^{+0.55}_{-0.56}\ \rm{M}_\oplus$ planet on a circular, $P=31.1503^{+0.0062}_{-0.0066}$ d orbit, thereby confirming a candidate signal identified by Hirsch et al. (2021). We confirm the planetary origin of the detected signal, which has a semi-amplitude of just $K=1.91^{+0.11}_{-0.12}$ m s$^{-1}$, via careful analysis of the NEID RVs and spectral activity indicators, and we constrain the mass and orbit via fits to NEID and archival RV measurements. The host star is intrinsically quiet at the $\sim1$ m s$^{-1}$ level, with the majority of this variability likely stemming from short-timescale granulation. HD 86728 b is among the small fraction of exoplanets with similar masses and periods that have no known planetary siblings., Comment: Submitted to AAS Journals. 18 pages, 10 figures, 3 tables, 1 appendix

Aspect-based sentiment analysis (ABSA) involves identifying sentiment towards specific aspect terms in a sentence and allows us to uncover nuanced perspectives and attitudes on particular aspects of a product, service, or topic. However, the scarcity of labeled data poses a significant challenge to training high-quality models. To address this issue, we explore the potential of data augmentation using ChatGPT, a well-performing large language model (LLM), to enhance the sentiment classification performance towards aspect terms. Specifically, we explore three data augmentation strategies based on ChatGPT: context-focused, aspect-focused, and context-aspect data augmentation techniques. Context-focused data augmentation focuses on changing the word expression of context words in the sentence while keeping aspect terms unchanged. In contrast, aspect-focused data augmentation aims to change aspect terms but keep context words unchanged. Context-Aspect data augmentation integrates the above two data augmentations to generate augmented samples. Furthermore, we incorporate contrastive learning into the ABSA tasks to improve performance. Extensive experiments show that all three data augmentation techniques lead to performance improvements, with the context-aspect data augmentation strategy performing best and surpassing the performance of the baseline models., Comment: 8 pages, 3 figures

The next generation of smart imaging and vision systems will require compact and tunable optical computing hardware to perform high-speed and low-power image processing. These requirements are driving the development of computing metasurfaces to realize efficient front-end analog optical pre-processors, especially for edge-detection capability. Yet, there is still a lack of reconfigurable or programmable schemes, which may drastically enhance the impact of these devices at the system level. Here, we propose and experimentally demonstrate a reconfigurable flat optical image processor using low-loss phase-change nonlocal metasurfaces. The metasurface is configured to realize different transfer functions in spatial frequency space, when transitioning the phase-change material between its amorphous and crystalline phases. This enables edge detection and bright-field imaging modes on the same device. The metasurface is compatible with a large numerical aperture of ~0.5, making it suitable for high resolution coherent optical imaging microscopy. The concept of phase-change reconfigurable nonlocal metasurfaces may enable emerging applications of artificial intelligence-assisted imaging and vision devices with switchable multitasking., Comment: 20 pages, 5 figures

Differential equations where the graph of some derivative of a function is composed of a finite number of similarity transformations of the graph of the function itself are defined. We call these self-similar differential equations (SSDEs) and prove existence and uniqueness of solution under certain conditions. While SSDEs are not ordinary differential equations, the technique for demonstrating existence and uniqueness of SSDEs parallels that for ODEs. This paper appears to be the first work on equations of this nature., Comment: 15 pages, 3 figures

Goal-conditioned policies, such as those learned via imitation learning, provide an easy way for humans to influence what tasks robots accomplish. However, these robot policies are not guaranteed to execute safely or to succeed when faced with out-of-distribution requests. In this work, we enable robots to know when they can confidently execute a user's desired goal, and automatically suggest safe alternatives when they cannot. Our approach is inspired by control-theoretic safety filtering, wherein a safety filter minimally adjusts a robot's candidate action to be safe. Our key idea is to pose alternative suggestion as a safe control problem in goal space, rather than in action space. Offline, we use reachability analysis to compute a goal-parameterized reach-avoid value network which quantifies the safety and liveness of the robot's pre-trained policy. Online, our robot uses the reach-avoid value network as a safety filter, monitoring the human's given goal and actively suggesting alternatives that are similar but meet the safety specification. We demonstrate our Safe ALTernatives (SALT) framework in simulation experiments with indoor navigation and Franka Panda tabletop manipulation, and with both discrete and continuous goal representations. We find that SALT is able to learn to predict successful and failed closed-loop executions, is a less pessimistic monitor than open-loop uncertainty quantification, and proposes alternatives that consistently align with those people find acceptable., Comment: 8 pages, 5 figures, 2 tables, submitted to ICRA 2025

We use the Berglund-H\"ubsch transpose rule from classical mirror symmetry in the context of Sasakian geometry and results on relative K-stability in the Sasaki setting developed by Boyer and van Coevering to exhibit examples of Sasaki manifolds of complexity 3 or complexity 4 that do not admit any extremal Sasaki metrics in its whole Sasaki-Reeb cone which is of Gorenstein type. Previously, examples with this feature were produced by Boyer and van Coevering for Brieskorn-Pham polynomials or their deformations. Our examples are based on the more general framework of invertible polynomials. In particular, we construct families of examples of links with the following property: if the link satisfies the Lichnerowicz obstruction of Gauntlett, Martelli, Sparks and Yau, then its Berglund-H\"ubsch dual preserves this obstruction and moreover this dual admits a perturbation in its local moduli which is obstructed to admitting extremal Sasaki metrics in its whole Sasaki-Reeb cone. In particular, we exhibit examples that have the homotopy type of a sphere or are rational homology spheres., Comment: The previous version of this article has been corrected (minor inaccuracies and typos) and improved. We also have added subsection 4.3 with more examples for more general invertible polynomials

With nearly two billion stars observed and their corresponding astrometric parameters evaluated in the recent Gaia mission, the number of astrometric binary candidates have risen significantly. Due to the surplus of astrometric data, the current computational methods employed to inspect these astrometric binary candidates are both computationally expensive and cannot be executed in a reasonable time frame. In light of this, a machine learning (ML) technique to automatically classify whether a set of stars belong to an astrometric binary pair via an artificial neural network (ANN) is proposed. Using data from Gaia DR3, the ANN was trained and tested on 1.5 million highly probable true and visual binaries, considering the proper motions, parallaxes, and angular and physical separations as features. The ANN achieves high classification scores, with an accuracy of 99.3%, a precision rate of 0.988, a recall rate of 0.991, and an AUC of 0.999, indicating that the utilized ML technique is a highly effective method for classifying astrometric binaries. Thus, the proposed ANN is a promising alternative to the existing methods for the classification of astrometric binaries., Comment: Accepted for publication in Astrophysical Journal (ApJ)

The block tensor of trifocal tensors provides crucial geometric information on the three-view geometry of a scene. The underlying synchronization problem seeks to recover camera poses (locations and orientations up to a global transformation) from the block trifocal tensor. We establish an explicit Tucker factorization of this tensor, revealing a low multilinear rank of $(6,4,4)$ independent of the number of cameras under appropriate scaling conditions. We prove that this rank constraint provides sufficient information for camera recovery in the noiseless case. The constraint motivates a synchronization algorithm based on the higher-order singular value decomposition of the block trifocal tensor. Experimental comparisons with state-of-the-art global synchronization methods on real datasets demonstrate the potential of this algorithm for significantly improving location estimation accuracy. Overall this work suggests that higher-order interactions in synchronization problems can be exploited to improve performance, beyond the usual pairwise-based approaches., Comment: 31 pages, 4 figures

A force field as accurate as quantum mechanics (QM) and as fast as molecular mechanics (MM), with which one can simulate a biomolecular system efficiently enough and meaningfully enough to get quantitative insights, is among the most ardent dreams of biophysicists -- a dream, nevertheless, not to be fulfilled any time soon. Machine learning force fields (MLFFs) represent a meaningful endeavor towards this direction, where differentiable neural functions are parametrized to fit ab initio energies, and furthermore forces through automatic differentiation. We argue that, as of now, the utility of the MLFF models is no longer bottlenecked by accuracy but primarily by their speed (as well as stability and generalizability), as many recent variants, on limited chemical spaces, have long surpassed the chemical accuracy of $1$ kcal/mol -- the empirical threshold beyond which realistic chemical predictions are possible -- though still magnitudes slower than MM. Hoping to kindle explorations and designs of faster, albeit perhaps slightly less accurate MLFFs, in this review, we focus our attention on the design space (the speed-accuracy tradeoff) between MM and ML force fields. After a brief review of the building blocks of force fields of either kind, we discuss the desired properties and challenges now faced by the force field development community, survey the efforts to make MM force fields more accurate and ML force fields faster, envision what the next generation of MLFF might look like.

We present the discovery of a low-density planet transiting TOI-5688 A b, a high-metallicity M2V star. This planet was discovered as part of the search for transiting giant planets ($R \gtrsim8$ M$_\oplus$) through the Searching for GEMS (Giant Exoplanets around M-dwarf Stars) survey. The planet TOI-5688 A b was discovered with the Transiting Exoplanet Survey Satellite (TESS), and characterized with ground-based transits from Red Buttes Observatory (RBO), the Table Mountain Observatory of Pomona College, and radial velocity (RV) measurements with the Habitable-Zone Planet Finder (HPF) on the 10 m Hobby Eberly Telescope (HET) and NEID on the WIYN 3.5 m telescope. From the joint fit of transit and RV data, the mass of the planet is $124\pm24$ M$_\oplus$ and the radius is $10.4\pm0.7$ R$_\oplus$. This planet has a density of $0.61^{+0.20}_{-0.15}$ g/cm${}^3$, and is on a $\sim2.95$ day orbit around its host star. The spectroscopic and photometric analysis of the host star TOI-5688 A shows that it is a high metallicity ([Fe/H] $ = 0.47\pm0.16$ dex) M2V star, favoring the core-accretion formation pathway as the likely formation scenario for this planet. In this paper, we analyze potential mechanisms of planet formation in the context of the formation of TOI-5688 A b. Additionally, observations with Gaia suggest the presence of a wide-separation binary companion, TOI-5688 B, which has a projected separation of $\sim5"$ (1110 AU) and is an M4V. This makes TOI-5688 A b part of a growing number of GEMS in wide-separation binary systems., Comment: 20 pages, 7 figures, Submitted to AJ, Comments are welcome

A significant barrier to achieving the radial velocity (RV) measurement accuracy and precision required to characterize terrestrial mass exoplanets is the existence of time-variable features in the measured spectra, from both telluric absorption and stellar variability, which affect measured line shapes and can cause apparent RV shifts. Reaching the desired accuracy using traditional techniques often requires avoiding lines contaminated by stellar variability and/or changing tellurics, and thus discarding a large fraction of the spectrum, lowering precision. New data-driven methods can help achieve extremely precise and accurate RVs by enabling the use of a larger fraction of the available data. While there exist methods for modeling telluric features or the stellar variability individually, there is a need for additional tools that are capable of modeling them simultaneously at the spectral level. Here we present StellarSpectraObservationFitting.jl (SSOF), a Julia package for measuring Doppler shifts and creating data-driven models (with fast, physically-motivated Gaussian Process regularization) for the time-variable spectral features for both the telluric transmission and stellar spectrum, while accounting for the wavelength-dependent instrumental line-spread function. We demonstrate SSOF's state-of-the-art performance on data from the NEID RV spectrograph on the WIYN 3.5m Telescope for multiple stars. We show SSOF's, ability to accurately identify and characterize spectral variability and provide $\sim$2-6x smaller photon-limited errors over the NEID CCF-based pipeline and match the performance of SERVAL, a leading template-based pipeline, using only observed EPRV spectra., Comment: 47 pages, 21 figures, 7 tables. In revision for AAS Journals. Code at https://github.com/christiangil/StellarSpectraObservationFitting.jl

A localized Zeeman field, intensified at heterostructure interfaces, could play a crucial role in a broad area including spintronics and unconventional superconductors. Conventionally, the generation of a local Zeeman field is achieved through magnetic exchange coupling with a magnetic material. However, magnetic elements often introduce defects, which could weaken or destroy superconductivity. Alternatively, the coupling between a superconductor with strong spin-orbit coupling and a non-magnetic chiral material could serve as a promising approach to generate a spin active interface. In this study, we leverage an interface superconductor, namely induced superconductivity in noble metal surface states, to probe the spin active interface. Our results unveil an enhanced interface Zeeman field, which selectively closes the surface superconducting gap while preserving the bulk superconducting pairing. The chiral material, i.e. trigonal tellurium, also induces Andreev bound states (ABS) exhibiting spin polarization. The field dependence of ABS manifests a substantially enhanced interface Land\'e g-factor (g_eff ~ 12), thereby corroborating the enhanced interface Zeeman energy., Comment: 27 pages, 11 figures

Transiting giant exoplanets around M-dwarf stars (GEMS) are rare, owing to the low-mass host stars. However, the all-sky coverage of TESS has enabled the detection of an increasingly large number of them to enable statistical surveys like the \textit{Searching for GEMS} survey. As part of this endeavour, we describe the observations of six transiting giant planets, which includes precise mass measurements for two GEMS (K2-419Ab, TOI-6034b) and statistical validation for four systems, which includes validation and mass upper limits for three of them (TOI-5218b, TOI-5616b, TOI-5634Ab), while the fourth one -- TOI-5414b is classified as a `likely planet'. Our observations include radial velocities from the Habitable-zone Planet Finder on the Hobby-Eberly Telescope, and MAROON-X on Gemini-North, along with photometry and high-contrast imaging from multiple ground-based facilities. In addition to TESS photometry, K2-419Ab was also observed and statistically validated as part of the K2 mission in Campaigns 5 and 18, which provides precise orbital and planetary constraints despite the faint host star and long orbital period of $\sim 20.4$ days. With an equilibrium temperature of only 380 K, K2-419Ab is one of the coolest known well-characterized transiting planets. TOI-6034 has a late F-type companion about 40\arcsec~away, making it the first GEMS host star to have an earlier main-sequence binary companion. These confirmations add to the existing small sample of confirmed transiting GEMS., Comment: Accepted in AJ

This survey examines the broad suite of methods and models for combining machine learning with physics knowledge for prediction and forecast, with a focus on partial differential equations. These methods have attracted significant interest due to their potential impact on advancing scientific research and industrial practices by improving predictive models with small- or large-scale datasets and expressive predictive models with useful inductive biases. The survey has two parts. The first considers incorporating physics knowledge on an architectural level through objective functions, structured predictive models, and data augmentation. The second considers data as physics knowledge, which motivates looking at multi-task, meta, and contextual learning as an alternative approach to incorporating physics knowledge in a data-driven fashion. Finally, we also provide an industrial perspective on the application of these methods and a survey of the open-source ecosystem for physics-informed machine learning., Comment: 56 pages, 8 figures, 2 tables

In purely normal elastic rough surface contact problems, Persson's theory of contact shows that the evolution of the probability density function (PDF) of contact pressure with the magnification is governed by a diffusion equation. However, there is no partial differential equation describing the evolution of the PDF of the interfacial gap. In this study, we derive a convection--diffusion equation in terms of the PDF of the interfacial gap based on stochastic process theory, as well as the initial and boundary conditions. A finite difference method is developed to numerically solve the partial differential equation. The predicted PDF of the interfacial gap agrees well with that by Green's Function Molecular Dynamics (GFMD) and other variants of Persson's theory of contact at high load ranges. At low load ranges, the obvious deviation between the present work and GFMD is attributed to the overestimated mean interfacial gap and oversimplified magnification-dependent diffusion coefficient used in the present model. As one of its direct application, we show that the present work can effectively solve the adhesive contact problem under the DMT limit. The current study provides an alternative methodology for determining the PDF of the interfacial gap and a unified framework for solving the complementary problem of random contact pressure and random interfacial gap based on stochastic process theory.

The complex and evolving threat landscape of frontier AI development requires a multi-layered approach to risk management ("defense-in-depth"). By reviewing cybersecurity and AI frameworks, we outline three approaches that can help identify gaps in the management of AI-related risks. First, a functional approach identifies essential categories of activities ("functions") that a risk management approach should cover, as in the NIST Cybersecurity Framework (CSF) and AI Risk Management Framework (AI RMF). Second, a lifecycle approach instead assigns safety and security activities across the model development lifecycle, as in DevSecOps and the OECD AI lifecycle framework. Third, a threat-based approach identifies tactics, techniques, and procedures (TTPs) used by malicious actors, as in the MITRE ATT&CK and MITRE ATLAS databases. We recommend that frontier AI developers and policymakers begin by adopting the functional approach, given the existence of the NIST AI RMF and other supplementary guides, but also establish a detailed frontier AI lifecycle model and threat-based TTP databases for future use., Comment: 79 pages

For solar-type stars, spots and their associated magnetic regions induce radial velocity perturbations through the Doppler rotation signal and the suppression of convective blueshift -- collectively known as rotation-modulation. We developed the Rotation-Convection (RC) model: a method of detrending and characterizing rotation-modulation, using only cross-correlation functions or 1-dimensional spectra, without the need for continuous high cadence measurements. The RC method uses a simple model for the anomalous radial velocity induced by an active region and has two inputs: stellar flux (or a flux proxy) and the relative radial velocity between strongly and weakly absorbed wavelengths (analogous to the bisector-inverse slope). On NEID solar data (three month baseline), the RC model lowers the amplitude of rotationally-modulated stellar activity to below the meter-per-second level. For the standard star HD 26965, the RC model detrends the activity signal to the meter-per-second level for HARPS, EXPRES, and NEID observations, even though the temporal density and timespan of the observations differs by an order of magnitude between the three datasets. In addition to detrending, the RC model also characterizes the rotation-modulation signal. From comparison with the Solar Dynamics Observatory, we confirmed that the model accurately recovers and separates the rotation and convection radial velocity components. We also mapped the amplitude of the rotation and convection perturbations as a function of height within the stellar atmosphere. Probing stellar atmospheres with our revised spot model will fuel future innovations in stellar activity mitigation, enabling robust exoplanet detection., Comment: Accepted to AJ, 22 pages, 9 figures

This study introduces a novel approach to enhance the spatial-temporal resolution of time-event pixels based on luminance changes captured by event cameras. These cameras present unique challenges due to their low resolution and the sparse, asynchronous nature of the data they collect. Current event super-resolution algorithms are not fully optimized for the distinct data structure produced by event cameras, resulting in inefficiencies in capturing the full dynamism and detail of visual scenes with improved computational complexity. To bridge this gap, our research proposes a method that integrates binary spikes with Sigma Delta Neural Networks (SDNNs), leveraging spatiotemporal constraint learning mechanism designed to simultaneously learn the spatial and temporal distributions of the event stream. The proposed network is evaluated using widely recognized benchmark datasets, including N-MNIST, CIFAR10-DVS, ASL-DVS, and Event-NFS. A comprehensive evaluation framework is employed, assessing both the accuracy, through root mean square error (RMSE), and the computational efficiency of our model. The findings demonstrate significant improvements over existing state-of-the-art methods, specifically, the proposed method outperforms state-of-the-art performance in computational efficiency, achieving a 17.04-fold improvement in event sparsity and a 32.28-fold increase in synaptic operation efficiency over traditional artificial neural networks, alongside a two-fold better performance over spiking neural networks., Comment: ECCV: The 18th European Conference on Computer Vision ECCV 2024 NeVi Workshop

The redshifted 21 cm line of cosmic atomic hydrogen is one of the most auspicious tools in deciphering the early Universe. Recovering this signal remains an ongoing problem for cosmologists in the field, with the signal being hidden behind foregrounds approximately five orders of magnitude brighter than itself. A traditional forward modelling data analysis pipeline using Bayesian data analysis and a physically motivated foreground model to find this signal shows great promise in the case of unchanging environmental conditions. However we demonstrate in this paper that in the presence of a soil with changing dielectric properties under the antenna over time, or a changing soil temperature in the far field of our observation these traditional methods struggle. In this paper we detail a tool using Masked Auto-regressive Flows that improves upon previous physically motivated foreground models when one is trying to recover this signal in the presence of changing environmental conditions. We demonstrate that with these changing parameters our tool consistently recovers the signal with a much greater Bayesian evidence than the traditional data analysis pipeline, decreasing the root mean square error in the recovery of the injected signal by up to 45 %., Comment: 12 Pages, 8 Figures

We present a pioneering approach to tracking analysis within the COMET Phase-I experiment, which aims to search for the charged lepton flavor violating $\mu\to e$ conversion process in a muonic atom, at J-PARC, Japan. This paper specifically introduces the extraction of signal electron trajectories in the COMET Phase-I cylindrical drift chamber (CDC) amidst a high background hit rate, with more than $40\,\%$ occupancy of the total CDC cells, utilizing deep learning techniques of semantic segmentation. Our model achieved remarkable results, with a purity rate of $98\,\%$ and a retention rate of $90\,\%$ for CDC cells with signal hits, surpassing the design-goal performance of $90\,\%$ for both metrics. This study marks the initial application of deep learning to COMET tracking, paving the way for more advanced techniques in future research., Comment: 26 pages, 18 figures

We present a new analysis of Kepler-21, the brightest (V = 8.5) Kepler system with a known transiting exoplanet, Kepler-21 b. Kepler-21 b is a radius valley planet ($R = 1.6\pm 0.2 R_{\oplus}$) with an Earth-like composition (8.38$\pm$1.62 g/cc), though its mass and radius fall in the regime of possible "water worlds." We utilize new Keck/HIRES and WIYN/NEID radial velocity (RV) data in conjunction with Kepler and TESS photometry to perform a detailed study of activity mitigation between photometry and RVs. We additionally refine the system parameters, and we utilize Gaia astrometry to place constraints on a long-term RV trend. Our activity analysis affirms the quality of Kepler photometry for removing correlated noise from RVs, despite its temporal distance, though we reveal some cases where TESS may be superior. Using refined orbital parameters and updated composition curves, we rule out a ``water world" scenario for Kepler-21 b, and we identify a long period super-Jupiter planetary candidate, Kepler-21 (c).

Mathematical documents written in LaTeX often contain ambiguities. We can resolve some of them via semantic markup using, e.g., sTeX, which also has other potential benefits, such as interoperability with computer algebra systems, proof systems, and increased accessibility. However, semantic markup is more involved than "regular" typesetting and presents a challenge for authors of mathematical documents. We aim to smooth out the transition from plain LaTeX to semantic markup by developing semi-automatic tools for authors. In this paper we present an approach to semantic markup of formulas by (semi-)automatically generating grammars from existing sTeX macro definitions and parsing mathematical formulas with them. We also present a GUI-based tool for the disambiguation of parse results and showcase its functionality and potential using a grammar for parsing untyped $\lambda$-terms., Comment: Submitted to the CICM 2024 conference, due to be published in Volume 14960 of Springer's Lecture Notes in Computer Science