Searcharxiv⌕ Search

arXiv subjects

Yun Wang

Publications and source records attributed to Yun Wang.

At least 55 records · Page 3Linked to original sources

BRIDGE the Gap: Mitigating Bias Amplification in Automated Scoring of English Language Learners via Inter-group Data Augmentation

In the field of educational assessment, automated scoring systems increasingly rely on deep learning and large language models (LLMs). However, these systems face significant risks of bias amplification, where model prediction gaps between student groups become larger than those observed in training data. This issue is especially severe for underrepresented groups such as English Language Learners (ELLs), as models may inherit and further magnify existing disparities in the data. We identify that this issue is closely tied to representation bias: the scarcity of minority (high-scoring ELL) samples makes models trained with empirical risk minimization favor majority (non-ELL) linguistic patterns. Consequently, models tend to under-predict ELL students who even demonstrate comparable domain knowledge but use different linguistic patterns, thereby undermining the fairness of automated scoring outcomes. To mitigate this, we propose BRIDGE, a Bias-Reducing Inter-group Data GEneration framework designed for low-resource assessment settings. Instead of relying on the limited minority samples, BRIDGE synthesizes high-scoring ELL samples by "pasting" construct-relevant (i.e., rubric-aligned knowledge and evidence) content from abundant high-scoring non-ELL samples into authentic ELL linguistic patterns. We further introduce a discriminator model to ensure the quality of synthetic samples. Experiments on California Science Test (CAST) datasets demonstrate that BRIDGE effectively reduces prediction bias for high-scoring ELL students while maintaining overall scoring performance. Notably, our method achieves fairness gains comparable to using additional real human data, offering a cost-effective solution for ensuring equitable scoring in large-scale assessments.

cs.CL↗

Asymptotic stability of Landau solutions to the MHD system and energy decay

We consider the three-dimensional incompressible MHD system. Any weak solution satisfying a strong energy inequality is $L^2$-asymptotically stable around a Landau solution. Under an additional integrability assumption on the initial perturbation, we also obtain an explicit algebraic decay rate for the $L^2$-norm of the velocity and magnetic perturbations.

math.AP↗

Forecasting neutrino mass constraints from the Nancy Grace Roman Space Telescope

We present realistic forecasts for the constraining power of the Nancy Grace Roman Space Telescope on fundamental cosmological parameters, with particular emphasis on the absolute neutrino mass scale, using full-shape analyzes of the galaxy power spectrum. We analyze simulated lightcone mock catalogs of H$α$ emission-line galaxies spanning the redshift range $0.5 < z < 2$ over $2400\ \mathrm{deg}^2$, designed to reproduce the expected properties of the Roman High Latitude Wide Area Spectroscopic Survey. We perform parameter inference on the galaxy power spectrum multipoles using two complementary theoretical frameworks: a model-dependent approach based on the Effective Field Theory of Large-Scale Structure (EFT of LSS) within $Λ$CDM, and a model-independent phenomenological approach that makes no assumptions about the background cosmological model. In the $Λ$CDM analysis, we find $m_ν< 0.380(0.162)\ \mathrm{eV}$ at $95(68)\%$ C.L. using Big Bang Nucleosynthesis (BBN) prior and a broad prior on $n_s$, which tightens to $m_ν< 0.276(0.121)\ \mathrm{eV}$ when Planck priors on $ω_b$, $ω_\mathrm{cdm}$, and $n_s$ are added. Our forecasts show that Roman can additionally constrain $H_0$, $Ω_m$, and $σ_8$ with precisions of $1.3\%$, $4.3\%$, and $2.9\%$ in line with Stage IV galaxy survey measurements and forecasts. In the model-independent analysis, we demonstrate that the phenomenological model can robustly recover unbiased measurements of the angular diameter distance, the Hubble parameter, and the growth of structure across all redshift bins, in the same range of scales as the EFT model, and obtain $m_ν< 0.63(0.36)\ \mathrm{eV}$ at $95(68)\%$ C.L. when Planck priors are included.

