arXiv subjects

Jie Wang

Publications and source records attributed to Jie Wang.

At least 199 records · Page 11Linked to original sources

arXiv2025

Nonlinear reconstruction of general dark energy theories

The large variety and number of dark energy (DE) theories make it impractical to perform detailed analyses on a case-by-case basis, which has motivated proposals to ``parameterize" theories to reduce the size of theory space. The leading approach to do this is the effective field theory of dark energy (EFTofDE), which can describe general Horndeski-type theories with a small number of observationally accessible time-dependent functions. However, the EFTofDE primarily works for linear perturbations, and extending it to obtain a fully non-linear description of DE theories, which is critical for theories with screening mechanisms, is challenging. In this paper, we present a general method for reconstructing the non-linear DE Lagrangian from the background expansion history and certain linear-perturbation quantities, building upon the EFTofDE framework. Using numerical examples, we demonstrate that this method is applicable to a wide range of single-scalar-field dark energy and modified gravity theories, including quintessence, scalar-tensor theory, $k$-essence, and generalized cubic Galileon with shift symmetry. For each of these theories, we discuss the validity of the method and factors affecting its results. While this method involves solving differential equations, we find that the initial conditions are not important for quintessence, scalar-tensor theory and $k$-essence, while for shift-symmetric cubic Galileon, the generic tracker solution can help transform differential equations into algebraic equations. This offers a useful framework to connect cosmological observations at the background and linear-perturbation levels to the underlying non-linear dynamics of dark energy, and will enable cosmological simulations to analyze and examine DE theories systematically and in much greater detail.

astro-ph.CO↗

arXiv2025

Deep Learning for Personalized Binaural Audio Reproduction

Personalized binaural audio reproduction is the basis of realistic spatial localization, sound externalization, and immersive listening, directly shaping user experience and listening effort. This survey reviews recent advances in deep learning for this task and organizes them by generation mechanism into two paradigms: explicit personalized filtering and end-to-end rendering. Explicit methods predict personalized head-related transfer functions (HRTFs) from sparse measurements, morphological features, or environmental cues, and then use them in the conventional rendering pipeline. End-to-end methods map source signals directly to binaural signals, aided by other inputs such as visual, textual, or parametric guidance, and they learn personalization within the model. We also summarize the field's main datasets and evaluation metrics to support fair and repeatable comparison. Finally, we conclude with a discussion of key applications enabled by these technologies, current technical limitations, and potential research directions for deep learning-based spatial audio systems.

eess.AS↗

arXiv2025

BudgetThinker: Empowering Budget-aware LLM Reasoning with Control Tokens

Recent advancements in Large Language Models (LLMs) have leveraged increased test-time computation to enhance reasoning capabilities, a strategy that, while effective, incurs significant latency and resource costs, limiting their applicability in real-world time-constrained or cost-sensitive scenarios. This paper introduces BudgetThinker, a novel framework designed to empower LLMs with budget-aware reasoning, enabling precise control over the length of their thought processes. We propose a methodology that periodically inserts special control tokens during inference to continuously inform the model of its remaining token budget. This approach is coupled with a comprehensive two-stage training pipeline, beginning with Supervised Fine-Tuning (SFT) to familiarize the model with budget constraints, followed by a curriculum-based Reinforcement Learning (RL) phase that utilizes a length-aware reward function to optimize for both accuracy and budget adherence. We demonstrate that BudgetThinker significantly surpasses strong baselines in maintaining performance across a variety of reasoning budgets on challenging mathematical benchmarks. Our method provides a scalable and effective solution for developing efficient and controllable LLM reasoning, making advanced models more practical for deployment in resource-constrained and real-time environments.

cs.LG↗

arXiv2025

Giant Anomalous Hall Conductivity and Gilbert Damping in Room-temperature Ferromagnetic Half-Heusler Alloys PtMnBi

