arXiv subjects

Tao Wang

Publications and source records attributed to Tao Wang.

At least 217 records · Page 12Linked to original sources

arXiv2025

Some existence and uniqueness results for infinity Laplace equations on infinite graphs

We study the Dirichlet problem of the following discrete infinity Laplace equation on unbounded subgraphs \begin{equation*} Δ_{\infty}u(x):=\inf_{y\sim x}u(y)+\sup_{y\sim x}u(y)-2u(x)=f(x). \end{equation*} For the homogeneous case ($f=0$), the existence and uniqueness of sublinear solutions are established. This result is applied to prove the existence and uniqueness of sublinear solutions for the homogeneous (normalized) infinity Laplace equations on unbounded Euclidean domains. Uniqueness is also shown for the case $f \geq 0$ on trees.

math.AP↗

arXiv2025

ScribbleVS: Scribble-Supervised Medical Image Segmentation via Dynamic Competitive Pseudo Label Selection

In clinical medicine, precise image segmentation can provide substantial support to clinicians. However, obtaining high-quality segmentation typically demands extensive pixel-level annotations, which are labor-intensive and expensive. Scribble annotations offer a more cost-effective alternative by improving labeling efficiency. Nonetheless, using such sparse supervision for training reliable medical image segmentation models remains a significant challenge. Some studies employ pseudo-labeling to enhance supervision, but these methods are susceptible to noise interference. To address these challenges, we introduce ScribbleVS, a framework designed to learn from scribble annotations. We introduce a Regional Pseudo Labels Diffusion Module to expand the scope of supervision and reduce the impact of noise present in pseudo labels. Additionally, we introduce a Dynamic Competitive Selection module for enhanced refinement in selecting pseudo labels. Experiments conducted on the ACDC, MSCMRseg, WORD, and BraTS2020 datasets demonstrate promising results, achieving segmentation precision comparable to fully supervised models. The codes of this study are available at https://github.com/ortonwang/ScribbleVS.

cs.CV↗

arXiv2025

SALS: Sparse Attention in Latent Space for KV cache Compression

Large Language Models capable of handling extended contexts are in high demand, yet their inference remains challenging due to substantial Key-Value cache size and high memory bandwidth requirements. Previous research has demonstrated that KV cache exhibits low-rank characteristics within the hidden dimension, suggesting the potential for effective compression. However, due to the widely adopted Rotary Position Embedding mechanism in modern LLMs, naive low-rank compression suffers severe accuracy degradation or creates a new speed bottleneck, as the low-rank cache must first be reconstructed in order to apply RoPE. In this paper, we introduce two key insights: first, the application of RoPE to the key vectors increases their variance, which in turn results in a higher rank; second, after the key vectors are transformed into the latent space, they largely maintain their representation across most layers. Based on these insights, we propose the Sparse Attention in Latent Space framework. SALS projects the KV cache into a compact latent space via low-rank projection, and performs sparse token selection using RoPE-free query-key interactions in this space. By reconstructing only a small subset of important tokens, it avoids the overhead of full KV cache reconstruction. We comprehensively evaluate SALS on various tasks using two large-scale models: LLaMA2-7b-chat and Mistral-7b, and additionally verify its scalability on the RULER-128k benchmark with LLaMA3.1-8B-Instruct. Experimental results demonstrate that SALS achieves SOTA performance by maintaining competitive accuracy. Under different settings, SALS achieves 6.4-fold KV cache compression and 5.7-fold speed-up in the attention operator compared to FlashAttention2 on the 4K sequence. For the end-to-end throughput performance, we achieves 1.4-fold and 4.5-fold improvement compared to GPT-fast on 4k and 32K sequences, respectively.

cs.LG↗

arXiv2025

LEGO: A Lightweight and Efficient Multiple-Attribute Unlearning Framework for Recommender Systems

With the growing demand for safeguarding sensitive user information in recommender systems, recommendation attribute unlearning is receiving increasing attention. Existing studies predominantly focus on single-attribute unlearning. However, privacy protection requirements in the real world often involve multiple sensitive attributes and are dynamic. Existing single-attribute unlearning methods cannot meet these real-world requirements due to i) CH1: the inability to handle multiple unlearning requests simultaneously, and ii) CH2: the lack of efficient adaptability to dynamic unlearning needs. To address these challenges, we propose LEGO, a lightweight and efficient multiple-attribute unlearning framework. Specifically, we divide the multiple-attribute unlearning process into two steps: i) Embedding Calibration removes information related to a specific attribute from user embedding, and ii) Flexible Combination combines these embeddings into a single embedding, protecting all sensitive attributes. We frame the unlearning process as a mutual information minimization problem, providing LEGO a theoretical guarantee of simultaneous unlearning, thereby addressing CH1. With the two-step framework, where Embedding Calibration can be performed in parallel and Flexible Combination is flexible and efficient, we address CH2. Extensive experiments on three real-world datasets across three representative recommendation models demonstrate the effectiveness and efficiency of our proposed framework. Our code and appendix are available at https://github.com/anonymifish/lego-rec-multiple-attribute-unlearning.