astro-ph.CO↗

Using Learning Progressions to Guide AI Feedback for Science Learning

Generative artificial intelligence (AI) offers scalable support for formative feedback, yet most AI-generated feedback relies on task-specific rubrics authored by domain experts. While effective, rubric authoring is time-consuming and limits scalability across instructional contexts. Learning progressions (LP) provide a theoretically grounded representation of students' developing understanding and may offer an alternative solution. This study examines whether an LP-driven rubric generation pipeline can produce AI-generated feedback comparable in quality to feedback guided by expert-authored task rubrics. We analyzed AI-generated feedback for written scientific explanations produced by 207 middle school students in a chemistry task. Two pipelines were compared: (a) feedback guided by a human expert-designed, task-specific rubric, and (b) feedback guided by a task-specific rubric automatically derived from a learning progression prior to grading and feedback generation. Two human coders evaluated feedback quality using a multi-dimensional rubric assessing Clarity, Accuracy, Relevance, Engagement and Motivation, and Reflectiveness (10 sub-dimensions). Inter-rater reliability was high, with percent agreement ranging from 89% to 100% and Cohen's kappa values for estimable dimensions (kappa = .66 to .88). Paired t-tests revealed no statistically significant differences between the two pipelines for Clarity (t1 = 0.00, p1 = 1.000; t2 = 0.84, p2 = .399), Relevance (t1 = 0.28, p1 = .782; t2 = -0.58, p2 = .565), Engagement and Motivation (t1 = 0.50, p1 = .618; t2 = -0.58, p2 = .565), or Reflectiveness (t = -0.45, p = .656). These findings suggest that the LP-driven rubric pipeline can serve as an alternative solution.

cs.CL↗

Model-Independent Analysis of Type Ia Supernova Datasets and Implications for Dark Energy

Recent analyses combining DESI DR2 BAO with CMB and SNe Ia data have reported $2.8$--$4.2σ$ evidence for dynamical dark energy, but the significance depends strongly on the supernova sample, raising the question of whether this signal reflects new physics, dataset-specific systematics, or the choice of dark energy parameterization. We investigate this question by analyzing four SNe Ia compilations (Pantheon, Pantheon+, DES-Dovekie, and Union3) with DESI DR2 BAO and Planck CMB distance priors, using flux averaging, model-independent expansion rate extraction, parametric ($w_0 w_a$CDM) fits, and a non-parametric reconstruction of the dark energy density ratio $X(z) \equiv ρ_{\rm DE}(z)/ρ_{\rm DE}(0)$. Flux averaging reduces the $Ω_m$ difference between SNe and DESI from ${\sim}2σ$ to ${\sim}1σ$ for Pantheon+ and DES-Dovekie. The reconstructed $X(z)$ for DESI DR2 + CMB + SNe is consistent with $Λ$CDM for Pantheon, Pantheon+, and DES-Dovekie except at $0.5<z<1$, consistent with Wang \& Freese (2026). The largest deviation occurs at $z=2/3$, reaching ${\sim}2.7σ$ for Pantheon+ but only $1.6$--$1.7σ$ for Pantheon and DES-Dovekie. The $X(z)$ for DESI DR2 + CMB + Union3 is consistent with these within $1σ$, but shows an additional $2.4σ$ deviation at $z=1/3$ besides the ${\sim}2.7σ$ deviation at $z=2/3$. Across all analyses, the departure from $Λ$CDM correlates with each dataset's $Ω_m$ preference. We demonstrate that a pure $Λ$CDM universe with the measured $Ω_m$ differences can reproduce the observed $X(z)$ pattern, providing a viable alternative interpretation of the observed $X(z) \neq 1$ pattern. Future surveys by Euclid and Roman with sub-percent $Ω_m$ constraints will be essential to determine whether the signal reflects genuine dark energy evolution or residual inter-probe $Ω_m$ inconsistencies.

astro-ph.CO↗

SMFormer: Empowering Self-supervised Stereo Matching via Foundation Models and Data Augmentation

