SearcharxivSearch

arXiv subjects

Christian Wolf

Publications and source records attributed to Christian Wolf.

At least 19 recordsLinked to original sources

Advantage-Driven Explicit Memory for Social Navigation

Robot policies are predominantly learned with classical parametric variants of imitation learning or RL, where training stores the agent's behavior exclusively in the policy's network parameters, putting a heavy burden on the representation learning algorithm. We propose a new navigation agent equipped with non-parametric memory which explicitly indexes prior steps leading to critical events. The advantages are twofold: first, it allows the policy to outsource some of its behavior into an explicit memory; second, it encourages a form of continual learning by allowing an agent to collect data from its testing episodes during deployment and therefore to better generalize to OOD situations. In the context of social navigation, we show that this improves the agent's capability to retain sparse, high-cost failures, such as human collisions. If the policy is trained in simulation, this also naturally addresses the sim-to-real gap, partially, by basing some of the decision making on real data. We integrate the explicit memory into a recurrent PPO architecture and use hidden states for memory retrieval to capture continuous spatiotemporal dynamics. The goal of exploiting rare, high-impact events is achieved by leveraging the RL agent's advantage signals. We train our agent in simulation with a combination of photorealistic rendering and non-visual crowd simulation and show that the agent is robust with respect to OOD social behavior.

cs.RO

Computability of Julia sets for complex H\'enon maps: The role of attracting and neutral cycles

We study the computability of Julia sets for polynomial diffeomorphisms of $\mathbb{C}^2$ with dynamical degree $d>1$, whose prototypical examples are complex H\'enon maps. In previous work, we established computability under the assumption of hyperbolicity (Axiom A). Here, we extend this result to maps whose Fatou components are attracting basins, allowing for the possibility of no attracting basins or infinitely many basins. This yields computability of the Julia set for several classes of non-hyperbolic maps, including certain substantially dissipative maps in the Lyubich-Peters class, and certain quasi-hyperbolic maps. Our proof is based on an algorithm that separates the dynamics into escaping, attracting, and saddle regimes. A key ingredient is the use of stable manifolds of saddle periodic points to approximate the forward Julia set via backward iteration. We first prove the result for generalized H\'enon mappings and then extend it to arbitrary polynomial diffeomorphisms by expressing them as finite compositions of generalized H\'enon maps. Finally, we present examples of non-computability in the presence of neutral dynamics, including H\'enon maps with computable coefficients exhibiting semi-Siegel behavior. These examples show that the computability/non-computability dichotomy associated with neutral dynamics in one-dimensional complex dynamics in part persists in higher dimensions.

math.DS

AGNFormer I: Reconstruction of AGN spectra using a probabilistic transformer model

We explore how an uncertainty-aware transformer-based architecture can leverage information embedded across the entire observed optical spectra of AGN, focusing on the algorithm's ability to predict unseen or masked parts of luminous AGN spectra. This provides a direct probe of the learnable correlations between AGN continua and broad lines. We introduce AGNFormer, a transformer model trained to predict the mean expected flux and variance in masked spectral regions (major broad lines to ${\pm}10^{4}$kms$^{-1}$; missing halves), inputting rest-frame spectral fluxes and uncertainties across the entire redshift range of the SDSS DR16 Quasar Catalogue. We evaluate the performance of the model on both full (no S/N limit) and high-quality (S/N > 10) spectral samples using the negative-log likelihood, and via comparisons with existing C IV and ly-a reconstruction algorithms. The model successfully reconstructs unseen AGN broad lines to better than 10-16% (4-8%) of the flux for the full (S/N > 10) test sets, up to an error floor of $\approx$2-6% of the flux at S/N $\approx$ 40, while predictions for larger unseen halves grow to 12-25% (5-15%) of the flux the further away they are from the cut-off wavelength of the seen input spectrum. Predictions faithfully reproduce the broad AGN spectral diversity across the entire optical and UV QSO main sequence parameter spaces, including both Gaussian and Lorentzian profile regimes, Feii complexes, and narrow emission lines. Performance is similar or better compared to previous spectral reconstruction algorithms. The high precision of the broad-line region reconstruction demonstrates that the method successfully aggregates information across the spectrum and highlights how the AGN continuum and weaker lines/complexes have the potential to assist astronomers in the extraction of the entire wealth of information embedded in AGN spectra.

astro-ph.GA

OzSSy1: The Australian Southern Seyfert-1 Spectroscopic Atlas and Catalogue at z < 0.1