cs.LG↗

arXiv2025

Adaptive Convolutional Neural Network for Image Super-resolution

Convolutional neural networks can automatically learn features via deep network architectures and given input samples. However, the robustness of obtained models may face challenges in varying scenes. Bigger differences in network architecture are beneficial to extract more diversified structural information to strengthen the robustness of an obtained super-resolution model. In this paper, we proposed a adaptive convolutional neural network for image super-resolution (ADSRNet). To capture more information, ADSRNet is implemented by a heterogeneous parallel network. The upper network can enhance relation of context information, salient information relation of a kernel mapping and relations of shallow and deep layers to improve performance of image super-resolution. That can strengthen adaptability of an obtained super-resolution model for different scenes. The lower network utilizes a symmetric architecture to enhance relations of different layers to mine more structural information, which is complementary with a upper network for image super-resolution. The relevant experimental results show that the proposed ADSRNet is effective to deal with image resolving. Codes are obtained at https://github.com/hellloxiaotian/ADSRNet.

eess.IV↗

arXiv2025

The Bigfoot: A footprint of a Coma cluster progenitor at z=3.98

Protoclusters, galaxy clusters' high redshift progenitors, hold the keys to understanding the formation and evolution of clusters and their member galaxies. However, their cosmological distances and spatial extensions (tens of Mpc) have inhibited complete mapping of their structure and constituent galaxies, which is key to robustly linking protoclusters to their descendants. Here we report the discovery of the Bigfoot, a tridimensional structure at $z = 3.98$ including 11 subgroups traced by 55 (700) spectroscopic (photometric) redshifts with JWST, extending over $15\times 37$ $\times 49{\rm{cMpc^3}}$ in the PRIMER-UDS field. Bigfoot's large-scale and mass function of member galaxies closely match constrained simulations' predictions for the progenitors of today's most massive clusters (${M_0} > 10^{15} {M_{_ \odot }}$). All subgroups with ${M_{\rm{h}}} > {10^{12.5}}{M_{_ \odot }}$ exhibit enhanced fractions of massive galaxies ($>{10^{10.0} {M_{_ \odot }}}$) compared to lower-mass halos and the field, demonstrating the accelerated formation of massive galaxies in massive halos. The presence of this massive protocluster with a large central halo (${10^{13.0} {M_{_ \odot }}}$) in a JWST deep field bears important cosmological implication that favors high ${σ_8}$ of PLANCK cosmology over low-redshift probes.

astro-ph.GA↗

arXiv2025

K-frames: Scene-Driven Any-k Keyframe Selection for long video understanding

Multimodal Large Language Models (MLLMs) have demonstrated significant capabilities in image understanding, but long-video are constrained by context windows and computational cost. Uniform frame sampling often leads to substantial information loss. Meanwhile existing keyframe selection methods such as text-frame retrieval or RL-based frame optimization typically yield sparse and temporally disjointed frames, overlooking scene continuity and lacking flexibility for multi-scale frame selection. To address these limitations, we introduce K-frames, a novel paradigm for scene-driven keyframe selection that preserves temporal continuity. Instead of selecting individual frames, K-frames predicts semantically coherent, query-relevant clips, which enables any-k keyframes selection to meet diverse user budgets. To achieve this approach, we first introduce PeakClips, a dataset of 200K video highlights conditioned by query. Building on this dataset, K-frames learns clip2frame selection using a three-stage progressive curriculum. It involves two Supervised Fine-Tuning stages for temporal grounding and key-clip perception, followed by a Reinforcement Learning stage that directly optimizes the scene-driven prediction policy for downstream task without further annotations. Extensive experiments on major long-video understanding benchmarks demonstrate that K-frames provides an effective, interpretable, and plug-and-play solution for keyframe selection at various scales. Our dataset and model will be available.

cs.LG↗

arXiv2025

Warm absorber outflows in radio-loud active galactic nucleus 3C~59