Recent self-supervised stereo matching methods have made significant progress. They typically rely on the photometric consistency assumption, which presumes corresponding points across views share the same appearance. However, this assumption could be compromised by real-world disturbances, resulting in invalid supervisory signals and a significant accuracy gap compared to supervised methods. To address this issue, we propose SMFormer, a framework integrating more reliable self-supervision guided by the Vision Foundation Model (VFM) and data augmentation. We first incorporate the VFM with the Feature Pyramid Network (FPN), providing a discriminative and robust feature representation against disturbance in various scenarios. We then devise an effective data augmentation mechanism that ensures robustness to various transformations. The data augmentation mechanism explicitly enforces consistency between learned features and those influenced by illumination variations. Additionally, it regularizes the output consistency between disparity predictions of strong augmented samples and those generated from standard samples. Experiments on multiple mainstream benchmarks demonstrate that our SMFormer achieves state-of-the-art (SOTA) performance among self-supervised methods and even competes on par with supervised ones. Remarkably, in the challenging Booster benchmark, SMFormer even outperforms some SOTA supervised methods, such as CFNet.

cs.CV↗

Glide-in-Place: Foot-Steered Differential-Drive for Hands-Free VR Locomotion

Seated VR locomotion in constrained environments, including homes, offices, and transit settings, calls for hardware that is lightweight and deployable, steering that remains continuous enough for curved motion, and a control channel that leaves the hands free for concurrent interaction. Inspired by the steering logic of self-balancing scooters, we present Glide-in-Place, a seated foot locomotion system that maps per-foot fore-aft pressure to a differential-drive model: the two feet act as virtual wheels whose relative drive continuously determines translation and yaw. This lets users move forward, rotate in place, and follow arcs in one unified vocabulary without hand-held input or discrete mode switches. We evaluated Glide-in-Place in a counterbalanced within-subject study with 16 participants against two baselines: joystick control and a seated walking-in-place technique with discrete snap motions. Across two steering-heavy navigation tasks, zig-zag path following with multitasking and curved-path traversal, Glide-in-Place was consistently faster than Seated-WIP, reduced physical demand, and lowered fatigue-related discomfort without significantly differing from joystick control on total VRSQ. We position Glide-in-Place as a deployable hardware-control design point for constrained seated VR: thin insole sensing, continuous foot steering, and lightweight calibration packaged in one compact artifact.

cs.HC↗

The Phantom of PCIe: Constraining Generative Artificial Intelligences for Practical Peripherals Trace Synthesizing

Peripheral Component Interconnect Express (PCIe) is the de facto interconnect standard for high-speed peripherals and CPUs. The development of PCIe devices for emerging applications requires realistic Transaction Layer Packet (TLP) traces that accurately simulate device-CPU interactions. While generative AI offers a promising avenue for synthesizing complex TLP sequences, it is prone to a critical challenge inherent in all generation tasks: hallucination. Naively applying these models often produces traces that violate fundamental PCIe protocol rules, such as ordering and causality, rendering them unusable for device simulation. To resolve this, our work introduces a methodology to bridge the gap between generative AI and high-fidelity device simulation. This paper presents Phantom, a framework that systematically addresses AI-generated hallucinations in TLP synthesis. Phantom achieves this by coupling a generative backbone with a novel post-processing filter that enforces PCIe-specific constraints, effectively eliminating invalid TLP sequences. We validate Phantom's effectiveness by synthesizing TLP traces for an actual PCIe network interface card. Experimental results show that Phantom produces practical, large-scale TLP traces, significantly outperforming existing models, with improvements of up to 1000$\times$ in task-specific metrics and up to 2.19$\times$ in Fréchet Inception Distance (FID) compared to backbone-only methods. The prototype implementation has been made open-source.

cs.LG↗

Neutron Star Merger Rates from Multi-messenger Observations: Clues to the Physical Origin of the Short and Long-short Gamma-ray Bursts

