Search

Many active galaxies harbor powerful relativistic jets, however, the detailed mechanisms of their formation and acceleration remain poorly understood. To investigate the area of jet acceleration and collimation with the highest available angular resolution, we study the innermost region of the bipolar jet in the nearby low-ionization nuclear emission-line region (LINER) galaxy NGC 1052. We combined observations of NGC 1052 taken with VLBA, GMVA, and EHT over one week in the spring of 2017. For the first time, NGC 1052 was detected with the EHT, providing a size of the central region in-between both jet bases of 250 RS (Schwarzschild radii) perpendicular to the jet axes. This size estimate supports previous studies of the jets expansion profile which suggest two breaks of the profile at around 300 RS and 10000 RS distances to the core. Furthermore, we estimated the magnetic field to be 1.25 Gauss at a distance of 22 {\mu}as from the central engine by fitting a synchrotron-self absorption spectrum to the innermost emission feature, which shows a spectral turn-over at about 130 GHz. Assuming a purely poloidal magnetic field, this implies an upper limit on the magnetic field strength at the event horizon of 26000 Gauss, which is consistent with previous measurements. The complex, low-brightness, double-sided jet structure in NGC 1052 makes it a challenge to detect the source at millimeter (mm) wavelengths. However, our first EHT observations have demonstrated that detection is possible up to at least 230 GHz. This study offers a glimpse through the dense surrounding torus and into the innermost central region, where the jets are formed. This has enabled us to finally resolve this region and provide improved constraints on its expansion and magnetic field strength., Comment: 22 pages, 10 figures, published in A&A

The 2017 observing campaign of the Event Horizon Telescope (EHT) delivered the first very long baseline interferometry (VLBI) images at the observing frequency of 230 GHz, leading to a number of unique studies on black holes and relativistic jets from active galactic nuclei (AGN). In total, eighteen sources were observed: the main science targets, Sgr A* and M87 along with various calibrators. We investigated the morphology of the sixteen AGN in the EHT 2017 data set, focusing on the properties of the VLBI cores: size, flux density, and brightness temperature. We studied their dependence on the observing frequency in order to compare it with the Blandford-K\"onigl (BK) jet model. We modeled the source structure of seven AGN in the EHT 2017 data set using linearly polarized circular Gaussian components and collected results for the other nine AGN from dedicated EHT publications, complemented by lower frequency data in the 2-86 GHz range. Then, we studied the dependences of the VLBI core flux density, size, and brightness temperature on the frequency measured in the AGN host frame. We compared the observations with the BK jet model and estimated the magnetic field strength dependence on the distance from the central black hole. Our results indicate a deviation from the standard BK model, particularly in the decrease of the brightness temperature with the observing frequency. Either bulk acceleration of the jet material, energy transfer from the magnetic field to the particles, or both are required to explain the observations.

Using the Event Horizon Telescope (EHT), the gravitationally lensed rings around the supermassive black holes (SMBHs) in Messier 87 (M87) and Sagittarius A* (Sgr A*) have now been successfully imaged at a resolution under 10 gravitational radii (R$_{\rm g}$ $ = \rm{GM/c^2}$). To expand studies beyond M87 and Sgr A*, we have constructed the Event Horizon and Environs (ETHER) sample, a comprehensive database encompassing approximately 3.15 million SMBH mass estimates, $\sim$ 20,000 Very-Long Baseline Interferometry (VLBI) radio flux densities, and $\sim$ 36,000 hard X-ray flux densities. This database is designed to identify and optimize target selection for the EHT and its upgrades on the ground and in space. We have identified a Gold Sample (GS) of nearby low-luminosity Active Galactic Nuclei (AGNs) within it that are ideal for studying jet bases and potentially imaging black hole shadows. We observed 27 of these AGNs using the EHT from 2022 to 2024, providing an opportunity to resolve and image accretion flows and jets at resolutions of $\leq$ 100 R$_{\rm g}$. Only a few SMBHs have sufficiently high enough flux density to be imaged at scales of $\leq$ 50 R$_{\rm g}$ with the present EHT. Among these are M87, Sgr A*, NGC4594 (Sombrero/M104), NGC4261, and NGC4374 (Messier 84/M84). Of these, NGC4261, Sombrero, and M84 have been observed and/or are scheduled for deep imaging with EHT+ALMA from 2023 to 2025. Sombrero, NGC4261, M84, NGC4278, and NGC5232 are clearly detected in our EHT+ALMA observations in 2022, indicating that the 230 GHz flux density from the accretion flows is significantly high. Ongoing imaging of the ETHER GS will enable measurements of black hole mass and spin, help constrain General Relativity, and enrich our understanding of jet launching and accretion inflows across a broad multi-parameter space, including black hole mass, spin, accretion rate, and orientation., Comment: 9 pages, 6 figures, 1 table, published in Proceedings of the 16th EVN Symposium, Ed. E. Ros, P. Benke, S.A. Dzib, I. Rottmann, & J.A. Zensus, Bonn: Max-Planck-Institut f\"ur Radioastronomie, 2024, pages 75-84, https://cloud.mpifr-bonn.mpg.de/index.php/s/BkX2CC2Xjn2aKR4

