arXiv subjects

Yiyang Guo

Publications and source records attributed to Yiyang Guo.

10 recordsLinked to original sources

arXiv2026

ELUCID-DESI II. Revealing dark matter mass, tidal, and velocity (MTV) fields using galaxy group phase information

We introduce a novel method for reconstructing the cosmic mass, tidal, and velocity (MTV) fields over the redshift range $0 < z < 0.6$ using the phase information of galaxy groups. This approach replaces the explicit theoretical bias correction typically needed to relate galaxy groups to the underlying dark matter density field with a simulation-calibrated statistical mapping, reducing a major source of systematic uncertainty and making the method directly applicable to spectroscopic redshift surveys such as the DESI Bright Galaxy Survey (BGS). We evaluate the performance of our MTV reconstruction pipeline with mock redshift surveys that include a comprehensive set of observational selection effects. The galaxy groups used as tracers are identified with an extended halo-based group finder applied to the DESI mock galaxy catalogue with an apparent magnitude limit of $m_z < 19.65$, yielding a galaxy number comparable to that of the DESI BGS faint sample ($m_r < 20.175$). Our tests show that the reconstructed velocities are accurate and unbiased, with a residual dispersion of $\sim 120\ \mathrm{km\,s^{-1}}$ across the redshift bins. The recovered velocity field allows us to shift galaxy groups to their real-space positions, thereby correcting for the Kaiser effect. By iteratively applying this Kaiser correction to the galaxy groups, we further reconstruct the tidal field and the mass-density distribution. The reconstruction is stable with respect to the grid resolution. Overall, our results demonstrate that this group-based phase-space reconstruction provides a robust pathway to recovering the dark matter MTV fields, with strong prospects for application to DESI BGS data.

astro-ph.CO↗

arXiv2026

Allocating Recurrent Compute in Looped Language Models

Looped language models improve reasoning and knowledge manipulation by applying shared computation repeatedly. Existing systems usually repeat an entire layer stack, although a mixer and a dense feed-forward network (FFN) perform different operations and have different costs. We ask a narrower question: what should loop? We view recurrence as repeated composition of a state update and argue that an application is valuable when it exposes a new cross-position influence direction that remains observable at the task readout. Iterative Transport Rank (ITR) describes the cumulative influence trajectory; marginal ITR describes the nonredundant influence contributed by successive applications. This view motivates MixerLoop, which repeats each Gated DeltaNet mixer while applying its dense FFN once. We compare MixerLoop with no recurrence and full-block recurrence at 15M and 110M parameters under the same data, initialization, and architecture. A finite context-off intervention tests whether later mixer applications produce distinct, non-negligible, and beneficial changes at the final language-model readout. MixerLoop surpasses FullLoop on aggregate CORE at 15M and retains 41.5% of its CORE improvement at 110M while reducing recurrent-backbone projection FLOPs by 45.9%. These results show that the benefits of recurrent depth can be retained without repeatedly executing the dense FFN.

cs.LG↗

arXiv2026

WiSER: A Wireless Scene Encoder for Geometry-Grounded Multi-View Wireless Prediction

Indoor wireless propagation is governed by the interaction among three-dimensional (3D) scene geometry, radiomaterial properties, and transmitter and receiver configuration, which jointly determine both aggregate coverage behavior and path-level multipath structure. However, most learning-based site-specific prediction methods are designed for a single wireless representation, such as radiomap estimation or channel impulse response (CIR) prediction, and therefore do not explicitly exploit the propagation structure shared across heterogeneous wireless views. This paper introduces WiSER, a Wireless Scene Encoder for joint radiomap and multipath CIR prediction. WiSER maps a sparse voxel representation of an indoor scene and a transmitter location into a transmitter-conditioned sparse 3D scene memory, which is queried by two structure-aware decoders: a ray-corridor decoder for dense receiver-plane path-gain prediction and a Detection Transformer (DETR)-style set decoder for variable cardinality delay and power tap prediction. To train and evaluate this setting, we construct a co-registered indoor scene and wireless dataset pipeline using ScanNet++ indoor scenes and Sionna Ray Tracing, producing aligned sparse voxel inputs, dense radiomap labels, and unordered multipath CIR tap sets under a common coordinate frame and propagation configuration. Experimental results show that WiSER outperforms scene-specific radiomap baselines and substantially improves matched delay and power prediction over reference CIR baselines. These results suggest that transmitter-conditioned sparse 3D scene representations can serve as reusable wireless scene encoders for heterogeneous propagation queries, providing a geometry-grounded step toward representation learning and foundation-model development for AI-native wireless systems.

eess.SP↗

arXiv2026

AstroSkyFlow: an astronomical sky image flow simulator for time domain survey validation and machine learning