Short and long-short gamma-ray bursts (GRBs) are widely believed to be powered by neutron star mergers. In this work, we calculate local rate of such GRBs and find a relatively high value of $\sim 786-2468~{\rm Gpc^{-3}~yr^{-1}}$ when including the very narrow collimation event GRB 061201. Considering that its redshift is not very reliable, after excluding this event, the rate is $\sim 195-666~{\rm Gpc^{-3}~yr^{-1}}$. We also calculate the electromagnetically (EM) bright neutron star merger rate inferred from the LIGO/Virgo/KAGRA observations up to the end of the first epoch of the O4 run, and derive a rate of $\sim 66-347~{\rm Gpc^{-3}~yr^{-1}}$. This rate is somewhat lower than the value obtained from the GRBs, even after excluding GRB 061201. The non-detection of any viable EM bright merger in the O4b and O4c observing runs favors an even lower rate, which starts to challenge the neutron star merger origin of the short and long-short GRBs and may suggest additional contribution from the mergers of other compact object (like the neutron star-white dwarf) binaries, as speculated initially by King et al. (2007) in interpreting the long-short event GRB 060614.

astro-ph.HE↗

Synonymous Codon Usage Bias Overrides Phylogeny to Reflect Convergent Frond Architecture in a Rapidly Radiating Fern Family Thelypteridaceae

Convergent evolution provides powerful evidence for natural selection, yet its molecular basis is typically sought in protein-coding amino acid substitutions. Whether adaptive pressures can drive the convergent evolution of synonymous codon usage bias (CUB) to override phylogenetic history remains a fundamental question. Here, we investigate this within the rapidly radiating fern family Thelypteridaceae by establishing a comparative framework that integrates chloroplast phylogenomics with dimensionality reduction of codon usage, morphological data, and divergence time estimation. Our results reveal that chloroplast CUB patterns are strikingly incongruent with the phylogeny of this family. Instead, they partition species into distinct clusters that strongly correlate with a convergently evolved morphological trait, lamina base architecture, a key adaptation whose radiation we date to the early Neogene. This convergent molecular signal is driven by a specific subset of photosynthesis-related genes (ndhJ, psaA, and psbD), which exhibit a high density of type-specific, third-position codon substitutions. These findings demonstrate that CUB can serve as a powerful, quantifiable indicator of adaptive history, revealing a cryptic layer of molecular convergence linked to the regulation of protein synthesis. Our work providing a new framework for uncovering adaptive histories obscured by complex evolutionary processes.

q-bio.PE↗

Large Scale Spectrophotometric Relative Flux Calibration for the Roman High Latitude Wide Area Survey

We consider the application of a ubercalibration-like relative flux calibration to the grism observations of the Roman High Latitude Wide Area Survey (HLWAS). We propose a simplified model of the calibration with an independent flat field for each detector in each exposure of the focal plane. In addition, we include two wavelength dependent components: a single wavelength throughput curve, modulated by a simple parabolic model for the throughput as a function of a source's focal plane position. We consider the impact of the dither scale, as well as the calibrator magnitude cuts. We show that the width of the calibration residuals can be reduced to less than 1.5 mmag, or 0.15% in flux, within the optimal dither range 50-240". This wide range allows for significant flexibility in optimising other parts of the observing program without diminishing the effectiveness of the relative flux calibration. We also discuss some improvements to the methodology that must be strongly considered before the calibration can be applied to real data. Finally, although we focused on spectroscopic component of the HLWAS here, our formalism and results should carry over to the imaging surveys as well.

astro-ph.IM↗

Turán-type and tiling problems in oriented graphs