Causal discovery aims to automatically uncover causal relationships from data, a capability with significant potential across many scientific disciplines. However, its real-world applications remain limited. Current methods often rely on unrealistic assumptions and are evaluated only on simple synthetic toy datasets, often with inadequate evaluation metrics. In this paper, we substantiate these claims by performing a systematic review of the recent causal discovery literature. We present applications in biology, neuroscience, and Earth sciences - fields where causal discovery holds promise for addressing key challenges. We highlight available simulated and real-world datasets from these domains and discuss common assumption violations that have spurred the development of new methods. Our goal is to encourage the community to adopt better evaluation practices by utilizing realistic datasets and more adequate metrics., Comment: 39 pages, 8 figures

In this article, we examine the H\"older regularity of solutions to equations involving a mixed local-nonlocal nonlinear nonhomogeneous operator $\fp + \fqs$ with singular data, under the minimal assumption that $p> sq$. The regularity result is twofold: we establish interior gradient H\"older regularity for locally bounded data and boundary regularity for singular data. We prove both boundary H\"older and boundary gradient H\"older regularity depending on the degree of singularity. Additionally, we establish a strong comparison principle for this class of problems, which holds independent significance. As the applications of these qualitative results, we further study sublinear and subcritical perturbations of singular nonlinearity.

Given two sets of elements (such as cell types and drug compounds), researchers typically only have access to a limited subset of their interactions. The task of causal imputation involves using this subset to predict unobserved interactions. Squires et al. (2022) have proposed two estimators for this task based on the synthetic interventions (SI) estimator: SI-A (for actions) and SI-C (for contexts). We extend their work and introduce a novel causal imputation estimator, generalized synthetic interventions (GSI). We prove the identifiability of this estimator for data generated from a more complex latent factor model. On synthetic and real data we show empirically that it recovers or outperforms their estimators.

All four invariants of the mutual-visibility problem and, all four invariants of the general position problem are determined for glued binary trees. The number of the corresponding extremal sets is obtained in each of the eight situations. The results are further extended to glued $t$-ary trees, and some of them also to generalized glued binary trees.

A central goal of machine learning is generalization. While the No Free Lunch Theorem states that we cannot obtain theoretical guarantees for generalization without further assumptions, in practice we observe that simple models which explain the training data generalize best: a principle called Occam's razor. Despite the need for simple models, most current approaches in machine learning only minimize the training error, and at best indirectly promote simplicity through regularization or architecture design. Here, we draw a connection between Occam's razor and in-context learning: an emergent ability of certain sequence models like Transformers to learn at inference time from past observations in a sequence. In particular, we show that the next-token prediction loss used to train in-context learners is directly equivalent to a data compression technique called prequential coding, and that minimizing this loss amounts to jointly minimizing both the training error and the complexity of the model that was implicitly learned from context. Our theory and the empirical experiments we use to support it not only provide a normative account of in-context learning, but also elucidate the shortcomings of current in-context learning methods, suggesting ways in which they can be improved. We make our code available at https://github.com/3rdCore/PrequentialCode.