Half-Heusler alloys have emerged as promising candidates for novel spintronic applications due to their exceptional properties including the high Curie temperature (TC) above room temperature and large anomalous Hall conductivity (AHC). In this work, we systematically study the magnetic and electronic properties of PtMnBi in α-, \{beta}-, and γ-phase using first-principles calculations and Monte Carlo simulations. The three phases are found to be ferromagnetic metals. In particular, the α-phase PtMnBi shows a high TC up to 802 K and a relatively large Gilbert damping of 0.085. Additionally, the γ-phase PtMnBi possesses a non-negligible AHC, reaching 203 Ω-1cm-1 at the Fermi level. To evaluate its potential in nanoscale devices, we further investigate the α-phase PtMnBi thin films. The Gilbert dampings of α-phase PtMnBi thin films varies with film thickness and we attribute this variation to the distinct band structures at the high-symmetry point Γ, which arise from differences in film thickness. Moreover, the 1-layer (1L) α-phase thin film retains robust ferromagnetism (TC = 688 K) and shows enhanced Gilbert damping (0.14) and AHC (1116 Ω-1cm-1) compared to the bulk. Intriguingly, under a 2% in-plane biaxial compressive strain, the Gilbert damping of 1L α-phase PtMnBi thin film increases to 0.17 and the AHC reaches 2386 Ω-1cm-1. The coexistence of giant Gilbert damping and large AHC makes α-phase PtMnBi a compelling platform for practical spintronic applications, and highlights the potential of half-Heusler alloys in spintronic device design.

cond-mat.mtrl-sci↗

arXiv2025

CURE: Critical-Token-Guided Re-Concatenation for Entropy-Collapse Prevention

Recent advances in Reinforcement Learning with Verified Reward (RLVR) have driven the emergence of more sophisticated cognitive behaviors in large language models (LLMs), thereby enhancing their reasoning capabilities. However, in prior RLVR pipelines, the repeated use of static initial-state sampling drawn exactly from the dataset distribution during each sampling phase produced overly deterministic, low diversity model behavior, which manifested as rapid entropy collapse and hindered sustained performance gains during prolonged training. To address this issue, we introduce CURE (Critical-token-gUided Re concatenation for Entropy-collapse prevention), a two-stage framework that balances exploration and exploitation. Specifically, in the first stage, to deliberately steer the model toward novel yet coherent contexts, we re-generate at high-entropy critical tokens and jointly optimize the original and the branched trajectories. The further comparison with vanilla DAPO shows that the regeneration process achieves a better performance on math reasoning tasks while sustaining a high-level entropy degree for exploration. In the second stage, we continue training with static initial-state sampling by DAPO, intentionally placing the model in a familiar state to gradually strengthen exploitation. Extensive experiments on Qwen-2.5-Math-7B show that, compared to other RLVR methods, CURE achieves a 5% performance gain across six math benchmarks, establishing state-of-the-art performance in both entropy and accuracy. A series of experiments further validate the effectiveness of our approach. Code is available at https://github.com/bytedance/CURE.

cs.LG↗

arXiv2025

MeshCoder: LLM-Powered Structured Mesh Code Generation from Point Clouds