Both jets and ionized outflows in active galactic nuclei (AGNs) are thought to play important roles in affecting the star formation and evolution of host galaxies, but their relationship is still unclear. As a pilot study, we performed a detailed spectral analysis for a radio-loud (RL) AGN 3C~59 ($z=0.1096$) by systematically considering various factors that may affect the fitting results, and thereby establishing a general spectral fitting strategy for subsequent research with larger sample. 3C~59 is one rare target for simultaneously studying jets and warm absorbers (WAs) that is one type of ionized outflows. Based on the multi-wavelength data from near-infrared (NIR) to hard X-ray bands detected by DESI, GALEX, and XMM-Newton, we used SPEX code to build broadband continuum models and perform photoionization modeling with PION code to constrain the physical parameters of WAs in 3C~59. We found two WAs with ionization parameter of $\log [ξ/(\rm{erg\ cm\ s}^{-1})] = 2.65^{+0.10}_{-0.09}$ and $1.65\pm 0.11$, respectively, and their outflowing velocities are $v_{\rm out} = -528^{+163}_{-222}\ \rm{km\ s}^{-1}$ and $-228^{+121}_{-122}\ \rm{km\ s}^{-1}$, respectively. These WAs are located between outer torus and narrow (emission-)line region, and their positive $v_{\rm out}$-$ξ$ relation can be explained by the radiation-pressure-driven mechanism. We found that the estimations of these physical properties are affected by the different spectral fitting strategies, such as the inclusion of NIR to ultra-violet data, the choice of energy range of spectrum, or the composition of the spectral energy distribution. Based on the same fitting strategy, this work presents a comparative study of outflow driven mechanism between a RL AGN (3C 59) and a radio-quiet AGN (NGC 3227), which suggests a similar driven mechanism of their WA outflows and a negligible role of jets in this process.

astro-ph.GA↗

arXiv2025

MedAgentGym: A Scalable Agentic Training Environment for Code-Centric Reasoning in Biomedical Data Science

We introduce MedAgentGym, a scalable and interactive training environment designed to enhance coding-based biomedical reasoning capabilities in large language model (LLM) agents. MedAgentGym comprises 72,413 task instances across 129 categories derived from 12 authentic real-world biomedical scenarios. Tasks are encapsulated within executable sandbox environments, each featuring detailed task specifications, interactive feedback mechanisms, verifiable ground truth annotations, and scalable training trajectory generation. Extensive benchmarking of 29 LLMs reveals substantial performance disparities in biomedical data science between commercial and open-source LLMs. Leveraging efficient multi-threaded and multi-turn trajectory sampling in MedAgentGym, Med-Copilot achieves performance gains of +43.02% and +45.28% from offline and online reinforcement learning, respectively, demonstrating MedAgentGym as an effective training ground while establishing itself as a cost-effective, privacy-preserving alternative competitive with proprietary LLMs (gpt-4o). By offering a unified execution environment with a comprehensive benchmark and accessible, extensible training resources, MedAgentGym delivers an integrated platform to develop LLM-based coding assistants for advanced biomedical data science.

cs.CL↗

arXiv2025

Cryogenic pressure sensing with an ultrafast Meissner-levitated microrotor

Magnetically levitated spinning rotors are key elements in important technologies such as navigation by gyroscopes, energy storage by flywheels, ultra-high vacuum generation by turbomolecular pumps, and pressure sensing for process control. However, mechanical rotors are typically macroscopic and limited to room temperature and low rotation frequencies. In particular, sensing pressure at low temperatures remains a technological challenge, while emerging quantum technologies demand a precise evaluation of pressure conditions at low temperatures to cope with quantum-spoiling decoherence. To close this gap, we demonstrate wide range pressure sensing by a spinning rotor based on a micromagnet levitated by the Meissner effect at 4.2 Kelvin. We achieve rotational speeds of up to 138 million rotations per minute, resulting in very high effective quality factors, outperforming current platforms. Beside sensing applications, we envision the use of levitated rotors for probing fundamental science including quantum mechanics and gravity, enabled by ultralow torque noise.

quant-ph↗

arXiv2025

SHAPE. I. A SOM-SED hybrid approach for efficient galaxy parameter estimation leveraging JWST