Scientific research often seeks to understand the causal structure underlying high-level variables in a system. For example, climate scientists study how phenomena, such as El Ni\~no, affect other climate processes at remote locations across the globe. However, scientists typically collect low-level measurements, such as geographically distributed temperature readings. From these, one needs to learn both a mapping to causally-relevant latent variables, such as a high-level representation of the El Ni\~no phenomenon and other processes, as well as the causal model over them. The challenge is that this task, called causal representation learning, is highly underdetermined from observational data alone, requiring other constraints during learning to resolve the indeterminacies. In this work, we consider a temporal model with a sparsity assumption, namely single-parent decoding: each observed low-level variable is only affected by a single latent variable. Such an assumption is reasonable in many scientific applications that require finding groups of low-level variables, such as extracting regions from geographically gridded measurement data in climate research or capturing brain regions from neural activity data. We demonstrate the identifiability of the resulting model and propose a differentiable method, Causal Discovery with Single-parent Decoding (CDSD), that simultaneously learns the underlying latents and a causal graph over them. We assess the validity of our theoretical results using simulated data and showcase the practical validity of our method in an application to real-world data from the climate science field., Comment: 33 pages, 17 figures

(abridged) Characterizing duty cycles of recurrent phases of dormancy and activity in supermassive black holes in active galactic nuclei is crucial in understanding impact of energy released on host galaxies and their evolution. However, identifying sources in quiescent and restarted phases is challenging. Our goal is to identify and characterize a substantial sample of radio galaxies in restarted phase and explore core prominence as a signature of this activity. We expand our prior study from a $30\,\mathrm{deg^2}$ area in Lockman Hole to a larger $424\,\mathrm{deg^2}$ region in Hobby-Eberly Telescope Dark Energy Experiment (HETDEX) field using visually selected core-dominated radio galaxies. We used 144 MHz LOFAR survey images to identify galaxies with restarting jets. By applying selection criteria, including radio core dominance, low surface brightness extended emission, spectral index properties, and morphology, we found 69 candidate restarted radio galaxies. These candidates show diverse intrinsic morphology, spanning FRI, FRII, core-with-halo, and asymmetric forms, suggesting different progenitors. Among these, nine galaxies exhibit ultra-steep spectrum extended emission combined with high radio core prominence, representing previous and current epochs of jet activity. This subset supports a model where the switch-on and switch-off mechanism occurs with fast duty cycle. The restarted candidates span radio luminosities from log$_{10}$(L$_\mathrm{144 MHz}$/$\mathrm{WHz^{-1}}$) = 23.24 to 26.80, with sizes between 88 and 1659 kpc, including 16 giant radio galaxies. Their total stellar content aligns with massive elliptical galaxies. Our findings at $z<0.4$ suggest that many restarting galaxies are not found in rich cluster environments, consistent with broader radio-galaxy population. This study confirms core prominence as an effective parameter for selecting restarted radio sources., Comment: 28 pages, 18 figures, 7 tables, accepted for publication in A&A

In this article, we deal with the fine boundary regularity, a weighted H\"{o}lder regularity of weak solutions to the problem involving the fractional $(p,q)$-Laplacian denoted by \begin{eqnarray*} \begin{array}{rll} (-\Delta)_{p}^{s} u + (-\Delta)_{q}^{s} u &= f(x) &\text{ in } \Omega u&=0 &\text{ in } \mathbb{R}^N\setminus\Omega; \end{array} \end{eqnarray*} where $\Omega$ is a $C^{1,1}$ bounded domain and $2 \leq p \leq q <\infty.$ For $0

Many causal systems such as biological processes in cells can only be observed indirectly via measurements, such as gene expression. Causal representation learning -- the task of correctly mapping low-level observations to latent causal variables -- could advance scientific understanding by enabling inference of latent variables such as pathway activation. In this paper, we develop methods for inferring latent variables from multiple related datasets (environments) and tasks. As a running example, we consider the task of predicting a phenotype from gene expression, where we often collect data from multiple cell types or organisms that are related in known ways. The key insight is that the mapping from latent variables driven by gene expression to the phenotype of interest changes sparsely across closely related environments. To model sparse changes, we introduce Tree-Based Regularization (TBR), an objective that minimizes both prediction error and regularizes closely related environments to learn similar predictors. We prove that under assumptions about the degree of sparse changes, TBR identifies the true latent variables up to some simple transformations. We evaluate the theory empirically with both simulations and ground-truth gene expression data. We find that TBR recovers the latent causal variables better than related methods across these settings, even under settings that violate some assumptions of the theory.