Modern time-domain optical surveys produce massive data volumes that require robust, high-fidelity simulated datasets for developing and validating automated pipelines and machine-learning models. We present AstroSkyFlow, a modular sky-image simulator that generates on-demand, time-dependent flux variations and models the full observing stack, from celestial sources and atmospheric effects to sensor response. Given a simulated observing schedule, AstroSkyFlow produces multi-epoch, time-series images with realistic noise and variability. Compared to real observational data, AstroSkyFlow reproduces noise characteristics and point spread function properties more accurately than the widely used SkyMaker simulator. In addition, AstroSkyFlow successfully recovers injected photometric and motion signals, such as exoplanet transits and asteroid trails. AstroSkyFlow enables the generation of labeled, high-fidelity datasets essential for training machine-learning pipelines and conducting rigorous injection-recovery tests for analysis pipelines for next-generation time-domain surveys.

astro-ph.IM↗

arXiv2026

Filtering Interlopers with Photometry and Diagnostic Features: A Machine Learning Framework Validated with CSST Slitless Spectroscopy

The slitless spectroscopic method employed by missions such as Euclid and the Chinese Space-station Survey Telescope (CSST) faces a fundamental challenge: spectroscopic redshifts derived from their data are susceptible to emission-line misidentification due to the limited spectral resolution and signal-to-noise ratio. This effect systematically introduces interloper galaxies into the sample. Conventional strict selection not only struggles to secure high redshift purity but also drastically reduces completeness by discarding valuable data. To overcome this limitation, we develop an XGBoost classifier that leverages photometric properties and spectroscopic diagnostics to construct a high-purity redshift catalog while maximizing completeness. We validate this method on a simulated sample with spectra generated by the CSST emulator for slitless spectroscopy. Of the $\sim$62 million galaxies that obtain valid redshifts (parent sample), approximately 43% achieve accurate measurements, defined as $|Δz| \leqslant 0.002(1+z)$. From this parent sample, the XGBoost classifier selects galaxies with a selection efficiency of 42.3% on the test set and 42.2% when deployed on the entire parent sample. Crucially, among the retained galaxies, 96.6% (parent sample: 96.5%) achieve accurate measurements, while the outlier fraction ($|Δz|>0.01(1+z)$) is constrained to 0.13% (0.11%). We verified that simplified configurations that exclude either spectroscopic diagnostics (except the measured redshift) or photometric data yield significantly higher outlier fractions, increasing by factors of approximately 3.5 and 6.3, respectively, with the latter case also introducing notable catastrophic interloper contamination. This framework effectively resolves the purity-completeness trade-off, enabling robust large-scale cosmological studies with CSST and similar surveys.

astro-ph.CO↗

arXiv2026

What can galaxy clustering really tell us about the galaxy-halo connections?

Subhalo abundance matching (SHAM) is a commonly used framework for modeling the galaxy-halo connection. Yet, its standard implementation has difficulty reproducing the observed galaxy clustering with high accuracy (e.g., $χ^2/\mathrm{dof} \approx 1$). To overcome this issue, we propose a novel CS-SHAM framework, in which central and satellite galaxies are independently matched to main and satellite subhalos in simulations. Within this scheme, we introduce three free parameters to explicitly characterize the satellite fraction, $f_{\mathrm{sat}}$, as a function of stellar mass or absolute magnitude. To evaluate the performance of CS-SHAM, we apply it to two sets of mock galaxy catalogs built with the conventional SHAM method but using different subhalo mass proxies, $M_{\mathrm{peak}}$ and $V_{\mathrm{peak}}$, as well as two additional galaxy samples generated from a SAM and from TNG-300. We demonstrate that CS-SHAM reliably reproduces galaxy clustering whether $M_{\mathrm{peak}}$ or $V_{\mathrm{peak}}$ is used as the subhalo mass proxy. We also find that the models are unable to place robust constraints on $f_{\mathrm{sat}}$ if different mass proxies are employed. Indeed, within the CS-SHAM framework the halo occupation distribution (HOD) and conditional luminosity or stellar mass function (CLF/CSMF) are accurately recovered. Furthermore, we demonstrate for the first time that galaxy clustering constrains the HOD and CLF/CSMF primarily for relatively massive halos. Because the halo bias is nearly constant for low-mass halos, galaxy clustering is generally not very sensitive to the satellite population residing in these low-mass systems.

astro-ph.GA↗

arXiv2026

Handling Exceptions and Effects with Automatic Resource Analysis