We present a spectroscopic atlas of 887 broad-line active galactic nuclei (AGNs) in the Southern sky, spanning redshifts $z < 0.1$, declinations $\delta < 0$ deg and Galactic latitudes $|b| > 10$ deg. The sample aims at being a largely complete census of nearby broad-line AGN. The atlas is constructed from observations with $R\sim3000$ using the integral-field Wide Field Spectrograph at the Australian National University 2.3 m telescope. Spectra are extracted in a 6.7 arcsec aperture and have a median signal-to-noise ratio of 13 and 23 per Angstrom in the blue and red arms, respectively. Each spectrum is accompanied by a spectral decomposition that models the AGN continuum and host galaxy, along with fits to the emission lines H$\gamma$, H$\beta$, H$\alpha$, He II, He I, [O III], [O I], [N II] and [S II], including broad Balmer and Helium components. The data products are publicly available and designed to support studies of population demographics and AGN variability in conjunction with future time-domain surveys.

astro-ph.GA

A scalar per patch from pre-trained ViTs enables fast moving navigation in the real world

Trained policies for real-world robotics rely on computer vision components, typically in the form of pre-trained visual encoders. These encoders are an essential component and it has been shown that their power does not emerge from training on robotics downstream losses alone. Pre-training with auxiliary losses in the form of computer-vision pre-text tasks is a defining factor and heavily conditions agent performance in robotics tasks. In this unprecedented large-scale study, we ran 966 navigation episodes of static point goal navigation in a real-world building for 24km and asked which components really matter for the computer vision aspects of robotics: we evaluate state-of-the art visual encoders in realistic conditions. We explore the usefulness of heterogeneous multi-teacher distillation leading to encoders with multiple different and complementary skills. We investigate how much information from these encoders is necessary for robotics by bottlenecking them in a principled and spatially useful way and we show that this leads to the emergence of interpretable features linked to affordances. We also argue that training policies on RGB data alone does not lead to an optimal usage of visual features and show this by finetuning policies pre-trained on privileged information. All in all, we paint a more complete picture of what aspects of computer vision are relevant for real-world navigation.

cs.RO

Compressing Observation History into Agent Memory: Distilling Transformers into Recurrent Transformers

Transformers are AI's workhorse with strong performance in modeling sequential data, but their computational cost becomes prohibitive when processing long sequences. We target long-horizon streaming vision and robotics applications like map-free pose estimation, where it is particularly impractical to store and maintain a history of observations. Recurrent Transformers address this limitation by maintaining fixed-size memory but their performance lags behind that of transformers operating over the full observation history. We argue that this gap does not stem from architectural limitations, but from differences in how these models learn to compress past information. Without access to an observation history, recurrent models must explicitly decide what to retain in memory at each step, a significantly harder learning problem. In this work, we propose a distillation approach that transfers the compression strategy of a classical full-history transformer to a recurrent variant. We enable this by designing a teacher model that explicitly compresses its observation history into a fixed-size bottleneck representation. By directly supervising the student's memory with this bottleneck representation, we align the two compression mechanisms. We show that this approach allows to train a recurrent latent robotic memory with linear-time complexity while substantially narrowing the performance gap to full-history transformers.

cs.CV

From Ergodic Theory and Probability to Fractal Geometry and Dynamics: Themes in the Work of Manfred Denker

This article surveys the mathematical contributions of Manfred Denker, with a focus on themes that connect ergodic theory, probability theory, dynamical systems, fractal geometry, and statistics. Denker's highly influential work includes a systematic study of the statistical properties of dynamical systems, the development of limit theorems for dependent processes, and the use of thermodynamic formalism to relate geometric and measure-theoretic properties. Particular emphasis is placed on the emergence of probabilistic behavior in deterministic systems, including central limit theorems, invariance principles or local limit theorems, under weak dependence assumptions or in infinite measure. Further topics include equilibrium states and transfer operator methods, the role of conformal measures in fractal geometry, and the asymptotic theory of statistical procedures for dependent data, such as rank statistics and U-statistics. In addition to these theoretical developments, the survey highlights contributions connecting rigorous analysis with computational and statistical methods. Taken together, these works illustrate a unifying perspective in which ergodic, probabilistic, geometric, and statistical methods interact in the study of dynamical systems.

math.DS

DebrisWatch II: Digging deeper for geosynchronous debris