With the launch and application of next-generation ground- and space-based telescopes, astronomy has entered the era of big data, necessitating more efficient and robust data analysis methods. Most traditional parameter estimation methods are unable to reconcile differences between photometric systems. Ideally, we would like to optimally rely on high-quality observation data provided by, e.g., JWST, for calibrating and improving upcoming wide-field surveys such as the China Space Station Telescope (CSST) and Euclid. To this end, we introduce a new approach (SHAPE, SOM-SED Hybrid Approach for efficient Parameter Estimation) that can bridge different photometric systems and efficiently estimate key galaxy parameters, such as stellar mass ($M_\star$) and star formation rate (SFR), leveraging data from a large and deep JWST/NIRCam and MIRI survey (PRIMER). As a test of the methodology, we focus on galaxies at $z\sim 1.5-2.5$. To mitigate discrepancies between input colors and the training set, we replace the default SOM weights with stacked SEDs from each cell, extending the applicability of our model to other photometric catalogs (e.g., COSMOS2020). By incorporating a SED library (SED Lib), we apply this JWST-calibrated model to the COSMOS2020 catalog. Despite the limited sample size and potential template-related uncertainties, SOM-derived parameters exhibit a good agreement with results from SED-fitting using extended photometry. Under identical photometric constraints from CSST and Euclid bands, our method outperforms traditional SED-fitting techniques in SFR estimation, exhibiting both a reduced bias (-0.01 vs. 0.18) and a smaller $σ_{\rm NMAD}$ (0.25 vs. 0.35). With its computational efficiency capable of processing $10^6$ sources per CPU per hour during the estimation phase, this JWST-calibrated estimator holds significant promise for next-generation wide-field surveys.

astro-ph.GA↗

arXiv2025

Gaussian Herding across Pens: An Optimal Transport Perspective on Global Gaussian Reduction for 3DGS

3D Gaussian Splatting (3DGS) has emerged as a powerful technique for radiance field rendering, but it typically requires millions of redundant Gaussian primitives, overwhelming memory and rendering budgets. Existing compaction approaches address this by pruning Gaussians based on heuristic importance scores, without global fidelity guarantee. To bridge this gap, we propose a novel optimal transport perspective that casts 3DGS compaction as global Gaussian mixture reduction. Specifically, we first minimize the composite transport divergence over a KD-tree partition to produce a compact geometric representation, and then decouple appearance from geometry by fine-tuning color and opacity attributes with far fewer Gaussian primitives. Experiments on benchmark datasets show that our method (i) yields negligible loss in rendering quality (PSNR, SSIM, LPIPS) compared to vanilla 3DGS with only 10% Gaussians; and (ii) consistently outperforms state-of-the-art 3DGS compaction techniques. Notably, our method is applicable to any stage of vanilla or accelerated 3DGS pipelines, providing an efficient and agnostic pathway to lightweight neural rendering. The code is publicly available at https://github.com/DrunkenPoet/GHAP

cs.CV↗

arXiv2025

Scientific Objectives of the Xue-shan-mu-chang 15-meter Submillimeter Telescope

Submillimeter astronomy is poised to revolutionize our understanding of the Universe by revealing cosmic phenomena hidden from optical and near-infrared observations, particularly those associated with interstellar dust, molecular gas, and star formation. The Xue-shan-mu-chang 15-meter submillimeter telescope (XSMT-15m), to be constructed at a premier high-altitude site (4813 m) in Qinghai, China, marks a major milestone for Chinese astronomy, establishing the China mainland's first independently developed, world-class submillimeter facility. Equipped with state-of-the-art instruments, XSMT-15m will address a diverse range of frontier scientific questions spanning extragalactic astronomy, Galactic structure, time-domain astrophysics, and astrochemistry. In synergy with current and forthcoming observatories, XSMT-15m will illuminate the formation and evolution of galaxies, unravel the physical and chemical processes shaping the interstellar medium, and explore transient phenomena in the submillimeter regime. These capabilities will advance our understanding across extragalactic astronomy, Galactic ecology, astrochemistry, and time-domain astrophysics, inaugurating a new era for submillimeter research in China and the northern hemisphere.

astro-ph.GA↗

arXiv2025

Claw-free cubic graphs are (1, 1, 1, 3)-packing edge-colorable

For a non-decreasing positive integer sequence $S = (s_{1}, \dots, s_{k})$, an $S$-packing edge-coloring of a graph $G$ is a partition of the edge set of $G$ into subsets $E_{1}, \dots, E_{k}$ such that for each $1 \leq i \leq k$, the distance between any two distinct edges $e_{1}, e_{2} \in E_{i}$ is at least $s_{i} + 1$. Gastineau and Togni conjectured that cubic graphs, except the Petersen and Tietze graphs, admit $(1, 1, 1, 3)$-packing edge-colorings. In this paper, we prove that every claw-free cubic graph admits such a coloring.

math.CO↗

arXiv2025