Given $a,b,c\in\mathbb N$, let $D_{a,b,c}$ be the tournament on $a+b+c$ vertices obtained by replacing the vertices of the directed triangle $C_3$ with transitive tournaments $TT_a$, $TT_b$, and $TT_c$, respectively. Keevash and Sudakov (2009) showed that every sufficiently large oriented graph $G$ on $n$ vertices with $δ^{0}(G)\geqslant (1/2-o(1))n$ contains a $C_3$-tiling, equivalently a $D_{1,1,1}$-tiling, covering all but at most three vertices. We generalize this result to arbitrary blow-ups $D_{a,b,c}$. Specifically, for any fixed $a,b,c$, every sufficiently large oriented graph $G$ on $n$ vertices with $δ^{0}(G)\geqslant (1/2-o(1))n$ contains a $D_{a,b,c}$-tiling covering all but at most $2(a+b+c)-3$ vertices. Moreover, this bound is essentially sharp. We also establish a stronger stability result: if $(a+b+c)\mid n$, then either $G$ contains a $D_{a,b,c}$-factor, or $G$ is close to an extremal graph. Our interest in $D_{a,b,c}$ is also motivated by oriented Turán theory: a seminal theorem of Bollobás and Häggkvist (1990) shows that a tournament $T$ is Turánable (i.e., contained in every sufficiently large regular tournament) if and only if $T\subseteq D_{s,s,s}$ for some $s$. Complementing our tiling results, we also investigate related semi-degree thresholds for powers of directed cycles and paths. In particular, we present two $n$-vertex constructions that give lower bounds, showing that the minimum semi-degree thresholds for $C^2_l$ with $l\not\equiv 0\pmod 6$ and for $P^2_l$ with $l\geqslant 7$ are at least $4n/9$ and $3n/8$, respectively.

math.CO↗

FAPE-IR: Frequency-Aware Planning and Execution Framework for All-in-One Image Restoration

All-in-One Image Restoration (AIO-IR) aims to develop a unified model that can handle multiple degradations under complex conditions. However, existing methods often rely on task-specific designs or latent routing strategies, making it hard to adapt to real-world scenarios with various degradations. We propose FAPE-IR, a Frequency-Aware Planning and Execution framework for image restoration. It uses a frozen Multimodal Large Language Model (MLLM) as a planner to analyze degraded images and generate concise, frequency-aware restoration plans. These plans guide a LoRA-based Mixture-of-Experts (LoRA-MoE) module within a diffusion-based executor, which dynamically selects high- or low-frequency experts, complemented by frequency features of the input image. To further improve restoration quality and reduce artifacts, we introduce adversarial training and a frequency regularization loss. By coupling semantic planning with frequency-based restoration, FAPE-IR offers a unified and interpretable solution for all-in-one image restoration. Extensive experiments show that FAPE-IR achieves state-of-the-art performance across seven restoration tasks and exhibits strong zero-shot generalization under mixed degradations.

cs.CV↗

Video-EM: Event-Centric Episodic Memory for Long-Form Video Understanding

Video Large Language Models (Video-LLMs) have shown strong video understanding, yet their application to long-form videos remains constrained by limited context windows. A common workaround is to compress long videos into a handful of representative frames via retrieval or summarization. However, most existing pipelines score frames in isolation, implicitly assuming that frame-level saliency is sufficient for downstream reasoning. This often yields redundant selections, fragmented temporal evidence, and weakened narrative grounding for long-form video question answering. We present \textbf{Video-EM}, a training-free, event-centric episodic memory framework that reframes long-form VideoQA as \emph{episodic event construction} followed by \emph{memory refinement}. Instead of treating retrieved keyframes as independent visuals, Video-EM employs an LLM as an active memory agent to orchestrate off-the-shelf tools: it first localizes query-relevant moments via multi-grained semantic matching, then groups and segments them into temporally coherent events, and finally encodes each event as a grounded episodic memory with explicit temporal indices and spatio-temporal cues (capturing \emph{when}, \emph{where}, \emph{what}, and involved entities). To further suppress verbosity and noise from imperfect upstream signals, Video-EM integrates a reasoning-driven self-reflection loop that iteratively verifies evidence sufficiency and cross-event consistency, removes redundancy, and adaptively adjusts event granularity. The outcome is a compact yet reliable \emph{event timeline} -- a minimal but sufficient episodic memory set that can be directly consumed by existing Video-LLMs without additional training or architectural changes.