The geosynchronous (GSO) debris environment is continually evolving. Regular monitoring of the region is consequently of great importance, though the trade-off between coverage and sensitivity makes this challenging for the population of optically faint debris, where collecting area becomes a pivotal factor. Surveys conducted with large-aperture telescopes have provided crucial insights into the nature of this largely uncharacterised population. In this paper, we revisit a survey conducted with the 2.54 m Isaac Newton Telescope (INT), presenting an overhaul of the astrometric calibration and object detection stages of the original analysis pipeline. We apply a blind stacking technique to boost target recovery, unearthing 25 tracklets previously missed by single-frame extraction methods, and pushing the sensitivity limit fainter by 1 magnitude. The same algorithm is applied to a contemporaneous dataset, captured with a 36 cm astrograph, enabling performance benchmarking through the attempted recovery of INT detections from commercial-off-the-shelf observations. We achieve sub-arcsecond astrometric accuracy through a combination of improved star trail centroiding and iterative distortion fitting, allowing short arc initial orbit solutions to be obtained. High-cadence light curves extracted for trailing detections indicate that faint fragments are proportionally more variable than bright derelicts, with many exhibiting photometric signatures of rapid tumbling, often straddling the image noise floor. Lastly, we present preliminary findings from a follow-up multi-national observation campaign, utilising telescopes in Australia, Japan and La Palma. As space traffic management concerns begin to extend beyond GSO altitudes, scientifically-driven surveys of high-altitude orbits have an important role to play in characterising the faint debris environment.

astro-ph.IM

Computability properties of hyperbolic complex H\'{e}non maps

In this article, we provide the first theoretical framework guaranteeing that computers can, in principle, be used to analyze the parameter space of complex H\'{e}maps. More precisely, we obtain computability results for hyperbolic polynomial diffeomorphisms of $\mathbb{C}^2$, for which H\'{e}non maps are prototypical examples. Specifically, we establish computability of the Julia set for hyperbolic maps, semi-decidability of hyperbolicity, and lower computability of the hyperbolicity locus in the parameter space of generalized H\'{e}non mappings of fixed degree at least two. Our approach builds upon techniques developed in our's recent previous works on polynomial maps of $\mathbb{C}$ and polynomial skew products of $\mathbb{C}^2$. In the setting of polynomial diffeomorphisms of $\mathbb{C}^2$, however, establishing hyperbolicity for the Julia set is considerably more difficult, as it requires identifying unstable (and stable) cone fields that are preserved and expanded by $Df$ (respectively $Df^{-1}$), and also due to the lack of algorithmically detectable quantitative shadowing.

math.DS

Transforming Privacy Artifacts into Accessible Reports for Non-Technical Stakeholders

The transition toward Industry 5.0 is reshaping industrial work environments with an emphasis on human-centricity, enabling close collaboration between humans and machines to enhance productivity and flexibility. However, such systems typically require monitoring of human workers and operators, often involving sensitive data, raising significant privacy concerns. As a result, affected workers and unions frequently reject human-machine collaboration features due to a lack of transparency regarding privacy threats and implemented mitigation strategies. To enable early stakeholder involvement, establish trust, and support informed decision-making, privacy implications must be communicated in a way understandable to non-technical stakeholders. Yet, current Requirements Engineering (RE) practices provide limited methodological support for making privacy threats and mitigations accessible to non-technical stakeholders (e.g., individual workers or their representative unions). In this paper, we propose a conceptual framework that guides software design from human monitoring-related use cases and requirements to informed decision-making guidance focusing on non-technical stakeholders. Building on principles such as Privacy by Design, the framework leverages Large Language Models (LLMs) to transform technical artifacts into accessible privacy reports. We share initial insights from two industry use cases, evaluate the quality of the generated reports, and outline future research directions toward integrating privacy transparency into RE processes for human-centric industrial systems.

cs.SE

Optical Variability Structure Function of Low-Luminosity AGN using ATLAS Lightcurves

The origin of the optical flux variability in active galactic nuclei (AGN) is largely unknown. Previous studies have correlated features of the variability structure function (SF) with AGN properties, though they mostly involved high-luminosity AGN to avoid biases from host galaxy flux. In this work, we characterise optical variability in a sample of 246 low-luminosity AGN at $z < 0.1$ from the Six-degree Field Galaxy Survey (6dFGS) through the ensemble variability SF. We use lightcurves from the Asteroid Terrestrial-impact Last Alert System (ATLAS) with a cadence of $\sim$2 days over eight years, and perform host-AGN decomposition on recent spectra to obtain the host fraction. We find that the slope of the SF depends on black hole mass, increasing from $\sim 0.1$ at $\log M_{\mathrm{BH}}/M_\odot \sim 6.5$ to $\sim 0.3$ at $\log M_{\mathrm{BH}}/M_\odot \sim 8$. Contrary to some earlier work, we do not find breaks in the SF, and two-epoch spectra taken 20 years apart suggest that the SF keeps rising into decadal timescales. In addition, we measure an anticorrelation of the amplitude with the luminosity and a positive correlation with the black hole mass. The variability behaviour also suggests that extinction is not the main driver of the variety in Seyfert subtypes.