Reconstructing 3D objects into editable programs is pivotal for applications like reverse engineering and shape editing. However, existing methods often rely on limited domain-specific languages (DSLs) and small-scale datasets, restricting their ability to model complex geometries and structures. To address these challenges, we introduce MeshCoder, a novel framework that reconstructs complex 3D objects from point clouds into editable Blender Python scripts. We develop a comprehensive set of expressive Blender Python APIs capable of synthesizing intricate geometries. Leveraging these APIs, we construct a large-scale paired object-code dataset, where the code for each object is decomposed into distinct semantic parts. Subsequently, we train a multimodal large language model (LLM) that translates 3D point cloud into executable Blender Python scripts. Our approach not only achieves superior performance in shape-to-code reconstruction tasks but also facilitates intuitive geometric and topological editing through convenient code modifications. Furthermore, our code-based representation enhances the reasoning capabilities of LLMs in 3D shape understanding tasks. Together, these contributions establish MeshCoder as a powerful and flexible solution for programmatic 3D shape reconstruction and understanding. The project homepage is available at \href{https://daibingquan.github.io/MeshCoder}{this link}.

cs.GR↗

arXiv2025

We-Math 2.0: A Versatile MathBook System for Incentivizing Visual Mathematical Reasoning

Multimodal Large Language Models (MLLMs) have demonstrated impressive capabilities across various tasks, but still struggle with complex mathematical reasoning. Existing research primarily focuses on dataset construction and method optimization, often overlooking two critical aspects: comprehensive knowledge-driven design and model-centric data space modeling. In this paper, we introduce We-Math 2.0, a unified system that integrates a structured mathematical knowledge system, model-centric data space modeling, and a reinforcement learning (RL)-based training paradigm to comprehensively enhance the mathematical reasoning abilities of MLLMs. The key contributions of We-Math 2.0 are fourfold: (1) MathBook Knowledge System: We construct a five-level hierarchical system encompassing 491 knowledge points and 1,819 fundamental principles. (2) MathBook-Standard & Pro: We develop MathBook-Standard, a dataset that ensures broad conceptual coverage and flexibility through dual expansion. Additionally, we define a three-dimensional difficulty space and generate 7 progressive variants per problem to build MathBook-Pro, a challenging dataset for robust training. (3) MathBook-RL: We propose a two-stage RL framework comprising: (i) Cold-Start Fine-tuning, which aligns the model with knowledge-oriented chain-of-thought reasoning; and (ii) Progressive Alignment RL, leveraging average-reward learning and dynamic data scheduling to achieve progressive alignment across difficulty levels. (4) MathBookEval: We introduce a comprehensive benchmark covering all 491 knowledge points with diverse reasoning step distributions. Experimental results show that MathBook-RL performs competitively with existing baselines on four widely-used benchmarks and achieves strong results on MathBookEval, suggesting promising generalization in mathematical reasoning.

cs.AI↗

arXiv2025

A First Look at Predictability and Explainability of Pre-request Passenger Waiting Time in Ridesharing Systems

Passenger waiting time prediction plays a critical role in enhancing both ridesharing user experience and platform efficiency. While most existing research focuses on post-request waiting time prediction with knowing the matched driver information, pre-request waiting time prediction (i.e., before submitting a ride request and without matching a driver) is also important, as it enables passengers to plan their trips more effectively and enhance the experience of both passengers and drivers. However, it has not been fully studied by existing works. In this paper, we take the first step toward understanding the predictability and explainability of pre-request passenger waiting time in ridesharing systems. Particularly, we conduct an in-depth data-driven study to investigate the impact of demand&supply dynamics on passenger waiting time. Based on this analysis and feature engineering, we propose FiXGBoost, a novel feature interaction-based XGBoost model designed to predict waiting time without knowing the assigned driver information. We further perform an importance analysis to quantify the contribution of each factor. Experiments on a large-scale real-world ridesharing dataset including over 30 million trip records show that our FiXGBoost can achieve a good performance for pre-request passenger waiting time prediction with high explainability.

cs.AI↗

arXiv2025

A Trustworthy Method for Multimodal Emotion Recognition

Existing emotion recognition methods mainly focus on enhancing performance by employing complex deep models, typically resulting in significantly higher model complexity. Although effective, it is also crucial to ensure the reliability of the final decision, especially for noisy, corrupted and out-of-distribution data. To this end, we propose a novel emotion recognition method called trusted emotion recognition (TER), which utilizes uncertainty estimation to calculate the confidence value of predictions. TER combines the results from multiple modalities based on their confidence values to output the trusted predictions. We also provide a new evaluation criterion to assess the reliability of predictions. Specifically, we incorporate trusted precision and trusted recall to determine the trusted threshold and formulate the trusted Acc. and trusted F1 score to evaluate the model's trusted performance. The proposed framework combines the confidence module that accordingly endows the model with reliability and robustness against possible noise or corruption. The extensive experimental results validate the effectiveness of our proposed model. The TER achieves state-of-the-art performance on the Music-video, achieving 82.40% Acc. In terms of trusted performance, TER outperforms other methods on the IEMOCAP and Music-video, achieving trusted F1 scores of 0.7511 and 0.9035, respectively.

cs.CV↗

arXiv2025

The Poisson noise in modeling the redshift-space distortion at large scales

We investigate the errors in modeling the redshift-space distortion (RSD) effect at large linear scales, using data from the Millennium simulation. While standard theoretical templates, such as the Kaiser formula and the TNS method, could precisely model RSD for individual large-scale modes, we find that for tracers with number densities lower than $\sim10^{-3}({\rm Mpc}/h)^{-3}$, there is a few-percent level bias in the predicted power spectrum. This error arises due to the amplification of intrinsic Poisson noise during RSD modeling from real-space power spectrum. This amplified noise can be analytically expressed as $1 + ε/[{\bar{n}P}({1+ε})]$, with $ε=2β/3+β^2/5$, where $P$ denotes the real-space tracer power spectrum and $β\equiv f/b$. Specifically, for halos with a number density of around $5\times10^{-4}({\rm Mpc}/h)^{-3}$, this phenomenon results in an additional systematic error of 2.5\%. Our result suggests that caution is necessary when directly modeling redshift-space distortions (RSD) using real-space power spectra of tracers obtained from simulations or actual surveys. This caution is particularly pertinent in scenarios where emulators trained on simulation data forecast the real-space tracer power spectrum, as well as in baryon acoustic oscillation (BAO) reconstruction using galaxy samples, for which we estimate that shot noise could introduce random errors of about one-third in the displacement field, potentially diminishing the effectiveness of the BAO peak sharpening.

astro-ph.CO↗

arXiv2025

A Structure-aware and Motion-adaptive Framework for 3D Human Pose Estimation with Mamba

Recent Mamba-based methods for the pose-lifting task tend to model joint dependencies by 2D-to-1D mapping with diverse scanning strategies. Though effective, they struggle to model intricate joint connections and uniformly process all joint motion trajectories while neglecting the intrinsic differences across motion characteristics. In this work, we propose a structure-aware and motion-adaptive framework to capture spatial joint topology along with diverse motion dynamics independently, named as SAMA. Specifically, SAMA consists of a Structure-aware State Integrator (SSI) and a Motion-adaptive State Modulator (MSM). The Structure-aware State Integrator is tasked with leveraging dynamic joint relationships to fuse information at both the joint feature and state levels in the state space, based on pose topology rather than sequential state transitions. The Motion-adaptive State Modulator is responsible for joint-specific motion characteristics recognition, thus applying tailored adjustments to diverse motion patterns across different joints. Through the above key modules, our algorithm enables structure-aware and motion-adaptive pose lifting. Extensive experiments across multiple benchmarks demonstrate that our algorithm achieves advanced results with fewer computational costs.

cs.CV↗

arXiv2025

Dynamic mapping from static labels: remote sensing dynamic sample generation with temporal-spectral embedding

Accurate remote sensing geographic mapping requires timely and representative samples. However, rapid land surface changes often render static samples obsolete within months, making manual sample updates labor-intensive and unsustainable. To address this challenge, we propose TasGen, a two-stage Temporal spectral-aware Automatic Sample Generation method for generating dynamic training samples from single-date static labels without human intervention. Land surface dynamics often manifest as anomalies in temporal-spectral sequences. %These anomalies are multivariate yet unified: temporal, spectral, or joint anomalies stem from different mechanisms and cannot be naively coupled, as this may obscure the nature of changes. Yet, any land surface state corresponds to a coherent temporal-spectral signature, which would be lost if the two dimensions are modeled separately. To effectively capture these dynamics, TasGen first disentangles temporal and spectral features to isolate their individual contributions, and then couples them to model their synergistic interactions. In the first stage, we introduce a hierarchical temporal-spectral variational autoencoder (HTS-VAE) with a dual-dimension embedding to learn low-dimensional latent patterns of normal samples by first disentangling and then jointly embedding temporal and spectral information. This temporal-spectral embedding enables robust anomaly detection by identifying deviations from learned joint patterns. In the second stage, a classifier trained on stable samples relabels change points across time to generate dynamic samples. To not only detect but also explain surface dynamics, we further propose an anomaly interpretation method based on Gibbs sampling, which attributes changes to specific spectral-temporal dimensions.

eess.IV↗

arXiv2025

Phase-selective tripartite entanglement and asymmetric Einstein-Podolsky-Rosen steering in squeezed optomechanics

The generation and manipulation of multipartite entanglement and EPR steering in macroscopic systems not only play a fundamental role in exploring the nature of quantum mechanics, but are also at the core of current developments of various nascent quantum technologies. Here we report a theoretical method using squeezing-phase-controlled quantum noise flows to selectively generate and manipulate quantum entanglement and asymmetric EPR steering in a nonlinear $χ^{(2)}$ whispering-gallery-mode (WGM) optomechanical resonator. We show that by pumping the $χ^{(2)}$ nonlinear medium with two-photon optical fields and broadband squeezed lights, a pair of counterpropagating squeezed optical modes could be introduced to the WGM resonator, each coupled with an independent squeezed vacuum reservoir. This configuration could enable squeezing-phase-controlled light-reservoir interaction for each squeezed optical mode, providing a flexible tool for tailoring asymmetric optical noise flows in the counterpropagating modes. Based on this unique feature, it is found that with the injection of asymmetric noise flows, the generation of various types of bipartite and tripartite entanglement become phase-dependent and thus they can be produced in an asymmetric way. More excitingly, it is also found that by further properly adjusting the squeezing parameters, the overall asymmetry of EPR steering can also be stepwise driven from no-way regime, one-way regime to two-way regime. These findings, holding promise for preparing rich types of entangled quantum resources with asymmetric features, may have potential applications in the area of secure quantum information processing such as quantum secure direct communication and one-way quantum computing.

quant-ph↗

arXiv2025

Exploring Active Learning for Semiconductor Defect Segmentation

The development of X-Ray microscopy (XRM) technology has enabled non-destructive inspection of semiconductor structures for defect identification. Deep learning is widely used as the state-of-the-art approach to perform visual analysis tasks. However, deep learning based models require large amount of annotated data to train. This can be time-consuming and expensive to obtain especially for dense prediction tasks like semantic segmentation. In this work, we explore active learning (AL) as a potential solution to alleviate the annotation burden. We identify two unique challenges when applying AL on semiconductor XRM scans: large domain shift and severe class-imbalance. To address these challenges, we propose to perform contrastive pretraining on the unlabelled data to obtain the initialization weights for each AL cycle, and a rareness-aware acquisition function that favors the selection of samples containing rare classes. We evaluate our method on a semiconductor dataset that is compiled from XRM scans of high bandwidth memory structures composed of logic and memory dies, and demonstrate that our method achieves state-of-the-art performance.

cs.CV↗

arXiv2025

One Step Beyond: Feedthrough & Placement-Aware Rectilinear Floorplanner

Floorplanning determines the shapes and locations of modules on a chip canvas and plays a critical role in optimizing the chip's Power, Performance, and Area (PPA) metrics. However, existing floorplanning approaches often fail to integrate with subsequent physical design stages, leading to suboptimal in-module component placement and excessive inter-module feedthrough. To tackle this challenge, we propose Flora, a three-stage feedthrough and placement aware rectilinear floorplanner. In the first stage, Flora employs wiremask and position mask techniques to achieve coarse-grained optimization of HPWL and feedthrough. In the second stage, under the constraint of a fixed outline, Flora achieves a zero-whitespace layout by locally resizing module shapes, thereby performing fine-grained optimization of feedthrough and improving component placement. In the third stage, Flora utilizes a fast tree search-based method to efficiently place components-including macros and standard cells-within each module, subsequently adjusting module boundaries based on the placement results to enable cross-stage optimization. Experimental results show that Flora outperforms recent state-of-the-art floorplanning approaches, achieving an average reduction of 6% in HPWL, 5.16% in FTpin, 29.15% in FTmod, and a 14% improvement in component placement performance.

cs.RO↗

arXiv2025

Piano: A Multi-Constraint Pin Assignment-Aware Floorplanner

Floorplanning is a critical step in VLSI physical design, increasingly complicated by modern constraints such as fixed-outline requirements, whitespace removal, and the presence of pre-placed modules. In addition, the assignment of pins on module boundaries significantly impacts the performance of subsequent stages, including detailed placement and routing. However, traditional floorplanners often overlook pin assignment with modern constraints during the floorplanning stage. In this work, we introduce Piano, a floorplanning framework that simultaneously optimizes module placement and pin assignment under multiple constraints. Specifically, we construct a graph based on the geometric relationships among modules and their netlist connections, then iteratively search for shortest paths to determine pin assignments. This graph-based method also enables accurate evaluation of feedthrough and unplaced pins, thereby guiding overall layout quality. To further improve the design, we adopt a whitespace removal strategy and employ three local optimizers to enhance layout metrics under multi-constraint scenarios. Experimental results on widely used benchmark circuits demonstrate that Piano achieves an average 6.81% reduction in HPWL, a 13.39% decrease in feedthrough wirelength, a 16.36% reduction in the number of feedthrough modules, and a 21.21% drop in unplaced pins, while maintaining zero whitespace.

cs.AR↗

arXiv2025

Statistical and Computational Guarantees of Kernel Max-Sliced Wasserstein Distances

Optimal transport has been very successful for various machine learning tasks; however, it is known to suffer from the curse of dimensionality. Hence, dimensionality reduction is desirable when applied to high-dimensional data with low-dimensional structures. The kernel max-sliced (KMS) Wasserstein distance is developed for this purpose by finding an optimal nonlinear mapping that reduces data into $1$ dimension before computing the Wasserstein distance. However, its theoretical properties have not yet been fully developed. In this paper, we provide sharp finite-sample guarantees under milder technical assumptions compared with state-of-the-art for the KMS $p$-Wasserstein distance between two empirical distributions with $n$ samples for general $p\in[1,\infty)$. Algorithm-wise, we show that computing the KMS $2$-Wasserstein distance is NP-hard, and then we further propose a semidefinite relaxation (SDR) formulation (which can be solved efficiently in polynomial time) and provide a relaxation gap for the obtained solution. We provide numerical examples to demonstrate the good performance of our scheme for high-dimensional two-sample testing.

stat.ML↗

arXiv2025

Density Matrix Geometry and Sum Rules

Geometry plays a fundamental role in a wide range of physical responses, from anomalous transport coefficients to their related sum rules. Notable examples include the quantization of the Hall conductivity and the Souza-Wilkens-Martin (SWM) sum rule -- both valid at zero temperature, independent of interactions and disorder. The finite-temperature generalization of the SWM sum rule has been explored in the literature, revealing deep connections to the geometry of density matrices. Building on recent advances in time-dependent geometric frameworks, we propose a time-dependent quantum geometric tensor for thermal density matrices. This formalism provides a unified interpretation of known sum rules within the framework of the fluctuation-dissipation theorem, further elucidating their fundamental geometric origin. In addition, it provides experimentally accessible methods to probe quantum geometry beyond the zero-temperature regime.

cond-mat.mes-hall↗