arXiv subjects

James Foster

Publications and source records attributed to James Foster.

At least 19 recordsLinked to original sources

arXiv2026

Spectroscopic Analysis of the 2025 Eclipse of the Symbiotic Binary V1413 Aquilae

We report on a coordinated campaign by amateur astronomers using a combination of high and low resolution spectroscopy to observe the 2025 eclipse of the symbiotic binary V1413 Aql shortly after a probable Z And-type symbiotic outburst. We measured the eclipse time of minimum and computed an updated eclipse ephemeris. Our spectra were calibrated in absolute flux and multi-Gaussian fits were used to resolve and quantify components of the H{\alpha} emission line. We measured the radial velocity curve of the white dwarf and determined the semi-amplitude as 25.7 km/s and the systemic radial velocity as 95.1 km/s. We found the spectral continuum was consistent with that of a late F or early G type giant star.

astro-ph.SR↗

arXiv2026

Strong Stochastic Flow Maps

Flow and diffusion models generate high-quality samples in many modalities; however, many network evaluations are required during inference due to numerical integration of an underlying differential equation. Flow maps alleviate this problem by learning the solution map of the differential equation directly, enabling few-step sampling. Yet, current methods are restricted to approximating the solution map of ODEs. These methods can be used to learn the transition kernel of an SDE, thereby obtaining a solution map that recovers the marginal distributions of the process (weak convergence) rather than the solution path (strong convergence). We propose Strong Stochastic Flow Maps (SSFMs) as a novel framework for learning the strong solution map of additive-noise SDEs, directly generalizing deterministic flow maps to the stochastic setting. Further, a polynomial approximation to Brownian motion is introduced and shown to converge pathwise. These results enable a simulation-free training objective for the solution map of diffusion models. We demonstrate that SSFMs outperform previous stochastic flow map methods on image generation and enable few-step sampling of molecular systems.

cs.LG↗

arXiv2026

ARCANE: Scalable high-degree cubature formulae for simulating SDEs without Monte Carlo error

Monte Carlo sampling is the standard approach for estimating properties of solutions to stochastic differential equations (SDEs), but accurate estimates require huge sample sizes. Lyons and Victoir (2004) proposed replacing independently sampled Brownian driving paths with "cubature formulae", deterministic weighted sets of paths that match Brownian "signature moments" up to some degree $D$. They prove that cubature formulae exist for arbitrary $D$, but explicit constructions are difficult and have only reached $D=7$, too small for practical use. We present ARCANE, an algorithm that efficiently and automatically constructs cubature formulae of arbitrary degree. It reproduces the state of the art in seconds and reaches $\boldsymbol{D=19}$ within hours on modest hardware. In simulations across multiple different SDEs and error metrics, our cubature formulae robustly achieve an error orders of magnitude smaller than Monte Carlo with the same number of paths.

math.NA↗

arXiv2025

Reversible Deep Equilibrium Models

Deep Equilibrium Models (DEQs) are an interesting class of implicit model where the model output is implicitly defined as the fixed point of a learned function. These models have been shown to outperform explicit (fixed-depth) models in large-scale tasks by trading many deep layers for a single layer that is iterated many times. However, gradient calculation through DEQs is approximate. This often leads to unstable training dynamics and requires regularisation or many function evaluations to fix. Here, we introduce Reversible Deep Equilibrium Models (RevDEQs) that allow for exact gradient calculation, no regularisation and far fewer function evaluations than DEQs. We show that RevDEQs significantly improve performance on language modelling and image classification tasks against comparable implicit and explicit models.

cs.LG↗

arXiv2025

Underdamped Langevin MCMC with third order convergence