astro-ph.GA

Continuum Reverberation in Bright Quasars Using NASA/ATLAS

Variable continuum emission from AGN can be used to probe the structure of their accretion disks via reverberation mapping. Assuming a variable, hot inner light source irradiates the surrounding accretion disk, time delays between different continuum band light curves reveal light-travel times between their respective emission regions. Inter-band delays measured in several low-luminosity AGN are ubiquitously $\sim 3$ times longer than expected from standard disk theory, with evidence this size discrepancy may decrease in more luminous AGN. We have analysed high-cadence light curves of 9,498 of the brightest quasars between redshift 0.3-2.5 in the largest continuum reverberation study to date. Given the large sample size, we construct bins and fit delays jointly to combine inference across the parameter space and improve lag detections. We find that the size discrepancy persists in our high-luminosity sample, and that the previously seen anti-correlation with luminosity is likely driven by wavelength effects. The complex, non-monotonic wavelength dependence of delay amplitudes strongly suggests that contamination of inter-band delays by variable diffuse emission is widespread in the AGN population. We test delay behaviour against a variety of quasar properties finding longer lags in quasars with: higher Eddington ratios, redder colours, stronger optical FeII equivalent widths, higher iron ratios (both UV FeII/MgII and optical FeII/H$\beta$), CIV broad absorption troughs, and lower CIV blueshift.

astro-ph.GA

Computability of $\mathcal{G}$-Beroulli Measures and Measures of Maximal Entropy on Coded Shift Spaces

In this paper, we investigate the computability of $\mathcal{G}$-Bernoulli measures, with a particular focus on measures of maximal entropy (MMEs) on coded shift spaces. Coded shifts are natural generalizations of sofic shifts and are defined as the closure of all bi-infinite concatenations of words (generators) drawn from a countable generating set $\mathcal{G}$. We begin by establishing a computability criterion for $\mathcal{G}$-Bernoulli measures which are invariant measures given by assigning probability weights to the generators. We then apply this criterion to the setting in which the concatenation entropy exceeds the residual entropy, showing that in this case the unique measure of maximal entropy $\mu_{\rm max}$ on $X$ is computable, provided the Vere--Jones parameter $\kappa$ of $\mathcal{G}$ is computable, based on having oracle access to the generators and the language of $X$. As a consequence, the unique MME is computable for several well-known classes of shift spaces, including $S$-gap shifts, multiple-gap shifts, and $\beta$-shifts. Moreover, the two ergodic MMEs of the Dyck shift are also computable. Finally, we examine the opposite situation, where the residual entropy exceeds the concatenation entropy and the MME is known to be non-unique in general. We show that even when $\mu_{\rm max}$ is unique and the parameter $\kappa$ is computable, the measure $\mu_{\rm max}$ may still fail to be computable.

math.DS

A catalogue of Type 2 active galactic nuclei in the 6dF Galaxy Survey

Active galactic nuclei (AGNs) are the compact, energetic central regions of galaxies, powered by supermassive black holes that accrete surrounding gas and dust. Their optical spectra can be identified by strong emission-line signatures (broad and/or narrow lines). Those showing only narrow lines are classified as 'Type 2' AGN. Extensive surveys like SDSS cover AGN in the Northern Sky, but the equivalent coverage in the Southern Sky remains limited. We address this by presenting a new catalogue of Type 2 AGN from the 6dF Galaxy Survey (6dFGS), which has 136,304 spectra covering roughly 17{,}000~\mathrm{deg}^2, mainly of low-redshift galaxies. We use a median absolute deviation cut on the continuum-fitted spectrum to select emission line galaxies. AGN were identified by fitting the 6dFGS spectra with a modified Python QSO fitting tool (PyQSOFit). All selected spectra were visually inspected and corrected for fitting errors where necessary. 10,492 narrow emission line galaxies were identified in 6dFGS, including 5000 Type 2 AGN classified from Baldwin--Phillips--Terlevich (BPT) diagram. They have a median redshift of z$ \sim 0.032$ and a median $[\mathrm{O\,III}]$ luminosity of $\Log(L_{[\mathrm{O\,III}]}/ergs s^{-1}) \sim 40.04$.

astro-ph.GA

A dynamical algorithm to compute hyperbolic Julia sets in polynomial time