There exist many techniques for automatically deriving parametric resource (or cost) bounds by analyzing the source code of a program. These techniques work effectively for a large class of programs and language features. However, non-local transfer of control as needed for exception or effect handlers has remained a challenge. This paper presents the first automatic resource bound analysis that supports non-local control transfer between exceptions or effects and their handlers. The analysis is an extension of type-based automatic amortized resource analysis (AARA), which automates the potential method of amortized analysis. It is presented for a simple functional language with lists and linear potential functions. However, the ideas are directly applicable to richer settings and implemented for Standard ML and polynomial potential functions. Apart from the new type system for exceptions and effects, a main contribution is a novel syntactic type-soundness theorem that establishes the correctness of the derived bounds with respect to a stack-based abstract machine. An experimental evaluation shows that the new analysis is capable of analyzing programs that cannot be analyzed by existing methods and that the efficiency overhead of supporting exception and effect handlers is low.

cs.PL↗

arXiv2026

The Tool Decathlon: Benchmarking Language Agents for Diverse, Realistic, and Long-Horizon Task Execution

Real-world language agents must handle complex, multi-step workflows across diverse Apps. For instance, an agent may manage emails by coordinating with calendars and file systems, or monitor a production database to detect anomalies and generate reports following an operating manual. However, existing language agent benchmarks often focus on narrow domains or simplified tasks that lack the diversity, realism, and long-horizon complexity required to evaluate agents' real-world performance. To address this gap, we introduce the Tool Decathlon (dubbed as Toolathlon), a benchmark for language agents offering diverse Apps and tools, realistic environment setup, and reliable execution-based evaluation. Toolathlon spans 32 software applications and 604 tools, ranging from everyday platforms such as Google Calendar and Notion to professional ones like WooCommerce, Kubernetes, and BigQuery. Most of the tools are based on a high-quality set of Model Context Protocol (MCP) servers that we may have revised or implemented ourselves. Unlike prior works, which primarily ensure functional realism but offer limited environment state diversity, we provide realistic initial environment states from real software, such as Canvas courses with dozens of students or real financial spreadsheets. This benchmark includes 108 manually sourced or crafted tasks in total, requiring interacting with multiple Apps over around 20 turns on average to complete. Each task is strictly verifiable through dedicated evaluation scripts. Comprehensive evaluation of SOTA models highlights their significant shortcomings: the best-performing model, Claude-4.5-Sonnet, achieves only a 38.6% success rate with 20.2 tool calling turns on average, while the top open-weights model DeepSeek-V3.2-Exp reaches 20.1%. We expect Toolathlon to drive the development of more capable language agents for real-world, long-horizon task execution.

cs.CL↗

arXiv2025

Search for Past Stellar Encounters and the Origin of 3I/ATLAS

3I/ATLAS, the third discovered interstellar object, has a heliocentric speed of 58 km/s and exhibits cometary activity. To constrain the origin of 3I/ATLAS and its past dynamical evolution, we propagate the orbits of 3I/ATLAS and nearby stars to search for stellar encounters. Integrating orbits in the Galactic potential and propagating the astrometric and radial-velocity uncertainties of 30 million Gaia stars, we identify 25 encounters with median encounter distances less than 1 pc. However, because the encounter speeds between 3I/ATLAS and each encounter exceed 20 km/s, none is a plausible host under common ejection mechanisms. We infer stellar masses for most stars and quantify the gravitational perturbations exerted by each individual star or each binary system on 3I/ATLAS. The strongest gravitational scattering perturber is a wide M-dwarf binary. Among all past encounters, the binary's barycenter and 3I/ATLAS reach the small encounter distance of 0.242 pc and the encounter speed of 28.39 km/s,1.64 Myr ago. We further demonstrate that the cumulative influence of the stellar encounters on both the speed and direction of 3I/ATLAS is weak. Based on the present kinematics of 3I/ATLAS to assess its origin, we find that a thin-disk origin is strongly favored, because the thin disk both exhibits a velocity distribution closely matching that of 3I/ATLAS and provides the dominant local number density of stars.

astro-ph.SR↗

arXiv2024

FreqMark: Invisible Image Watermarking via Frequency Based Optimization in Latent Space

Invisible watermarking is essential for safeguarding digital content, enabling copyright protection and content authentication. However, existing watermarking methods fall short in robustness against regeneration attacks. In this paper, we propose a novel method called FreqMark that involves unconstrained optimization of the image latent frequency space obtained after VAE encoding. Specifically, FreqMark embeds the watermark by optimizing the latent frequency space of the images and then extracts the watermark through a pre-trained image encoder. This optimization allows a flexible trade-off between image quality with watermark robustness and effectively resists regeneration attacks. Experimental results demonstrate that FreqMark offers significant advantages in image quality and robustness, permits flexible selection of the encoding bit number, and achieves a bit accuracy exceeding 90% when encoding a 48-bit hidden message under various attack scenarios.

cs.CR↗