cs.CV↗

ELHPlan: Efficient Long-Horizon Task Planning for Multi-Agent Collaboration

Large Language Models (LLMs) enable intelligent multi-robot collaboration but face fundamental trade-offs: open-loop methods that compile tasks into formal representations for external executors produce sound plans but lack adaptability in partially observable environments, while iterative methods incur prohibitive computational costs that scale poorly with team size and task complexity. In this paper, we propose Efficient Long-Horizon Planning (ELHPlan), a novel framework that introduces Action Chains, sequences of actions explicitly bound to sub-goal intentions, as the fundamental planning primitive. ELHPlan operates via a cyclical process: 1) constructing intention-bound action sequences, 2) proactively validating for conflicts and feasibility, 3) refining issues through targeted mechanisms, and 4) executing validated actions. This design balances adaptability and efficiency by providing intention-bound action sequences with longer lookahead while avoiding expensive full re-planning. We further advocate comprehensive efficiency metrics, including token consumption and planning time, to more holistically evaluate multi-agent collaboration. Our experiments on benchmarks TDW-MAT and C-WAH demonstrate that ELHPlan achieves comparable task success rates while consuming only 30-40% of the tokens required by state-of-the-art methods. Our research establishes a new efficiency-effectiveness frontier for LLM-based multi-agent planning systems.

cs.AI↗

InfoAlign: A Human-AI Co-Creation System for Storytelling with Infographics

Storytelling infographics are a powerful medium for communicating data-driven stories through visual presentation. However, existing authoring tools lack support for maintaining story consistency and aligning with users' story goals throughout the design process. To address this gap, we conducted formative interviews and a quantitative analysis to identify design needs and common story-informed layout patterns in infographics. Based on these insights, we propose a narrative-centric workflow for infographic creation consisting of three phases: story construction, visual encoding, and spatial composition. Building on this workflow, we developed InfoAlign, a human-AI co-creation system that transforms long or unstructured text into stories, recommends semantically aligned visual designs, and generates layout blueprints. Users can intervene and refine the design at any stage, ensuring their intent is preserved and the infographic creation process remains transparent. Evaluations show that InfoAlign preserves story coherence across authoring stages and effectively supports human-AI co-creation for storytelling infographic design.

cs.HC↗

A Benchmark Analysis of Graph and Non-Graph Methods for Caenorhabditis Elegans Neuron Classification

This study establishes a benchmark for Caenorhabditis elegans neuron classification, comparing four graph methods (GCN, GraphSAGE, GAT, GraphTransformer) against four non-graph methods (Logistic Regression, MLP, LOLCAT, NeuPRINT). Using the functional connectome, we classified Sensory, Interneuron, and Motor neurons based on Spatial, Connection, and Neuronal Activity features. Results show that attention-based GNNs significantly outperform baselines on the Spatial and Connection features. The Neuronal Activity features yielded poor performance, likely due to the low temporal resolution of the underlying neuronal activity data. Our benchmark validates the use of GNNs and highlights that Spatial and Connection features are key predictors for Caenorhabditis elegans neuron classes. Code is available at: https://github.com/JingqiLuu/neuronclf-gnn-benchmark.

q-bio.NC↗

Scaling Speech Tokenizers with Diffusion Autoencoders

Speech tokenizers are foundational to speech language models, yet existing approaches face two major challenges: (1) balancing trade-offs between encoding semantics for understanding and acoustics for reconstruction, and (2) achieving low bit rates and low token rates. We propose Speech Diffusion Tokenizer (SiTok), a diffusion autoencoder that jointly learns semantic-rich representations through supervised learning and enables high-fidelity audio reconstruction with diffusion. We scale SiTok to 1.6B parameters and train it on 2 million hours of speech. Experiments show that SiTok outperforms strong baselines on understanding, reconstruction and generation tasks, at an extremely low token rate of $12.5$ Hz and a bit-rate of 200 bits-per-second.

cs.SD↗