Searcharxiv⌕ Search

arXiv subjects

Teng Zhang

Publications and source records attributed to Teng Zhang.

At least 91 records · Page 5Linked to original sources

HoMer: Addressing Heterogeneities by Modeling Sequential and Set-wise Contexts for CTR Prediction

Click-through rate (CTR) prediction, which models behavior sequence and non-sequential features (e.g., user/item profiles or cross features) to infer user interest, underpins industrial recommender systems. However, most methods face three forms of heterogeneity that degrade predictive performance: (i) Feature Heterogeneity persists when limited sequence side features provide less granular interest representation compared to extensive non-sequential features, thereby impairing sequence modeling performance; (ii) Context Heterogeneity arises because a user's interest in an item will be influenced by other items, yet point-wise prediction neglects cross-item interaction context from the entire item set; (iii) Architecture Heterogeneity stems from the fragmented integration of specialized network modules, which compounds the model's effectiveness, efficiency and scalability in industrial deployments. To tackle the above limitations, we propose HoMer, a Homogeneous-Oriented TransforMer for modeling sequential and set-wise contexts. First, we align sequence side features with non-sequential features for accurate sequence modeling and fine-grained interest representation. Second, we shift the prediction paradigm from point-wise to set-wise, facilitating cross-item interaction in a highly parallel manner. Third, HoMer's unified encoder-decoder architecture achieves dual optimization through structural simplification and shared computation, ensuring computational efficiency while maintaining scalability with model size. Without arduous modification to the prediction pipeline, HoMer successfully scales up and outperforms our industrial baseline by 0.0099 in the AUC metric, and enhances online business metrics like CTR/RPM by 1.99%/2.46%. Additionally, HoMer saves 27% of GPU resources via preliminary engineering optimization, further validating its superiority and practicality.

cs.IR↗

Geodesic Diffusion Models for Efficient Medical Image Enhancement

Diffusion models generate data by learning to reverse a forward process, where samples are progressively perturbed with Gaussian noise according to a predefined noise schedule. From a geometric perspective, each noise schedule corresponds to a unique trajectory in probability space from the data distribution to a Gaussian prior. However, prior diffusion models rely on empirically chosen schedules that may not be optimal. This inefficiency necessitates many intermediate time steps, resulting in high computational costs during both training and sampling. To address this, we derive a family of geodesic noise schedules corresponding to the shortest paths in probability space under the Fisher-Rao metric. Based on these schedules, we propose Geodesic Diffusion Models (GDMs), which significantly improve training and sampling efficiency by minimizing the energy required to transform between probability distributions. This efficiency further enables sampling to start from an intermediate distribution in conditional image generation, achieving state-of-the-art results with as few as 6 steps. We evaluated GDM on two medical image enhancement tasks: CT image denoising and MRI image super-resolution. Experimental results show that GDM achieved state-of-the-art performance while reducing training time by 20- to 30-fold compared to Denoising Diffusion Probabilistic Models (DDPMs) and 4- to 6-fold compared to Fast-DDPM, and accelerating sampling by 160- to 170-fold and 1.6-fold, respectively. These gains support the use of GDM for efficient model development and real-time clinical applications. Our code is publicly available at: https://github.com/mirthAI/GDM-VE.

eess.IV↗

Data Scaling Laws for Imitation Learning-Based End-to-End Autonomous Driving

The end-to-end autonomous driving paradigm has recently attracted lots of attention due to its scalability. However, existing methods are constrained by the limited scale of real-world data, which hinders a comprehensive exploration of the scaling laws associated with end-to-end autonomous driving. To address this issue, we collected substantial data from various driving scenarios and behaviors and conducted an extensive study on the scaling laws of existing imitation learning-based end-to-end autonomous driving paradigms. Specifically, approximately 4 million demonstrations from 23 different scenario types were gathered, amounting to over 30,000 hours of driving demonstrations. We performed open-loop evaluations and closed-loop simulation evaluations in 1,400 diverse driving demonstrations (1,300 for open-loop and 100 for closed-loop) under stringent assessment conditions. Through experimental analysis, we discovered that (1) the performance of the driving model exhibits a power-law relationship with the amount of data, but this is not the case in closed-loop evaluation. The inconsistency between the two assessments shifts our focus toward the distribution of data rather than merely expanding its volume. (2) a small increase in the quantity of long-tailed data can significantly improve the performance for the corresponding scenarios; (3) appropriate scaling of data enables the model to achieve combinatorial generalization in novel scenes and actions. Our results highlight the critical role of data scaling in improving the generalizability of models across diverse autonomous driving scenarios, assuring safe deployment in the real world.. Project repository: https://github.com/ucaszyp/Driving-Scaling-Law