Large autoregressive models like Transformers can solve tasks through in-context learning (ICL) without learning new weights, suggesting avenues for efficiently solving new tasks. For many tasks, e.g., linear regression, the data factorizes: examples are independent given a task latent that generates the data, e.g., linear coefficients. While an optimal predictor leverages this factorization by inferring task latents, it is unclear if Transformers implicitly do so or if they instead exploit heuristics and statistical shortcuts enabled by attention layers. Both scenarios have inspired active ongoing work. In this paper, we systematically investigate the effect of explicitly inferring task latents. We minimally modify the Transformer architecture with a bottleneck designed to prevent shortcuts in favor of more structured solutions, and then compare performance against standard Transformers across various ICL tasks. Contrary to intuition and some recent works, we find little discernible difference between the two; biasing towards task-relevant latent variables does not lead to better out-of-distribution performance, in general. Curiously, we find that while the bottleneck effectively learns to extract latent task variables from context, downstream processing struggles to utilize them for robust prediction. Our study highlights the intrinsic limitations of Transformers in achieving structured ICL solutions that generalize, and shows that while inferring the right latents aids interpretability, it is not sufficient to alleviate this problem.

Supervised learning approaches for causal discovery from observational data often achieve competitive performance despite seemingly avoiding explicit assumptions that traditional methods make for identifiability. In this work, we investigate CSIvA (Ke et al., 2023), a transformer-based model promising to train on synthetic data and transfer to real data. First, we bridge the gap with existing identifiability theory and show that constraints on the training data distribution implicitly define a prior on the test observations. Consistent with classical approaches, good performance is achieved when we have a good prior on the test data, and the underlying model is identifiable. At the same time, we find new trade-offs. Training on datasets generated from different classes of causal models, unambiguously identifiable in isolation, improves the test generalization. Performance is still guaranteed, as the ambiguous cases resulting from the mixture of identifiable causal models are unlikely to occur (which we formally prove). Overall, our study finds that amortized causal discovery still needs to obey identifiability theory, but it also differs from classical methods in how the assumptions are formulated, trading more reliance on assumptions on the noise type for fewer hypotheses on the mechanisms.

Numerous decision-making tasks require estimating causal effects under interventions on different parts of a system. As practitioners consider using large language models (LLMs) to automate decisions, studying their causal reasoning capabilities becomes crucial. A recent line of work evaluates LLMs ability to retrieve commonsense causal facts, but these evaluations do not sufficiently assess how LLMs reason about interventions. Motivated by the role that interventions play in causal inference, in this paper, we conduct empirical analyses to evaluate whether LLMs can accurately update their knowledge of a data-generating process in response to an intervention. We create benchmarks that span diverse causal graphs (e.g., confounding, mediation) and variable types, and enable a study of intervention-based reasoning. These benchmarks allow us to isolate the ability of LLMs to accurately predict changes resulting from their ability to memorize facts or find other shortcuts. We evaluate six LLMs on the benchmarks, finding that GPT models show promising accuracy at predicting the intervention effects., Comment: 17 pages

The general position problem in graphs is to find the maximum number of vertices that can be selected such that no three vertices lie on a common shortest path. The mutual-visibility problem in graphs is to find the maximum number of vertices that can be selected such that every pair of vertices in the collection has a shortest path between them with no vertex from the collection as an internal vertex. In this paper, the general position problem and the mutual-visibility problem is investigated in double graphs and in Mycielskian graphs. Sharp general bounds are proved, in particular involving the total mutual-visibility number and the outer mutual-visibility number of base graphs. Several exact values are also determined, in particular the mutual-visibility number of the double graphs and of the Mycielskian of cycles.

Despite significant investment into safety training, large language models (LLMs) deployed in the real world still suffer from numerous vulnerabilities. One perspective on LLM safety training is that it algorithmically forbids the model from answering toxic or harmful queries. To assess the effectiveness of safety training, in this work, we study forbidden tasks, i.e., tasks the model is designed to refuse to answer. Specifically, we investigate whether in-context learning (ICL) can be used to re-learn forbidden tasks despite the explicit fine-tuning of the model to refuse them. We first examine a toy example of refusing sentiment classification to demonstrate the problem. Then, we use ICL on a model fine-tuned to refuse to summarise made-up news articles. Finally, we investigate whether ICL can undo safety training, which could represent a major security risk. For the safety task, we look at Vicuna-7B, Starling-7B, and Llama2-7B. We show that the attack works out-of-the-box on Starling-7B and Vicuna-7B but fails on Llama2-7B. Finally, we propose an ICL attack that uses the chat template tokens like a prompt injection attack to achieve a better attack success rate on Vicuna-7B and Starling-7B. Trigger Warning: the appendix contains LLM-generated text with violence, suicide, and misinformation., Comment: 19 pages, 7 figures