arXiv subjects

Hong Chang

Publications and source records attributed to Hong Chang.

At least 55 records · Page 3Linked to original sources

arXiv2024

Realization of Landau-Zener Rabi Oscillations on optical lattice clock

Manipulating quantum states is at the heart of quantum information processing and quantum metrology. Landau-Zener Rabi oscillation (LZRO), which arises from a quantum two-level system swept repeatedly across the avoided crossing point in the time domain, has been suggested for widespread use in manipulating quantum states. Cold atom is one of the most prominent platforms for quantum computing and precision measurement. However, LZRO has never been observed in cold atoms due to its stringent requirements. By compensating for the linear drift of the clock laser and optimizing experimental parameters, we successfully measured LZRO on the strontium atomic optical clock platform under both fast and slow passage limits within $4$ to $6$ driving periods. Compared to previous results on other platforms, the duration of the plateau is $10^4$ times longer in the optical lattice clock. The experimental data also suggest that destructive Landau-Zener interference can effectively suppress dephasing effects in the optical lattice clock, paving the way for manipulating quantum states against various environmental effects in cold atomic systems.

quant-ph↗

arXiv2024

Generalized Semi-Supervised Learning via Self-Supervised Feature Adaptation

Traditional semi-supervised learning (SSL) assumes that the feature distributions of labeled and unlabeled data are consistent which rarely holds in realistic scenarios. In this paper, we propose a novel SSL setting, where unlabeled samples are drawn from a mixed distribution that deviates from the feature distribution of labeled samples. Under this setting, previous SSL methods tend to predict wrong pseudo-labels with the model fitted on labeled data, resulting in noise accumulation. To tackle this issue, we propose Self-Supervised Feature Adaptation (SSFA), a generic framework for improving SSL performance when labeled and unlabeled data come from different distributions. SSFA decouples the prediction of pseudo-labels from the current model to improve the quality of pseudo-labels. Particularly, SSFA incorporates a self-supervised task into the SSL framework and uses it to adapt the feature extractor of the model to the unlabeled data. In this way, the extracted features better fit the distribution of unlabeled data, thereby generating high-quality pseudo-labels. Extensive experiments show that our proposed SSFA is applicable to various pseudo-label-based SSL learners and significantly improves performance in labeled, unlabeled, and even unseen distributions.

cs.CV↗

arXiv2024

A Selective Review on Statistical Methods for Massive Data Computation: Distributed Computing, Subsampling, and Minibatch Techniques

This paper presents a selective review of statistical computation methods for massive data analysis. A huge amount of statistical methods for massive data computation have been rapidly developed in the past decades. In this work, we focus on three categories of statistical computation methods: (1) distributed computing, (2) subsampling methods, and (3) minibatch gradient techniques. The first class of literature is about distributed computing and focuses on the situation, where the dataset size is too huge to be comfortably handled by one single computer. In this case, a distributed computation system with multiple computers has to be utilized. The second class of literature is about subsampling methods and concerns about the situation, where the sample size of dataset is small enough to be placed on one single computer but too large to be easily processed by its memory as a whole. The last class of literature studies those minibatch gradient related optimization techniques, which have been extensively used for optimizing various deep learning models.

stat.ME↗

arXiv2024

SparseFusion: Efficient Sparse Multi-Modal Fusion Framework for Long-Range 3D Perception

Multi-modal 3D object detection has exhibited significant progress in recent years. However, most existing methods can hardly scale to long-range scenarios due to their reliance on dense 3D features, which substantially escalate computational demands and memory usage. In this paper, we introduce SparseFusion, a novel multi-modal fusion framework fully built upon sparse 3D features to facilitate efficient long-range perception. The core of our method is the Sparse View Transformer module, which selectively lifts regions of interest in 2D image space into the unified 3D space. The proposed module introduces sparsity from both semantic and geometric aspects which only fill grids that foreground objects potentially reside in. Comprehensive experiments have verified the efficiency and effectiveness of our framework in long-range 3D perception. Remarkably, on the long-range Argoverse2 dataset, SparseFusion reduces memory footprint and accelerates the inference by about two times compared to dense detectors. It also achieves state-of-the-art performance with mAP of 41.2% and CDS of 32.1%. The versatility of SparseFusion is also validated in the temporal object detection task and 3D lane detection task. Codes will be released upon acceptance.

cs.CV↗

arXiv2024

Task Attribute Distance for Few-Shot Learning: Theoretical Analysis and Applications