In this paper, we propose a new numerical method for the underdamped Langevin diffusion (ULD) and present a non-asymptotic analysis of its sampling error in the 2-Wasserstein distance when the $d$-dimensional target distribution $p(x)\propto e^{-f(x)}$ is strongly log-concave and has varying degrees of smoothness. Precisely, under the assumptions that the gradient and Hessian of $f$ are Lipschitz continuous, our algorithm achieves a 2-Wasserstein error of $\varepsilon$ in $\mathcal{O}(\sqrt{d}/\varepsilon)$ and $\mathcal{O}(\sqrt{d}/\sqrt{\varepsilon})$ steps respectively. Therefore, our algorithm has a similar complexity as other popular Langevin MCMC algorithms under matching assumptions. However, if we additionally assume that the third derivative of $f$ is Lipschitz continuous, then our algorithm achieves a 2-Wasserstein error of $\varepsilon$ in $\mathcal{O}(\sqrt{d}/\varepsilon^{\frac{1}{3}})$ steps. To the best of our knowledge, this is the first gradient-only method for ULD with third order convergence. To support our theory, we perform Bayesian logistic regression across a range of real-world datasets, where our algorithm achieves competitive performance compared to an existing underdamped Langevin MCMC algorithm and the popular No U-Turn Sampler (NUTS).

stat.ML↗

arXiv2025

HD 5501: A Rapidly Evolving Interacting Eclipsing Binary with a Variable Light Curve and H$\alpha$ Emission

HD~5501, a hitherto little studied eclipsing binary with an early A-type primary, has been caught in a short-lived, astrophysically interesting phase of its binary evolution. Recent photometric and spectroscopic observations, including photometric data from {\it TESS}, show it has a highly variable light curve as well as complex spectral variability, particularly in both the absorption and emission components at H~$\alpha$. Our current campaign, including both professional and amateur observers, has determined that the primary is evolving rapidly across the Hertzsprung gap and that, unusually in the case of mass transfer, the orbital period is declining with a characteristic time-scale $P/\dot{P} \approx$ 170,000 years. Significantly, the orbit is eccentric and it appears that mass transfer from the primary to the secondary occurs only near periastron. Modeling indicates the presumed B7 V secondary to be surrounded by an accretion torus, which likely has dynamically chaotic variations in size and shape. Our analysis further implies the presence of a circumbinary disc or shell supplied by mass loss through the Lagrange $L_3$ point. That mass loss appears to account for most of the emission at H$\alpha$. We describe how this astrophysically interesting system may yield valuable information about binary star evolution at the onset of Roche-lobe overflow, as well as insights into eccentricity-modifying mechanisms such as the Soker mechanism.

astro-ph.SR↗

arXiv2025

Photometry and Spectroscopy of the Symbiotic Binary V1413 Aquilae during the 2024 Eclipse

We report our photometric and spectroscopic observations and analysis of the 2024 eclipse of the symbiotic binary V1413 Aquilae. We found the system in a visually bright state and the eclipse time of minimum consistent with the published ephemeris. The eclipse profile showed that the hot component was an extended object rather than an isolated white dwarf. By analyzing the eclipse profile we estimated the orbital inclination to be 67.9{\deg}, the radius of the extended hot component surrounding the white dwarf to be 39.3 Rsun, and that the red giant star was probably filling its Roche Lobe. From our flux calibrated spectra, we determined the brightest component of the system to be the hot component whose continuum and emission lines together are responsible for 83% of the V-band light. The circumbinary nebula and its emission lines contribute over 14%, while the red giant is responsible for less than 3%. Our spectra revealed a rich harvest of low ionization emission lines. By measuring how flux in these emission lines varied through the eclipse, we have provided information which should prove useful for future modelling of this symbiotic system.

astro-ph.SR↗

arXiv2025

Spectral evolution of the narrow emission line components in optical during the 2022 nova eruption of U Scorpii

There remains debate over whether the accretion disk survives or is entirely disrupted after the nova eruption. In our previous paper, Muraoka et al. (2024, PASJ, 76, 293) have photometrically demonstrated that the surviving accretion disk was expanded close to the L1 point during the optical plateau stage and then drastically shrank to the tidal truncation radius after the optical plateau stage ended. To approach the clarification of the physical mechanism that drives these structural changes, we have then conducted systematic analyses of the spectral evolution of the narrow emission line components in optical over 22 d following the optical peak during the 2022 nova eruption of U Scorpii (U Sco). Additionally, we present its optical spectrum in quiescence 794 d after the 2022 nova eruption. We find that the single-peaked narrow components of H$\alpha$ and He II 4686 appeared almost simultaneously between roughly days 6 and 8, preceding the onset of the disk eclipses observed after day 11. This finding suggests that the nova wind near the binary system may be the primary origin of these narrow components and even remained active several days after the nova eruption with a velocity of approximately 1000 km s$^{-1}$, likely driving the expansion of the accretion disk until the end of the optical plateau stage. While the contribution of the rotating accretion disk might be dominated by that of the nova wind in the H$\alpha$ line profile, the outward surface flow from the expanded disk might also contribute to these narrow features during the optical plateau stage, making the single-peaked narrow line profiles more pronounced.