Make Identity Unextractable yet Perceptible: Synthesis-Based Privacy Protection for Subject Faces in Photos

Deep learning-based face recognition (FR) technology exacerbates privacy concerns in photo sharing. In response, the research community developed a suite of anti-FR methods to block identity extraction by unauthorized FR systems. Benefiting from quasi-imperceptible alteration, perturbation-based methods are well-suited for privacy protection of subject faces in photos, as they allow familiar persons to recognize subjects via naked eyes. However, we reveal that perturbation-based methods provide a false sense of privacy through theoretical analysis and experimental validation. Therefore, new alternative solutions should be found to protect subject faces. In this paper, we explore synthesis-based methods as a promising solution, whose challenge is to enable familiar persons to recognize subjects. To solve the challenge, we present a key insight: In most photo sharing scenarios, familiar persons recognize subjects through identity perception rather than meticulous face analysis. Based on the insight, we propose the first synthesis-based method dedicated to subject faces, i.e., PerceptFace, which can make identity unextractable yet perceptible. To enhance identity perception, a new perceptual similarity loss is designed for faces, reducing the alteration in regions of high sensitivity to human vision. As a synthesis-based method, PerceptFace can inherently provide reliable identity protection. Meanwhile, out of the confine of meticulous face analysis, PerceptFace focuses on identity perception from a more practical scenario, which is also enhanced by the designed perceptual similarity loss. Sufficient experiments show that PerceptFace achieves a superior trade-off between identity protection and identity perception compared to existing methods. We provide a public API of PerceptFace and believe that it has great potential to become a practical anti-FR tool.

cs.CR↗

arXiv2025

SU(3) rigid triaxiality in $^{154}$Sm

The $^{154}$Sm nucleus, which has long been regarded as a typical quantum system exhibiting axial symmetry, has been recently suggested to exhibit a small degree of triaxiality by Otsuka \textit{et al.}. This small triaxiality was recently observed using the $γ$ decay of the $^{154}$Sm isovector giant dipole resonance. Thus further studying this small triaxiality is very necessary for understanding the nature of the collectivity in nuclei. In this paper, the rigid triaxiality in $^{154}$Sm is investigated using the newly proposed SU3-IBM theory. If the irreducible representation (irrep) of the ground state is (18,2) in the SU(3) symmetry limit, the new model can effectively reproduce the experimental data of $^{154}$Sm, showing good agreements with realistic energy spectra, B(E2) values, and quadrupole moments. This result further confirms the vality of the SU3-IBM for the description of the rigid triaxiality in realistic nuclei, and reveals the SU(3) dominance of the collectivity motions in nuclei.

nucl-th↗

arXiv2025

Typical new spherical-like $γ$-soft spectra in $^{104,106,108}$Pd

To solve the Cd puzzle (spherical nucleus puzzle), I have proposed a new spherical-like $γ$-soft nucleus. Since shape coexistence often occurs in such nuclei, explicit spherical-like $γ$-soft spectra are not easily identified. In this paper, I finally find the direct evidence for the existence of the new spherical-like $γ$-soft nucleus. $^{106}$Pd is in fact a typical spherical-like $γ$-soft nucleus. The low-lying parts, up to the $10_{1}^{+}$ state, under 4000 keV, of the spherical-like $γ$-soft spectra are verified. The B(E2) values and the quadrupole moments of the low-lying levels are also studied. By comparison, the new spherical-like $γ$-soft mode is confirmed. Moreover $^{104,108}$Pd are also discussed. These results completely disprove the possibility of the phonon excitations of the spherical nucleus in the Cd-Pd nuclei region.

nucl-th↗

arXiv2025

$B(E2;2^{+}_{1}\rightarrow0^{+}_{1})$ anomaly in $^{166}$Os

Recently, the very small $B(E2;2_{1}^{+}\rightarrow0_{1}^{+})$ value was found in $^{166}$Os, which is 7(4) W.u. \textbf{and} much smaller than the values of adjacent nuclei $^{168,170}$Os, 74(13) W.u. and 97(9) W.u.. With the help of a new technique ``SU(3) analysis" and a new explanatory framework of the B(E2) anomaly, it was found that, the $B(E2;2_{1}^{+}\rightarrow0_{1}^{+})$ anomaly really can exist. In this paper, we discuss the $B(E2;2_{1}^{+}\rightarrow0_{1}^{+})$ anomaly in $^{166}$Os for the first time. Four results are used to fit the experimental data in $^{166,168,170}$Os successfully. This implies that the level-crossing or level-anticrossing explanation is more reasonable.

nucl-th↗