Few-shot learning (FSL) aims to learn novel tasks with very few labeled samples by leveraging experience from \emph{related} training tasks. In this paper, we try to understand FSL by delving into two key questions: (1) How to quantify the relationship between \emph{training} and \emph{novel} tasks? (2) How does the relationship affect the \emph{adaptation difficulty} on novel tasks for different models? To answer the two questions, we introduce Task Attribute Distance (TAD) built upon attributes as a metric to quantify the task relatedness. Unlike many existing metrics, TAD is model-agnostic, making it applicable to different FSL models. Then, we utilize TAD metric to establish a theoretical connection between task relatedness and task adaptation difficulty. By deriving the generalization error bound on a novel task, we discover how TAD measures the adaptation difficulty on novel tasks for FSL models. To validate our TAD metric and theoretical findings, we conduct experiments on three benchmarks. Our experimental results confirm that TAD metric effectively quantifies the task relatedness and reflects the adaptation difficulty on novel tasks for various FSL methods, even if some of them do not learn attributes explicitly or human-annotated attributes are not available. Finally, we present two applications of the proposed TAD metric: data augmentation and test-time intervention, which further verify its effectiveness and general applicability. The source code is available at https://github.com/hu-my/TaskAttributeDistance.

cs.CV↗

arXiv2024

Lifetime Determination of the $5s5p$ ${}^{3}P^{\rm{o}}_{0}$ Metastable State in ${}^{87}$Sr from the Electric Dipole Matrix Element

We report a measurement of the radiative lifetime of the $5s5p \; {}^{\rm{3}}P^{\rm{o}}_{\rm{0}}$ metastable state in ${}^{87}$Sr, which is coupled to the 5$s^{\rm{2}} \;$ ${}^{\rm{1}}S_{\rm{0}}$ ground state via a hyperfine-induced electric dipole transition. The radiative lifetime is determined to be 151.4(48) s, in good agreement with theoretical results. Our approach relies on accurate measurements of laser intensity and free-space Rabi frequency, enabling lifetime measurements of any excited state and particularly suitable for long-lived states.

physics.atom-ph↗

arXiv2024

Non-integer Floquet Sidebands Spectroscopy

In the quantum system under periodical modulation, the particle can be excited by absorbing the laser photon with the assistance of integer Floquet photons, so that the Floquet sidebands appear. Here, we experimentally observe non-integer Floquet sidebands (NIFBs) emerging between the integer ones while increasing the strength of the probe laser in the optical lattice clock system. Then, we propose the Floquet channel interference hypothesis (FCIH) which surprisingly matches quantitatively well with both experimental and numerical results. With its help, we found both Rabi and Ramsey spectra are very sensitive to the initial phase and exhibit additional two symmetries. More importantly, the height of Ramsey NIFBs is comparable to the integer one at larger $g/ω_s$ which indicates an exotic phenomenon beyond the perturbative description. Our work provides new insight into the spectroscopy of the Floquet system and has potential application in quantum technology.

cond-mat.quant-gas↗

arXiv2023

Dual Compensation Residual Networks for Class Imbalanced Learning

Learning generalizable representation and classifier for class-imbalanced data is challenging for data-driven deep models. Most studies attempt to re-balance the data distribution, which is prone to overfitting on tail classes and underfitting on head classes. In this work, we propose Dual Compensation Residual Networks to better fit both tail and head classes. Firstly, we propose dual Feature Compensation Module (FCM) and Logit Compensation Module (LCM) to alleviate the overfitting issue. The design of these two modules is based on the observation: an important factor causing overfitting is that there is severe feature drift between training and test data on tail classes. In details, the test features of a tail category tend to drift towards feature cloud of multiple similar head categories. So FCM estimates a multi-mode feature drift direction for each tail category and compensate for it. Furthermore, LCM translates the deterministic feature drift vector estimated by FCM along intra-class variations, so as to cover a larger effective compensation space, thereby better fitting the test features. Secondly, we propose a Residual Balanced Multi-Proxies Classifier (RBMC) to alleviate the under-fitting issue. Motivated by the observation that re-balancing strategy hinders the classifier from learning sufficient head knowledge and eventually causes underfitting, RBMC utilizes uniform learning with a residual path to facilitate classifier learning. Comprehensive experiments on Long-tailed and Class-Incremental benchmarks validate the efficacy of our method.

cs.CV↗

arXiv2023

TSoR: TCP Socket over RDMA Container Network for Cloud Native Computing