astro-ph.SR↗

arXiv2024

Efficient, Accurate and Stable Gradients for Neural ODEs

Training Neural ODEs requires backpropagating through an ODE solve. The state-of-the-art backpropagation method is recursive checkpointing that balances recomputation with memory cost. Here, we introduce a class of algebraically reversible ODE solvers that significantly improve upon both the time and memory cost of recursive checkpointing. The reversible solvers presented calculate exact gradients, are high-order and numerically stable -- strictly improving on previous reversible architectures.

cs.LG↗

arXiv2024

Approximating the signature of Brownian motion for high order SDE simulation

The signature is a collection of iterated integrals describing the "shape" of a path. It appears naturally in the Taylor expansions of controlled differential equations and, as a consequence, is arguably the central object within rough path theory. In this paper, we will consider the signature of Brownian motion with time, and present both new and recently developed approximations for some of its integrals. Since these integrals (or equivalent L\'{e}vy areas) are nonlinear functions of the Brownian path, they are not Gaussian and known to be challenging to simulate. To conclude the paper, we will present some applications of these approximations to the high order numerical simulation of stochastic differential equations (SDEs).

math.NA↗

arXiv2024

Physically Consistent Online Inertial Adaptation for Humanoid Loco-manipulation

The ability to accomplish manipulation and locomotion tasks in the presence of significant time-varying external loads is a remarkable skill of humans that has yet to be replicated convincingly by humanoid robots. Such an ability will be a key requirement in the environments we envision deploying our robots: dull, dirty, and dangerous. External loads constitute a large model bias, which is typically unaccounted for. In this work, we enable our humanoid robot to engage in loco-manipulation tasks in the presence of significant model bias due to external loads. We propose an online estimation and control framework involving the combination of a physically consistent extended Kalman filter for inertial parameter estimation coupled to a whole-body controller. We showcase our results both in simulation and in hardware, where weights are mounted on Nadia's wrist links as a proxy for engaging in tasks where large external loads are applied to the robot.

cs.RO↗

arXiv2024

Single-seed generation of Brownian paths and integrals for adaptive and high order SDE solvers

Despite the success of adaptive time-stepping in ODE simulation, it has so far seen few applications for Stochastic Differential Equations (SDEs). To simulate SDEs adaptively, methods such as the Virtual Brownian Tree (VBT) have been developed, which can generate Brownian motion (BM) non-chronologically. However, in most applications, knowing only the values of Brownian motion is not enough to achieve a high order of convergence; for that, we must compute time-integrals of BM such as $\int_s^t W_r \, dr$. With the aim of using high order SDE solvers adaptively, we extend the VBT to generate these integrals of BM in addition to the Brownian increments. A JAX-based implementation of our construction is included in the popular Diffrax library (https://github.com/patrick-kidger/diffrax). Since the entire Brownian path produced by VBT is uniquely determined by a single PRNG seed, previously generated samples need not be stored, which results in a constant memory footprint and enables experiment repeatability and strong error estimation. Based on binary search, the VBT's time complexity is logarithmic in the tolerance parameter $\varepsilon$. Unlike the original VBT algorithm, which was only precise at some dyadic times, we prove that our construction exactly matches the joint distribution of the Brownian motion and its time integrals at any query times, provided they are at least $\varepsilon$ apart. We present two applications of adaptive high order solvers enabled by our new VBT. Using adaptive solvers to simulate a high-volatility CIR model, we achieve more than twice the convergence order of constant stepping. We apply an adaptive third order underdamped or kinetic Langevin solver to an MCMC problem, where our approach outperforms the No U-Turn Sampler, while using only a tenth of its function evaluations.

math.NA↗

arXiv2023

On the convergence of adaptive approximations for stochastic differential equations

In this paper, we study numerical approximations for stochastic differential equations (SDEs) that use adaptive step sizes. In particular, we consider a general setting where decisions to reduce step sizes are allowed to depend on the future trajectory of the underlying Brownian motion. Since these adaptive step sizes may not be previsible, the standard mean squared error analysis cannot be directly applied to show that the numerical method converges to the solution of the SDE. Building upon the pioneering work of Gaines and Lyons, we instead use rough path theory to establish pathwise convergence for a wide class of adaptive numerical methods on general Stratonovich SDEs (with sufficiently smooth vector fields). To our knowledge, this is the first convergence guarantee that applies to standard solvers, such as the Milstein and Heun methods, with non-previsible step sizes. In our analysis, we require adaptive step sizes to have a "no skip" property and to take values at only dyadic times. Secondly, in contrast to the Euler-Maruyama method, we require the SDE solver to have unbiased "L\'evy area" terms in its Taylor expansion. We conjecture that for adaptive SDE solvers more generally, convergence is still possible provided the method does not introduce "L\'evy area bias". We present a simple example where the step size control can skip over previously considered times, resulting in the numerical method converging to an incorrect limit (i.e. not the Stratonovich SDE). Finally, we conclude with an experiment demonstrating the accuracy of Heun's method and a newly introduced Splitting Path-based Runge-Kutta scheme (SPaRK) when used with adaptive step sizes.

math.NA↗

arXiv2023

TESS photometry of the nova eruption in V606 Vul: asymmetric photosphere and multiple ejections?

Lightcurves of many classical novae deviate from the canonical "fast rise - smooth decline" pattern and display complex variability behavior. We present the first TESS-space-photometry-based investigation of this phenomenon. We use Sector 41 full-frame images to extract a lightcurve of the slow Galactic nova V606 Vul that erupted nine days prior to the start of the TESS observations. The lightcurve covers the first of two major peaks of V606 Vul that was reached 19 days after the start of the eruption. The nova reached its brightest visual magnitude V=9.9 in its second peak 64 days after the eruption onset, following the completion of Sector 41 observations. To increase the confidence level of the extracted lightcurve, we performed the analysis using four different codes implementing the aperture photometry (Lightkurve, VaST) and image subtraction (TESSreduce, tequila_shots) and find good agreement between them. We performed ground-based photometric and spectroscopic monitoring to complement the TESS data. The TESS lightcurve reveals two features: periodic variations (0.12771 d, 0.01 mag average peak-to-peak amplitude) that disappeared when the source was within 1 mag of peak optical brightness and a series of isolated mini-flares (with peak-to-peak amplitudes of up to 0.5 mag) appearing at seemingly random times. We interpret the periodic variations as the result of azimuthal asymmetry of the photosphere engulfing the nova-hosting binary that was distorted by and rotating with the binary. Whereas we use spectra to associate the two major peaks in the nova lightcurve with distinct episodes of mass ejection, the origin of mini-flares remains elusive.

astro-ph.SR↗

arXiv2023

Efficient, Dynamic Locomotion through Step Placement with Straight Legs and Rolling Contacts

For humans, fast, efficient walking over flat ground represents the vast majority of locomotion that an individual experiences on a daily basis, and for an effective, real-world humanoid robot the same will likely be the case. In this work, we propose a locomotion controller for efficient walking over near-flat ground using a relatively simple, model-based controller that utilizes a novel combination of several interesting design features including an ALIP-based step adjustment strategy, stance leg length control as an alternative to center of mass height control, and rolling contact for heel-to-toe motion of the stance foot. We then present the results of this controller on our robot Nadia, both in simulation and on hardware. These results include validation of this controller's ability to perform fast, reliable forward walking at 0.75 m/s along with backwards walking, side-stepping, turning in place, and push recovery. We also present an efficiency comparison between the proposed control strategy and our baseline walking controller over three steady-state walking speeds. Lastly, we demonstrate some of the benefits of utilizing rolling contact in the stance foot, specifically the reduction of necessary positive and negative work throughout the stride.

cs.RO↗

arXiv2023

Generative Modelling of L\'evy Area for High Order SDE Simulation

It is well understood that, when numerically simulating SDEs with general noise, achieving a strong convergence rate better than $O(\sqrt{h})$ (where h is the step size) requires the use of certain iterated integrals of Brownian motion, commonly referred to as its "L\'evy areas". However, these stochastic integrals are difficult to simulate due to their non-Gaussian nature and for a $d$-dimensional Brownian motion with $d > 2$, no fast almost-exact sampling algorithm is known. In this paper, we propose L\'evyGAN, a deep-learning-based model for generating approximate samples of L\'evy area conditional on a Brownian increment. Due to our "Bridge-flipping" operation, the output samples match all joint and conditional odd moments exactly. Our generator employs a tailored GNN-inspired architecture, which enforces the correct dependency structure between the output distribution and the conditioning variable. Furthermore, we incorporate a mathematically principled characteristic-function based discriminator. Lastly, we introduce a novel training mechanism termed "Chen-training", which circumvents the need for expensive-to-generate training data-sets. This new training procedure is underpinned by our two main theoretical results. For 4-dimensional Brownian motion, we show that L\'evyGAN exhibits state-of-the-art performance across several metrics which measure both the joint and marginal distributions. We conclude with a numerical experiment on the log-Heston model, a popular SDE in mathematical finance, demonstrating that high-quality synthetic L\'evy area can lead to high order weak convergence and variance reduction when using multilevel Monte Carlo (MLMC).

stat.ML↗

arXiv2023

Reachability Aware Capture Regions with Time Adjustment and Cross-Over for Step Recovery

For humanoid robots to live up to their potential utility, they must be able to robustly recover from instabilities. In this work, we propose a number of balance enhancements to enable the robot to both achieve specific, desired footholds in the world and adjusting the step positions and times as necessary while leveraging ankle and hip. This includes improving the calculation of capture regions for bipedal locomotion to better consider how step constraints affect the ability to recover. We then explore a new strategy for performing cross-over steps to maintain stability, which greatly enhances the variety of tracking error from which the robot may recover. Our last contribution is a strategy for time adaptation during the transfer phase for recovery. We then present these results on our humanoid robot, Nadia, in both simulation and hardware, showing the robot walking over rough terrain, recovering from external disturbances, and taking cross-over steps to maintain balance.

cs.RO↗

arXiv2023

Holistic Cube Analysis: A Query Framework for Data Insights

Many data insight questions can be viewed as searching in a large space of tables and finding important ones, where the notion of importance is defined in some adhoc user defined manner. This paper presents Holistic Cube Analysis (HoCA), a framework that augments the capabilities of relational queries for such problems. HoCA first augments the relational data model and introduces a new data type AbstractCube, defined as a function which maps a region-features pair to a relational table (a region is a tuple which specifies values of a set of dimensions). AbstractCube provides a logical form of data, and HoCA operators are cube-to-cube transformations. We describe two basic but fundamental HoCA operators, cube crawling and cube join (with many possible extensions). Cube crawling explores a region space, and outputs a cube that maps regions to signal vectors. Cube join, in turn, is critical for composition, allowing one to join information from different cubes for deeper analysis. Cube crawling introduces two novel programming features, (programmable) Region Analysis Models (RAMs) and Multi-Model Crawling. Crucially, RAM has a notion of population features, which allows one to go beyond only analyzing local features at a region, and program region-population analysis that compares region and population features, capturing a large class of importance notions. HoCA has a rich algorithmic space, such as optimizing crawling and join performance, and physical design of cubes. We have implemented and deployed HoCA at Google. Our early HoCA offering has attracted more than 30 teams building applications with it, across a diverse spectrum of fields including system monitoring, experimentation analysis, and business intelligence. For many applications, HoCA empowers novel and powerful analyses, such as instances of recurrent crawling, which are challenging to achieve otherwise.

cs.DB↗