Hyperbolic Julia sets of complex polynomials are known to be computable in polynomial time due to pioneering work of Braverman in 2005 (10.1016/j.entcs.2004.06.031). In this paper, we present an alternative method for establishing poly-time computability of hyperbolic Julia sets, which allows us to establish, via a new algorithm, lower computability of the hyperbolicity locus of polynomials of a fixed degree. We first adapt our recently developed algorithms for the computability of polynomial skew products (preprint available arXiv.2508.08033) and then apply a refinement that allows us to establish poly-time computation of hyperbolic Julia sets. Finally, we derive lower computability of the hyperbolicity locus via an adapted lattice/refinement search algorithm. In contrast to Braverman's 2005 algorithm/proof, our approach is dynamical in nature and does not rely on techniques unique to complex analysis.

math.DS

Kinaema: a recurrent sequence model for memory and pose in motion

One key aspect of spatially aware robots is the ability to "find their bearings", ie. to correctly situate themselves in previously seen spaces. In this work, we focus on this particular scenario of continuous robotics operations, where information observed before an actual episode start is exploited to optimize efficiency. We introduce a new model, Kinaema, and agent, capable of integrating a stream of visual observations while moving in a potentially large scene, and upon request, processing a query image and predicting the relative position of the shown space with respect to its current position. Our model does not explicitly store an observation history, therefore does not have hard constraints on context length. It maintains an implicit latent memory, which is updated by a transformer in a recurrent way, compressing the history of sensor readings into a compact representation. We evaluate the impact of this model in a new downstream task we call "Mem-Nav". We show that our large-capacity recurrent model maintains a useful representation of the scene, navigates to goals observed before the actual episode start, and is computationally efficient, in particular compared to classical transformers with attention over an observation history.

cs.RO

An Extremely-High Velocity Outflow in SMSS J2157-3602, the most luminous quasar in the first 1.3 Gyr

We report the discovery of an extremely high-velocity outflow (EHVO) in the most luminous ($L\rm_{Bol}$ $\sim$ 2.29 $\times$ 10$^{48}$ erg/s) QSO, SMSS J2157-3602, at z=4.692. Combined XSHOOTER and NIRES observations reveal that the EHVO reaches a maximum velocity of v$_\mathrm{max} \sim 0.13c$ and persists over rest-frame timescales of a few months to one year. SMSS J2157-3602 also exhibits one of the highest balnicity index discovered in an EHVO so far. In addition, the blueshifted CIV emission traces a high-velocity (v$\rm_{CIV}^{50}\sim$ 4660 km/s) outflow from the broad-line region. Thanks to an XMM-Newton observation, we also discover the X-ray weak nature of this QSO, which likely prevents the overionization of the innermost disk atmosphere and facilitates the efficient launch of the detected EHVO and BLR winds. The extraordinary luminosity of SMSS J2157-3602 and the extreme velocity of the EHVO make it a unique laboratory for testing AGN driven feedback under extreme conditions. Current uncertainties on the outflow's location and column density strengthen the case for dedicated follow-up, which will be essential to assess the full feedback potential of this remarkable quasar.

astro-ph.GA

Computability for Axiom A Polynomial Skew Products of $\mathbb{C}^2$

The computability of Julia sets of rational maps on the Riemann sphere has been intensively studied in recent years (see, e.g. https://doi.org/10.17323/1609-4514-2008-8-2-185-231, https://doi.org/10.1090/conm/797/15936) for an overview. For example, by Braverman's results (https://doi.org/10.1016/j.entcs.2004.06.031, https://doi.org/10.1088/0951-7715/19/6/009), hyperbolic and parabolic Julia sets are computable in polynomial time. In this paper, we present the first work on computability related to maps of more than one complex dimension. We examine a family of polynomial endomorphisms of $\mathbb{C}^2$, the polynomial skew products; i.e., maps of the form $f(z,w) = (p(z), q(z,w)),$ where $p$ and $q$ are complex polynomials of the same degree $d\geq 2$. We show that if a polynomial skew product is Axiom A, then its chain recurrent set, which is equal to its non-wandering set and also equal to the closure of the periodic orbits, is computable. Our algorithm also identifies the various hyperbolic sets of different types, i.e., expanding, attracting, and hyperbolic sets of saddle-type. One consequence of our results is that Axiom A is a semi-decidable property on the closure of the Axiom A polynomial skew product locus. Finally, we introduce an algorithm that establishes the lower semi-computability of the hyperbolicity locus of polynomial skew products of a fixed degree.

math.DS