Cloud-native containerized applications constantly seek high-performance and easy-to-operate container network solutions. RDMA network is a potential enabler with higher throughput and lower latency than the standard TCP/IP network stack. However, several challenges remain in equipping containerized applications with RDMA network: 1) How to deliver transparent improvements without modifying application code; 2) How to integrate RDMA-based network solutions with container orchestration systems; 3) How to efficiently utilize RDMA for container networks. In this paper, we present an RDMA-based container network solution, TCP Socket over RDMA (TSoR), which addresses all the above challenges. To transparently accelerate applications using POSIX socket interfaces without modifications, we integrate TSoR with a container runtime that can intercept system calls for socket interfaces. To be compatible with orchestration systems like Kubernetes, TSoR implements a container network following the Kubernetes network model and satisfies all requirements of the model. To leverage RDMA benefits, TSoR designs a high-performance network stack that efficiently transfers TCP traffic using RDMA network. Thus, TSoR provides a turn-key solution for existing Kubernetes clusters to adopt the high-performance RDMA network with minimal effort. Our evaluation results show that TSoR provides up to 2.3x higher throughput and 64\% lower latency for existing containerized applications, such as Redis key-value store and Node.js web server, with no code changes. TSoR code will be open-sourced.

cs.NI↗

arXiv2023

The multiplexed light storage of Orbital Angular Momentum based on atomic ensembles

The improvement of the multi-mode capability of quantum memory can further improve the utilization efficiency of the quantum memory and reduce the requirement of quantum communication for storage units. In this letter, we experimentally investigate the multi-mode light multiplexing storage of orbital angular momentum (OAM) mode based on rubidium vapor, and demultiplexing by a photonic OAM mode splitter which combines a Sagnac loop with two dove prisms. Our results show a mode extinction ratio higher than 80$\%$ at 1 $μ$s of storage time. Meanwhile, two OAM modes have been multiplexing stored and demultiplexed in our experimental configuration. We believe the experimental scheme may provide a possibility for high channel capacity and multi-mode quantum multiplexed quantum storage based on atomic ensembles.

physics.atom-ph↗

arXiv2023

Diversity-Measurable Anomaly Detection

Reconstruction-based anomaly detection models achieve their purpose by suppressing the generalization ability for anomaly. However, diverse normal patterns are consequently not well reconstructed as well. Although some efforts have been made to alleviate this problem by modeling sample diversity, they suffer from shortcut learning due to undesired transmission of abnormal information. In this paper, to better handle the tradeoff problem, we propose Diversity-Measurable Anomaly Detection (DMAD) framework to enhance reconstruction diversity while avoid the undesired generalization on anomalies. To this end, we design Pyramid Deformation Module (PDM), which models diverse normals and measures the severity of anomaly by estimating multi-scale deformation fields from reconstructed reference to original input. Integrated with an information compression module, PDM essentially decouples deformation from prototypical embedding and makes the final anomaly score more reliable. Experimental results on both surveillance videos and industrial images demonstrate the effectiveness of our method. In addition, DMAD works equally well in front of contaminated data and anomaly-like normal samples.

cs.CV↗

arXiv2023

A construction of minimal coherent filling pairs

Let $S_g$ denote the genus $g$ closed orientable surface. A \emph{coherent filling pair} of simple closed curves, $(α,β)$ in $S_g$, is a filling pair that has its geometric intersection number equal to the absolute value of its algebraic intersection number. A \emph{minimally intersecting} filling pair, $(α,β)$ in $S_g$, is one whose intersection number is the minimal among all filling pairs of $S_g$. In this paper, we give a simple geometric procedure for constructing minimal intersecting coherent filling pairs on $S_g, \ g \geq 3,$ from the starting point of a coherent filling pair of curves on a torus. Coherent filling pairs have a natural correspondence to square-tiled surfaces, or {\em origamis}, and we discuss the origami obtained from the construction.

math.GT↗

arXiv2022

Joint Feature Learning and Relation Modeling for Tracking: A One-Stream Framework

The current popular two-stream, two-stage tracking framework extracts the template and the search region features separately and then performs relation modeling, thus the extracted features lack the awareness of the target and have limited target-background discriminability. To tackle the above issue, we propose a novel one-stream tracking (OSTrack) framework that unifies feature learning and relation modeling by bridging the template-search image pairs with bidirectional information flows. In this way, discriminative target-oriented features can be dynamically extracted by mutual guidance. Since no extra heavy relation modeling module is needed and the implementation is highly parallelized, the proposed tracker runs at a fast speed. To further improve the inference efficiency, an in-network candidate early elimination module is proposed based on the strong similarity prior calculated in the one-stream framework. As a unified framework, OSTrack achieves state-of-the-art performance on multiple benchmarks, in particular, it shows impressive results on the one-shot tracking benchmark GOT-10k, i.e., achieving 73.7% AO, improving the existing best result (SwinTrack) by 4.3\%. Besides, our method maintains a good performance-speed trade-off and shows faster convergence. The code and models are available at https://github.com/botaoye/OSTrack.

cs.CV↗

arXiv2022

Absolute frequency measurement of the 87Sr optical lattice clock at NTSC using International Atomic Time