cs.RO↗

Adapting and Evaluating Multimodal Large Language Models for Adolescent Idiopathic Scoliosis Self-Management: A Divide and Conquer Framework

This study presents the first comprehensive evaluation of Multimodal Large Language Models (MLLMs) for Adolescent Idiopathic Scoliosis (AIS) self-management. We constructed a database of approximately 3,000 anteroposterior X-rays with diagnostic texts and evaluated five MLLMs through a `Divide and Conquer' framework consisting of a visual question-answering task, a domain knowledge assessment task, and a patient education counseling assessment task. Our investigation revealed limitations of MLLMs' ability in interpreting complex spinal radiographs and comprehending AIS care knowledge. To address these, we pioneered enhancing MLLMs with spinal keypoint prompting and compiled an AIS knowledge base for retrieval augmented generation (RAG), respectively. Results showed varying effectiveness of visual prompting across different architectures, while RAG substantially improved models' performances on the knowledge assessment task. Our findings indicate current MLLMs are far from capable in realizing personalized assistant in AIS care. The greatest challenge lies in their abilities to obtain accurate detections of spinal deformity locations (best accuracy: 0.55) and directions (best accuracy: 0.13).

cs.AI↗

Accurate Cobb Angle Estimation via SVD-Based Curve Detection and Vertebral Wedging Quantification

Adolescent idiopathic scoliosis (AIS) is a common spinal deformity affecting approximately 2.2% of boys and 4.8% of girls worldwide. The Cobb angle serves as the gold standard for AIS severity assessment, yet traditional manual measurements suffer from significant observer variability, compromising diagnostic accuracy. Despite prior automation attempts, existing methods use simplified spinal models and predetermined curve patterns that fail to address clinical complexity. We present a novel deep learning framework for AIS assessment that simultaneously predicts both superior and inferior endplate angles with corresponding midpoint coordinates for each vertebra, preserving the anatomical reality of vertebral wedging in progressive AIS. Our approach combines an HRNet backbone with Swin-Transformer modules and biomechanically informed constraints for enhanced feature extraction. We employ Singular Value Decomposition (SVD) to analyze angle predictions directly from vertebral morphology, enabling flexible detection of diverse scoliosis patterns without predefined curve assumptions. Using 630 full-spine anteroposterior radiographs from patients aged 10-18 years with rigorous dual-rater annotation, our method achieved 83.45% diagnostic accuracy and 2.55° mean absolute error. The framework demonstrates exceptional generalization capability on out-of-distribution cases. Additionally, we introduce the Vertebral Wedging Index (VWI), a novel metric quantifying vertebral deformation. Longitudinal analysis revealed VWI's significant prognostic correlation with curve progression while traditional Cobb angles showed no correlation, providing robust support for early AIS detection, personalized treatment planning, and progression monitoring.

cs.CV↗

LatXGen: Towards Radiation-Free and Accurate Quantitative Analysis of Sagittal Spinal Alignment Via Cross-Modal Radiographic View Synthesis

Adolescent Idiopathic Scoliosis (AIS) is a complex three-dimensional spinal deformity, and accurate morphological assessment requires evaluating both coronal and sagittal alignment. While previous research has made significant progress in developing radiation-free methods for coronal plane assessment, reliable and accurate evaluation of sagittal alignment without ionizing radiation remains largely underexplored. To address this gap, we propose LatXGen, a novel generative framework that synthesizes realistic lateral spinal radiographs from posterior Red-Green-Blue and Depth (RGBD) images of unclothed backs. This enables accurate, radiation-free estimation of sagittal spinal alignment. LatXGen tackles two core challenges: (1) inferring sagittal spinal morphology changes from a lateral perspective based on posteroanterior surface geometry, and (2) performing cross-modality translation from RGBD input to the radiographic domain. The framework adopts a dual-stage architecture that progressively estimates lateral spinal structure and synthesizes corresponding radiographs. To enhance anatomical consistency, we introduce an attention-based Fast Fourier Convolution (FFC) module for integrating anatomical features from RGBD images and 3D landmarks, and a Spatial Deformation Network (SDN) to model morphological variations in the lateral view. Additionally, we construct the first large-scale paired dataset for this task, comprising 3,264 RGBD and lateral radiograph pairs. Experimental results demonstrate that LatXGen produces anatomically accurate radiographs and outperforms existing GAN-based methods in both visual fidelity and quantitative metrics. This study offers a promising, radiation-free solution for sagittal spine assessment and advances comprehensive AIS evaluation.

cs.CV↗

Fast-DDPM: Fast Denoising Diffusion Probabilistic Models for Medical Image-to-Image Generation

Denoising diffusion probabilistic models (DDPMs) have achieved unprecedented success in computer vision. However, they remain underutilized in medical imaging, a field crucial for disease diagnosis and treatment planning. This is primarily due to the high computational cost associated with (1) the use of large number of time steps (e.g., 1,000) in diffusion processes and (2) the increased dimensionality of medical images, which are often 3D or 4D. Training a diffusion model on medical images typically takes days to weeks, while sampling each image volume takes minutes to hours. To address this challenge, we introduce Fast-DDPM, a simple yet effective approach capable of improving training speed, sampling speed, and generation quality simultaneously. Unlike DDPM, which trains the image denoiser across 1,000 time steps, Fast-DDPM trains and samples using only 10 time steps. The key to our method lies in aligning the training and sampling procedures to optimize time-step utilization. Specifically, we introduced two efficient noise schedulers with 10 time steps: one with uniform time step sampling and another with non-uniform sampling. We evaluated Fast-DDPM across three medical image-to-image generation tasks: multi-image super-resolution, image denoising, and image-to-image translation. Fast-DDPM outperformed DDPM and current state-of-the-art methods based on convolutional networks and generative adversarial networks in all tasks. Additionally, Fast-DDPM reduced the training time to 0.2x and the sampling time to 0.01x compared to DDPM. Our code is publicly available at: https://github.com/mirthAI/Fast-DDPM.

eess.IV↗

A refinement of Pawlowski's result

Let \(F(z) = \prod_{k=1}^{n}(z - z_k)\) be a monic complex polynomial of degree \(n\) whose zeros satisfy \(\max\limits_{1 \le k \le n} |z_k| \le 1\). Pawłowski [Trans. Amer. Math. Soc. 350(11) (1998)] considered the radius \(γ_n\) of the smallest disk, centered at the centroid \(\frac{1}{n}\sum_{k=1}^n z_k\), containing at least one critical point of \(F\), establishing the bound $γ_n \le \frac{2\,n^{\frac{1}{n-1}}}{n^{\frac{2}{n-1}} + 1}$. In this paper, inspired by the spirit of Borcea's variance conjectures and leveraging the classical Schoenberg inequality, we significantly refine Pawłowski's estimate by proving succinctly and elegantly that $γ_n \le \sqrt{\frac{n - 2}{n - 1}}$. This result also represents a rare and noteworthy application of Schoenberg's inequality to the geometry of polynomial critical points.

math.CV↗

Improved Convergence Factor of Windowed Anderson Acceleration for Symmetric Fixed-Point Iterations

This paper studies the commonly utilized windowed Anderson acceleration (AA) algorithm for fixed-point methods, $x^{(k+1)}=q(x^{(k)})$. It provides the first proof that when the operator $q$ is linear and symmetric the windowed AA, which uses a sliding window of prior iterates, improves the root-linear convergence factor over the fixed-point iterations. When $q$ is nonlinear, yet has a symmetric Jacobian at a fixed point, a slightly modified AA algorithm is proved to have an analogous root-linear convergence factor improvement over fixed-point iterations. Simulations verify our observations. Furthermore, experiments with different data models demonstrate AA is significantly superior to the standard fixed-point methods for Tyler's M-estimation.

math.NA↗

A Dual-Feature Extractor Framework for Accurate Back Depth and Spine Morphology Estimation from Monocular RGB Images

Scoliosis is a prevalent condition that impacts both physical health and appearance, with adolescent idiopathic scoliosis (AIS) being the most common form. Currently, the main AIS assessment tool, X-rays, poses significant limitations, including radiation exposure and limited accessibility in poor and remote areas. To address this problem, the current solutions are using RGB images to analyze spine morphology. However, RGB images are highly susceptible to environmental factors, such as lighting conditions, compromising model stability and generalizability. Therefore, in this study, we propose a novel pipeline to accurately estimate the depth information of the unclothed back, compensating for the limitations of 2D information, and then estimate spine morphology by integrating both depth and surface information. To capture the subtle depth variations of the back surface with precision, we design an adaptive multiscale feature learning network named Grid-Aware Multiscale Adaptive Network (GAMA-Net). This model uses dual encoders to extract both patch-level and global features, which are then interacted by the Patch-Based Hybrid Attention (PBHA) module. The Adaptive Multiscale Feature Fusion (AMFF) module is used to dynamically fuse information in the decoder. As a result, our depth estimation model achieves remarkable accuracy across three different evaluation metrics, with scores of nearly 78.2%, 93.6%, and 97.5%, respectively. To further validate the effectiveness of the predicted depth, we integrate both surface and depth information for spine morphology estimation. This integrated approach enhances the accuracy of spine curve generation, achieving an impressive performance of up to 97%.

eess.IV↗

A new proof of Lee's conjecture on the Frobenius norm via the matrix Cauchy-Schwarz inequality

In 2010, Eun-Young Lee conjectured that if $A,B$ are two $n\times n$ complex matrices and $\left|A\right|, \left|B\right|$ are the absolute values of $A, B$, respectively, then \[ \|A+B\|_F\le \sqrt{\dfrac{1+\sqrt{2}}{2}}\|\left|A\right|+\left|B\right|\|_F, \] where $\|\cdot\|_F$ is the Frobenius norm of matrices. This conjecture has been proven by Lin and Zhang [J. Math. Anal. Appl. 516 (2022) 126542] by studying inequalities for the angle between two matrices induced by the Frobenius inner product. In this paper, we present a new proof of the same result, relying solely on the Cauchy-Schwarz inequality.

math.FA↗

Non-Linearities In Atomic Quantum Receivers: Harmonic And Intermodulation Distortion

Rydberg sensors offer a unique approach to radio frequency (RF) detection, leveraging the high sensitivity and quantum properties of highly-excited atomic states to achieve performance levels beyond classical technologies. Non-linear responses and distortion behavior in Rydberg atom receivers are critical to evaluating and establishing performance metrics and capabilities such as spur-free dynamic range and tolerance to unwanted interfering signals. We report here on the measurement and characterization of non-linear behavior and spurious response of a Rydberg atomic heterodyne receiver. Single-tone and two-tone testing procedures are developed and implemented for measurement of harmonic and inter-modulation distortion in Rydberg atomic receivers based on multi-photon Rydberg spectroscopy and radio-frequency heterodyne signal detection and demodulation in an atomic vapor. For a predetermined set of atomic receiver parameters and RF carrier wave in the SHF band near-resonant to a cesium Rydberg transition, we measure and characterize atomic receiver selectivity, bandwidth, roll-off, compression point (P1dB), second-order (IP2) and third-order (IP3) intercepts, and spur-free dynamic range. Receiver intermodulation distortion is characterized for the case of an interfering signal wave applied at two frequency offsets relative to the near-resonant reference local oscillator, $ΔF/F= 10^{-4}$ at 6dB and $10^{-6}$ at 22dB single-tone bandwidths, respectively. We observe that under suitable operating conditions the atomic receiver can exhibit a suppression of harmonic and inter-modulation distortion relative to that of classical receiver mixer amplifiers. Finally, we describe how the non-linear behaviors of atomic receivers can provide unique, controllable RF signatures inaccessible by classical counterparts and propose their use to realize secure communication modalities and applications.

physics.atom-ph↗

World4Drive: End-to-End Autonomous Driving via Intention-aware Physical Latent World Model

End-to-end autonomous driving directly generates planning trajectories from raw sensor data, yet it typically relies on costly perception supervision to extract scene information. A critical research challenge arises: constructing an informative driving world model to enable perception annotation-free, end-to-end planning via self-supervised learning. In this paper, we present World4Drive, an end-to-end autonomous driving framework that employs vision foundation models to build latent world models for generating and evaluating multi-modal planning trajectories. Specifically, World4Drive first extracts scene features, including driving intention and world latent representations enriched with spatial-semantic priors provided by vision foundation models. It then generates multi-modal planning trajectories based on current scene features and driving intentions and predicts multiple intention-driven future states within the latent space. Finally, it introduces a world model selector module to evaluate and select the best trajectory. We achieve perception annotation-free, end-to-end planning through self-supervised alignment between actual future observations and predicted observations reconstructed from the latent space. World4Drive achieves state-of-the-art performance without manual perception annotations on both the open-loop nuScenes and closed-loop NavSim benchmarks, demonstrating an 18.1\% relative reduction in L2 error, 46.7% lower collision rate, and 3.75 faster training convergence. Codes will be accessed at https://github.com/ucaszyp/World4Drive.

cs.CV↗

Beijing Normal University 12-meter Interferometric kHz GW Detector Prototype: Design and Scientific Prospects

Current gravitational-wave detectors have achieved remarkable sensitivity around 100 Hz, enabling ground-breaking discoveries. Enhancing sensitivity at higher frequencies in the kilohertz (kHz) range promises access to rich physics, particularly the extreme conditions during the merger stage of binary neutron stars. However, the high-frequency sensitivity of Michelson-based interferometers is fundamentally limited by their linear optical cavities, which are optimized for low-frequency signal enhancement. In [Phys. Rev. X 13, 021019 (2023)], a new configuration employing an L-shaped optical resonator was proposed to overcome this limitation, offering exceptional sensitivity in the kHz band. As a pathfinder, the 12-meter prototype at Beijing Normal University is designed to demonstrate the sensing and control schemes of this new kHz detector configuration and to explore its performance in the high-power regime with suspended optics. Beyond its primary scientific goal, the prototype also offers potential sensitivity in the megahertz (MHz) range, potentially enabling constraints on exotic sources. This paper presents an overview of the prototype, including its optical design and current development status of key components.

physics.optics↗

Maximal Speed of Glucose Change Significantly Distinguishes Prediabetes from Diabetes

Rapid changes in blood glucose levels can have severe and immediate health consequences, leading to the need to develop indices for assessing these rapid changes based on continuous glucose monitoring (CGM) data. We proposed a CGM index, maxSpeed, that represents the maximum of speed of glucose change (SGC) in a subject, respectively, and conducted a clinical study to investigate this index along with SGC mean (meanSpeed) and SGC standard deviation (sdSpeed), coefficient of variation (CV), standard deviation (SD), glycemic variability percentage (GVP), mean amplitude of glycemic excursions (MAG), mean absolute glucose excursion (MAGE), mean of daily differences (MODD) and continuous overlapping net glycemic action (CONGA). Our study revealed that, there exist multiple patterns in distinguishing non-diabetes, prediabetes, type 1 diabetes (T1D) and type 2 diabetes (T2D). First, maxSpeed significantly distinguishes between either of non-diabetes and prediabetes and either of T1D and T2D. Second, meanSpeed, sdSpeed, GVP and MAG significantly distinguish between non-diabetes and either of T1D and T2D. Third, MODD and CONGA of 24 hours significantly distinguish between non-diabetes and either of T1D and T2D, between T1D and either of prediabetes and T2D. Fourth, SD, MAGE and CONGA of 12 hours significantly distinguish between non-diabetes and either of T1D and T2D, between T1D and pre-diabetes. Fifth, CV significantly distinguishes between T1D and either of Non-diabetes and T2D. maxSpeed assesses the rapid change of glucose in a short term, which is important both biologically and clinicially because our human body may not tolerate too rapid change in a short term.

q-bio.QM↗

NGA: Non-autoregressive Generative Auction with Global Externalities for Advertising Systems

Online advertising auctions are fundamental to internet commerce, demanding solutions that not only maximize revenue but also ensure incentive compatibility, high-quality user experience, and real-time efficiency. While recent learning-based auction frameworks have improved context modeling by capturing intra-list dependencies among ads, they remain limited in addressing global externalities and often suffer from inefficiencies caused by sequential processing. In this work, we introduce the Non-autoregressive Generative Auction with global externalities (NGA), a novel end-to-end framework designed for industrial online advertising. NGA explicitly models global externalities by jointly capturing the relationships among ads as well as the effects of adjacent organic content. To further enhance efficiency, NGA utilizes a non-autoregressive, constraint-based decoding strategy and a parallel multi-tower evaluator for unified list-wise reward and payment computation. Extensive offline experiments and large-scale online A/B testing on commercial advertising platforms demonstrate that NGA consistently outperforms existing methods in both effectiveness and efficiency.

cs.IR↗

EGA-V1: Unifying Online Advertising with End-to-End Learning

Modern industrial advertising systems commonly employ Multi-stage Cascading Architectures (MCA) to balance computational efficiency with ranking accuracy. However, this approach presents two fundamental challenges: (1) performance inconsistencies arising from divergent optimization targets and capability differences between stages, and (2) failure to account for advertisement externalities - the complex interactions between candidate ads during ranking. These limitations ultimately compromise system effectiveness and reduce platform profitability. In this paper, we present EGA-V1, an end-to-end generative architecture that unifies online advertising ranking as one model. EGA-V1 replaces cascaded stages with a single model to directly generate optimal ad sequences from the full candidate ad corpus in location-based services (LBS). The primary challenges associated with this approach stem from high costs of feature processing and computational bottlenecks in modeling externalities of large-scale candidate pools. To address these challenges, EGA-V1 introduces an algorithm and engine co-designed hybrid feature service to decouple user and ad feature processing, reducing latency while preserving expressiveness. To efficiently extract intra- and cross-sequence mutual information, we propose RecFormer with an innovative cluster-attention mechanism as its core architectural component. Furthermore, we propose a bi-stage training strategy that integrates pre-training with reinforcement learning-based post-training to meet sophisticated platform and advertising objectives. Extensive offline evaluations on public benchmarks and large-scale online A/B testing on industrial advertising platform have demonstrated the superior performance of EGA-V1 over state-of-the-art MCAs.

cs.IR↗

EGA-V2: An End-to-end Generative Framework for Industrial Advertising

Traditional online industrial advertising systems suffer from the limitations of multi-stage cascaded architectures, which often discard high-potential candidates prematurely and distribute decision logic across disconnected modules. While recent generative recommendation approaches provide end-to-end solutions, they fail to address critical advertising requirements of key components for real-world deployment, such as explicit bidding, creative selection, ad allocation, and payment computation. To bridge this gap, we introduce End-to-End Generative Advertising (EGA-V2), the first unified framework that holistically models user interests, point-of-interest (POI) and creative generation, ad allocation, and payment optimization within a single generative model. Our approach employs hierarchical tokenization and multi-token prediction to jointly generate POI recommendations and ad creatives, while a permutation-aware reward model and token-level bidding strategy ensure alignment with both user experiences and advertiser objectives. Additionally, we decouple allocation from payment using a differentiable ex-post regret minimization mechanism, guaranteeing approximate incentive compatibility at the POI level. Through extensive offline evaluations we demonstrate that EGA-V2 significantly outperforms traditional cascaded systems in both performance and practicality. Our results highlight its potential as a pioneering fully generative advertising solution, paving the way for next-generation industrial ad systems.

cs.IR↗