We report the absolute frequency measurement of the 5s2 1S0-5s5p 3P0 transition in 87Sr optical lattice clock (Sr1) at National Time Service Center (NTSC). Its systematic frequency shifts are evaluated carefully with a total relative uncertainty of 5.1E10-17. The measured absolute frequency is 429 228 004 229 872.91(18) Hz with a relative uncertainty of 4.13E10-16, with reference to the ensemble of primary and secondary frequency standards published in the Circular T bulletin by BIPM through a global navigation satellite system (GNSS) link.

physics.atom-ph↗

arXiv2022

An upper bound of the numbers of minimally intersecting filling coherent pairs

Let $S_g$ denoting the genus $g$ closed orientable surface. An {\em origami} (or flat structure) on $S_g$ is obtained from a finite collection of unit Euclidean squares by gluing each right edge to a left one and each top edge to a bottom one. Coherent filling pairs of simple closed curves, $(α,β)$ in $S_g$ are pairs for which their minimal intersection is equal to their algebraic intersection. And, a minimally intersecting filling of $(α,β)$ in $S_g$ is a pair whose intersection number is the minimal among all filling pairs of $S_g$. A coherent pair of curves is naturally associated with an origami on $S_g$, and a minimally intersecting filling coherent pair of curves has the smallest number of squares in all origamis on $S_g$. Our main result introduce an algorithm to count the numbers of minimal filling pairs on $S_g$, and establish a new upper bound of this count using Ménage Problem.

math.GT↗

arXiv2022

Efficient geodesics in the curve complex and their dot graphs

For the complex of curves of a closed orientable surface of genus $g$, $\mathcal{C}(S_{g>1})$, the notion of efficient geodesic in was introduced in arXiv:1408.4133. There it was established that there always exists (finitely many) efficient geodesics between any two vertices, $ v_α , v_β \in \mathcal{C}(S_g)$, representing homotopy classes of simple closed curves, $α, β\subset S_g$. The main tool for used in establishing the existence of efficient geodesic was a dot graph, a booking scheme for recording the intersection pattern of a reference arc, $γ\subset S_g$, with the simple closed curves associated with the vertices of geodesic path in the zero skeleton, $\mathcal{C}^0(S_g)$. In particular, for an efficient geodesic between $v_α$ and $v_β$ of length $d \geq 3$, it was shown that any curve corresponding to the vertex that is distance one from $v_α$ intersects any $γ$ at most $d -2$ times. In this note we make a more expansive study of the characterizing "shape" of the dot graphs over the entire set of vertices in an efficient geodesic edge-path. The key take away of this study is that the shape of a dot graph for any efficient geodesic is contained within a spindle shape region. Since the Nielson-Thurston coordinates of any curve on $S_g$ are directly derived from its intersection number with finitely many reference arcs, spindle shaped dot graphs control the coordinate behavior of curves associated with the vertices of an efficient geodesic.

math.GT↗

arXiv2022

Clothes-Changing Person Re-identification with RGB Modality Only

The key to address clothes-changing person re-identification (re-id) is to extract clothes-irrelevant features, e.g., face, hairstyle, body shape, and gait. Most current works mainly focus on modeling body shape from multi-modality information (e.g., silhouettes and sketches), but do not make full use of the clothes-irrelevant information in the original RGB images. In this paper, we propose a Clothes-based Adversarial Loss (CAL) to mine clothes-irrelevant features from the original RGB images by penalizing the predictive power of re-id model w.r.t. clothes. Extensive experiments demonstrate that using RGB images only, CAL outperforms all state-of-the-art methods on widely-used clothes-changing person re-id benchmarks. Besides, compared with images, videos contain richer appearance and additional temporal information, which can be used to model proper spatiotemporal patterns to assist clothes-changing re-id. Since there is no publicly available clothes-changing video re-id dataset, we contribute a new dataset named CCVID and show that there exists much room for improvement in modeling spatiotemporal information. The code and new dataset are available at: https://github.com/guxinqian/Simple-CCReID.

cs.CV↗

arXiv2022

Degenerate Rabi spectroscopy of the Floquet engineered optical lattice clock

Simulating physics with large SU(N) symmetry is one of the unique advantages of Alkaline-earth atoms.Introducing periodical driving modes to the system may provide more rich SU(N) physics that static one could not reach. However, whether the driving modes will break the SU(N) symmetry is still lack of discussions. Here we experimentally study a Floquet engineered degenerate Sr-87 optical lattice clock (OLC) by periodically shaking the lattice. With the help of Rabi spectroscopy, we find that the atoms at different Zeeman sublevels are tuned by the same driven function. Meanwhile, our experimental results suggest that uniform distribution among the sublevels will not change despite the driving. Our experimental demonstrations may pave the way to implementation of FE on tailoring the SU(N) physics in OLC system.

cond-mat.quant-gas↗