Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
22works
0followers
18topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

22 published item(s)

preprint2026arXiv

Focus on the Core: Empowering Diffusion Large Language Models by Self-Contrast

The iterative denoising paradigm of Diffusion Large Language Models (DLMs) endows them with a distinct advantage in global context modeling. However, current decoding strategies fail to leverage this capability, typically exhibiting a local preference that overlooks the heterogeneous information density within the context, ultimately degrading generation quality. To address this limitation, we systematically investigate high-information-density (HD) tokens and present two key findings: (1) explicitly conditioning on HD tokens substantially improves output quality; and (2) HD tokens exhibit an early-decoding tendency, converging earlier than surrounding tokens. Motivated by these findings, we propose Focus on the Core \textbf{(FoCore)}, a training-free decoding strategy that utilizes HD tokens in a self-contrast manner, wherein HD tokens are temporarily remasked as negative samples, to guide generation. We further introduce FoCore\_Accelerate \textbf{(FoCore\_A)}, an efficient variant that, upon detecting HD token convergence, performs parallel decoding over stable candidates within a local context window, substantially accelerating generation. Extensive experiments on math, code and logical reasoning benchmarks demonstrate that FoCore consistently improves generation quality and efficiency across both LLaDA and Dream backbones. For instance, on HumanEval, FoCore improves pass@1 from 39.02 to 42.68 over standard Classifier-Free Guidance, while FoCore-A reduces the number of decoding steps by 2.07x and per-sample latency from 20.76s to 8.64s (-58.4\%).

preprint2023arXiv

Towards Knowledge-Intensive Text-to-SQL Semantic Parsing with Formulaic Knowledge

In this paper, we study the problem of knowledge-intensive text-to-SQL, in which domain knowledge is necessary to parse expert questions into SQL queries over domain-specific tables. We formalize this scenario by building a new Chinese benchmark KnowSQL consisting of domain-specific questions covering various domains. We then address this problem by presenting formulaic knowledge, rather than by annotating additional data examples. More concretely, we construct a formulaic knowledge bank as a domain knowledge base and propose a framework (ReGrouP) to leverage this formulaic knowledge during parsing. Experiments using ReGrouP demonstrate a significant 28.2% improvement overall on KnowSQL.

preprint2022arXiv

Decoupled IoU Regression for Object Detection

Non-maximum suppression (NMS) is widely used in object detection pipelines for removing duplicated bounding boxes. The inconsistency between the confidence for NMS and the real localization confidence seriously affects detection performance. Prior works propose to predict Intersection-over-Union (IoU) between bounding boxes and corresponding ground-truths to improve NMS, while accurately predicting IoU is still a challenging problem. We argue that the complex definition of IoU and feature misalignment make it difficult to predict IoU accurately. In this paper, we propose a novel Decoupled IoU Regression (DIR) model to handle these problems. The proposed DIR decouples the traditional localization confidence metric IoU into two new metrics, Purity and Integrity. Purity reflects the proportion of the object area in the detected bounding box, and Integrity refers to the completeness of the detected object area. Separately predicting Purity and Integrity can divide the complex mapping between the bounding box and its IoU into two clearer mappings and model them independently. In addition, a simple but effective feature realignment approach is also introduced to make the IoU regressor work in a hindsight manner, which can make the target mapping more stable. The proposed DIR can be conveniently integrated with existing two-stage detectors and significantly improve their performance. Through a simple implementation of DIR with HTC, we obtain 51.3% AP on MS COCO benchmark, which outperforms previous methods and achieves state-of-the-art.

preprint2022arXiv

Federated Self-supervised Learning for Video Understanding

The ubiquity of camera-enabled mobile devices has lead to large amounts of unlabelled video data being produced at the edge. Although various self-supervised learning (SSL) methods have been proposed to harvest their latent spatio-temporal representations for task-specific training, practical challenges including privacy concerns and communication costs prevent SSL from being deployed at large scales. To mitigate these issues, we propose the use of Federated Learning (FL) to the task of video SSL. In this work, we evaluate the performance of current state-of-the-art (SOTA) video-SSL techniques and identify their shortcomings when integrated into the large-scale FL setting simulated with kinetics-400 dataset. We follow by proposing a novel federated SSL framework for video, dubbed FedVSSL, that integrates different aggregation strategies and partial weight updating. Extensive experiments demonstrate the effectiveness and significance of FedVSSL as it outperforms the centralized SOTA for the downstream retrieval task by 6.66% on UCF-101 and 5.13% on HMDB-51.

preprint2022arXiv

Federated Self-supervised Speech Representations: Are We There Yet?

The ubiquity of microphone-enabled devices has lead to large amounts of unlabelled audio data being produced at the edge. The integration of self-supervised learning (SSL) and federated learning (FL) into one coherent system can potentially offer data privacy guarantees while also advancing the quality and robustness of speech representations. In this paper, we provide a first-of-its-kind systematic study of the feasibility and complexities for training speech SSL models under FL scenarios from the perspective of algorithms, hardware, and systems limits. Despite the high potential of their combination, we find existing system constraints and algorithmic behaviour make SSL and FL systems nearly impossible to build today. Yet critically, our results indicate specific performance bottlenecks and research opportunities that would allow this situation to be reversed. While our analysis suggests that, given existing trends in hardware, hybrid SSL and FL speech systems will not be viable until 2027. We believe this study can act as a roadmap to accelerate work towards reaching this milestone much earlier.

preprint2022arXiv

Flower: A Friendly Federated Learning Research Framework

Federated Learning (FL) has emerged as a promising technique for edge devices to collaboratively learn a shared prediction model, while keeping their training data on the device, thereby decoupling the ability to do machine learning from the need to store the data in the cloud. However, FL is difficult to implement realistically, both in terms of scale and systems heterogeneity. Although there are a number of research frameworks available to simulate FL algorithms, they do not support the study of scalable FL workloads on heterogeneous edge devices. In this paper, we present Flower -- a comprehensive FL framework that distinguishes itself from existing platforms by offering new facilities to execute large-scale FL experiments and consider richly heterogeneous FL device scenarios. Our experiments show Flower can perform FL experiments up to 15M in client size using only a pair of high-end GPUs. Researchers can then seamlessly migrate experiments to real devices to examine other parts of the design space. We believe Flower provides the community with a critical new tool for FL study and development.

preprint2022arXiv

HiTab: A Hierarchical Table Dataset for Question Answering and Natural Language Generation

Tables are often created with hierarchies, but existing works on table reasoning mainly focus on flat tables and neglect hierarchical tables. Hierarchical tables challenge existing methods by hierarchical indexing, as well as implicit relationships of calculation and semantics. This work presents HiTab, a free and open dataset to study question answering (QA) and natural language generation (NLG) over hierarchical tables. HiTab is a cross-domain dataset constructed from a wealth of statistical reports (analyses) and Wikipedia pages, and has unique characteristics: (1) nearly all tables are hierarchical, and (2) both target sentences for NLG and questions for QA are revised from original, meaningful, and diverse descriptive sentences authored by analysts and professions of reports. (3) to reveal complex numerical reasoning in statistical analyses, we provide fine-grained annotations of entity and quantity alignment. HiTab provides 10,686 QA pairs and descriptive sentences with well-annotated quantity and entity alignment on 3,597 tables with broad coverage of table hierarchies and numerical reasoning types. Targeting hierarchical structure, we devise a novel hierarchy-aware logical form for symbolic reasoning over tables, which shows high effectiveness. Targeting complex numerical reasoning, we propose partially supervised training given annotations of entity and quantity alignment, which helps models to largely reduce spurious predictions in the QA task. In the NLG task, we find that entity and quantity alignment also helps NLG models to generate better results in a conditional generation setting. Experiment results of state-of-the-art baselines suggest that this dataset presents a strong challenge and a valuable benchmark for future research.

preprint2022arXiv

NFormer: Robust Person Re-identification with Neighbor Transformer

Person re-identification aims to retrieve persons in highly varying settings across different cameras and scenarios, in which robust and discriminative representation learning is crucial. Most research considers learning representations from single images, ignoring any potential interactions between them. However, due to the high intra-identity variations, ignoring such interactions typically leads to outlier features. To tackle this issue, we propose a Neighbor Transformer Network, or NFormer, which explicitly models interactions across all input images, thus suppressing outlier features and leading to more robust representations overall. As modelling interactions between enormous amount of images is a massive task with lots of distractors, NFormer introduces two novel modules, the Landmark Agent Attention, and the Reciprocal Neighbor Softmax. Specifically, the Landmark Agent Attention efficiently models the relation map between images by a low-rank factorization with a few landmarks in feature space. Moreover, the Reciprocal Neighbor Softmax achieves sparse attention to relevant -- rather than all -- neighbors only, which alleviates interference of irrelevant representations and further relieves the computational burden. In experiments on four large-scale datasets, NFormer achieves a new state-of-the-art. The code is released at \url{https://github.com/haochenheheda/NFormer}.

preprint2022arXiv

Occluded Video Instance Segmentation: A Benchmark

Can our video understanding systems perceive objects when a heavy occlusion exists in a scene? To answer this question, we collect a large-scale dataset called OVIS for occluded video instance segmentation, that is, to simultaneously detect, segment, and track instances in occluded scenes. OVIS consists of 296k high-quality instance masks from 25 semantic categories, where object occlusions usually occur. While our human vision systems can understand those occluded instances by contextual reasoning and association, our experiments suggest that current video understanding systems cannot. On the OVIS dataset, the highest AP achieved by state-of-the-art algorithms is only 16.3, which reveals that we are still at a nascent stage for understanding objects, instances, and videos in a real-world scenario. We also present a simple plug-and-play module that performs temporal feature calibration to complement missing object cues caused by occlusion. Built upon MaskTrack R-CNN and SipMask, we obtain a remarkable AP improvement on the OVIS dataset. The OVIS dataset and project code are available at http://songbai.site/ovis .

preprint2022arXiv

UniSAr: A Unified Structure-Aware Autoregressive Language Model for Text-to-SQL

Existing text-to-SQL semantic parsers are typically designed for particular settings such as handling queries that span multiple tables, domains or turns which makes them ineffective when applied to different settings. We present UniSAr (Unified Structure-Aware Autoregressive Language Model), which benefits from directly using an off-the-shelf language model architecture and demonstrates consistently high performance under different settings. Specifically, UniSAr extends existing autoregressive language models to incorporate three non-invasive extensions to make them structure-aware: (1) adding structure mark to encode database schema, conversation context, and their relationships; (2) constrained decoding to decode well structured SQL for a given database schema; and (3) SQL completion to complete potential missing JOIN relationships in SQL based on database schema. On seven well-known text-to-SQL datasets covering multi-domain, multi-table and multi-turn, UniSAr demonstrates highly comparable or better performance to the most advanced specifically-designed text-to-SQL models. Importantly, our UniSAr is non-invasive, such that other core model advances in text-to-SQL can also adopt our extensions to further enhance performance.

preprint2022arXiv

ZeroFL: Efficient On-Device Training for Federated Learning with Local Sparsity

When the available hardware cannot meet the memory and compute requirements to efficiently train high performing machine learning models, a compromise in either the training quality or the model complexity is needed. In Federated Learning (FL), nodes are orders of magnitude more constrained than traditional server-grade hardware and are often battery powered, severely limiting the sophistication of models that can be trained under this paradigm. While most research has focused on designing better aggregation strategies to improve convergence rates and in alleviating the communication costs of FL, fewer efforts have been devoted to accelerating on-device training. Such stage, which repeats hundreds of times (i.e. every round) and can involve thousands of devices, accounts for the majority of the time required to train federated models and, the totality of the energy consumption at the client side. In this work, we present the first study on the unique aspects that arise when introducing sparsity at training time in FL workloads. We then propose ZeroFL, a framework that relies on highly sparse operations to accelerate on-device training. Models trained with ZeroFL and 95% sparsity achieve up to 2.3% higher accuracy compared to competitive baselines obtained from adapting a state-of-the-art sparse training framework to the FL setting.

preprint2021arXiv

Generation of entanglement between a highly wave-packet-tunable photon and a spin-wave memory in cold atoms

Controls of waveforms (pulse durations) of single photons are important tasks for effectively interconnecting disparate atomic memories in hybrid quantum networks. So far, the waveform control of single photon that is entangled with an atomic memory remains unexplored. Here, we demonstrated control of waveform length of the photon that is entangled with an atomic spin-wave memory by varying light-atom interaction time in cold atoms. The Bell parameter S as a function of the duration of photon pulse is measured, which shows that violations of Bell equality can be achieved for the photon pulse in the duration range from 40 ns to 50 us, where, S=2.64+/-0.02 and S=2.26+/-0.05 for the 40-ns and 50-μs durations, respectively. The measured results show that S parameter decreases with the increase in the pulse duration. We confirm that the increase in photon noise probability per pulse with the pulse-duration is responsible for the S decrease.

preprint2021arXiv

Intrinsic ferromagnetic and antiferromagnetic axion insulators in van der Waals materials Mn\emph{X}$_{2}$\emph{B}$_{2}$\emph{T}$_{6}$ family

The MnBi$_{2}$Te$_{4}$ family has attracted significant attention due to its rich topological states such as the quantum anomalous Hall (QAH) insulator state, the axion insulator state, and the magnetic Weyl semimetal state. Nevertheless, the intrinsic antiferromagnetic (AFM) interlayer coupling in MnBi$_{2}$Te$_{4}$ partly hinders the realization of "high-temperature" QAH effect. Here, by using first-principles electronic structure calculations, we design a new class of materials Mn\emph{X}$_{2}$\emph{B}$_{2}$\emph{T}$_{6}$ (\emph{X}=Ge, Sn, or Pb; \emph{B}=Sb or Bi; \emph{T}=Se or Te) based on the \emph{X}$_{2}$\emph{B}$_{2}$\emph{T}$_{5}$ structures rather than the Bi$_{2}$Te$_{3}$ family. We find that each septuple-layer Mn\emph{B}$_{2}$\emph{T}$_{4}$ is sandwiched by two [\emph{X}\emph{T}] layers, which may turn the AFM interlayer coupling into a ferromagnetic (FM) coupling. The calculations specifically demonstrate that \emph{MnGe}$_{2}$\emph{Sb}$_{2}$\emph{Te}$_{6}$, \emph{MnGe}$_{2}$\emph{Bi}$_{2}$\emph{Te}$_{6}$, and \emph{MnPb}$_{2}$\emph{Bi}$_{2}$\emph{Te}$_{6}$ are FM axion insulators, while MnGe$_{2}$Sb$_{2}$Se$_{6}$, MnGe$_{2}$Bi$_{2}$Se$_{6}$, MnSn$_{2}$Sb$_{2}$Te$_{6}$, and MnSn$_{2}$Bi$_{2}$Te$_{6}$ are A-type AFM axion insulators. These seven materials all have an out-of-plane easy axis of magnetization. The Mn\emph{X}$_{2}$\emph{B}$_{2}$\emph{T}$_{6}$ family thus offers a promising platform beyond the MnBi$_{2}$Te$_{4}$ family for the realization of quantized magnetoelectric effect and "high-temperature" QAH effect in future experiments.

preprint2020arXiv

1st Place Solutions for OpenImage2019 -- Object Detection and Instance Segmentation

This article introduces the solutions of the two champion teams, `MMfruit' for the detection track and `MMfruitSeg' for the segmentation track, in OpenImage Challenge 2019. It is commonly known that for an object detector, the shared feature at the end of the backbone is not appropriate for both classification and regression, which greatly limits the performance of both single stage detector and Faster RCNN \cite{ren2015faster} based detector. In this competition, we observe that even with a shared feature, different locations in one object has completely inconsistent performances for the two tasks. \textit{E.g. the features of salient locations are usually good for classification, while those around the object edge are good for regression.} Inspired by this, we propose the Decoupling Head (DH) to disentangle the object classification and regression via the self-learned optimal feature extraction, which leads to a great improvement. Furthermore, we adjust the soft-NMS algorithm to adj-NMS to obtain stable performance improvement. Finally, a well-designed ensemble strategy via voting the bounding box location and confidence is proposed. We will also introduce several training/inferencing strategies and a bag of tricks that give minor improvement. Given those masses of details, we train and aggregate 28 global models with various backbones, heads and 3+2 expert models, and achieves the 1st place on the OpenImage 2019 Object Detection Challenge on the both public and private leadboards. Given such good instance bounding box, we further design a simple instance-level semantic segmentation pipeline and achieve the 1st place on the segmentation challenge.

preprint2020arXiv

IMUTube: Automatic Extraction of Virtual on-body Accelerometry from Video for Human Activity Recognition

The lack of large-scale, labeled data sets impedes progress in developing robust and generalized predictive models for on-body sensor-based human activity recognition (HAR). Labeled data in human activity recognition is scarce and hard to come by, as sensor data collection is expensive, and the annotation is time-consuming and error-prone. To address this problem, we introduce IMUTube, an automated processing pipeline that integrates existing computer vision and signal processing techniques to convert videos of human activity into virtual streams of IMU data. These virtual IMU streams represent accelerometry at a wide variety of locations on the human body. We show how the virtually-generated IMU data improves the performance of a variety of models on known HAR datasets. Our initial results are very promising, but the greater promise of this work lies in a collective approach by the computer vision, signal processing, and activity recognition communities to extend this work in ways that we outline. This should lead to on-body, sensor-based HAR becoming yet another success story in large-dataset breakthroughs in recognition.

preprint2020arXiv

Robust Cross-View Gait Recognition with Evidence: A Discriminant Gait GAN (DiGGAN) Approach

Gait as a biometric trait has attracted much attention in many security and privacy applications such as identity recognition and authentication, during the last few decades. Because of its nature as a long-distance biometric trait, gait can be easily collected and used to identify individuals non-intrusively through CCTV cameras. However, it is very difficult to develop robust automated gait recognition systems, since gait may be affected by many covariate factors such as clothing, walking speed, camera view angle etc. Out of them, large view angle changes has been deemed as the most challenging factor as it can alter the overall gait appearance substantially. Existing works on gait recognition are far from enough to provide satisfying performances because of such view changes. Furthermore, very few works have considered evidences -- the demonstrable information revealing the reliabilities of decisions, which are regarded as important demands in machine learning-based recognition/authentication applications. To address these issues, in this paper we propose a Discriminant Gait Generative Adversarial Network, namely DiGGAN, which can effectively extract view-invariant features for cross-view gait recognition; and more importantly, to transfer gait images to different views -- serving as evidences and showing how the decisions have been made. Quantitative experiments have been conducted on the two most popular cross-view gait datasets, the OU-MVLP and CASIA-B, where the proposed DiGGAN has outperformed state-of-the-art methods. Qualitative analysis has also been provided and demonstrates the proposed DiGGAN's capability in providing evidences.

preprint2020arXiv

Three New Late-type Hypervelocity Star Candidates from Gaia DR2 with Refined Selection Criteria

Several dozen hypervelocity star (HVS) candidates have been reported based on the second data release of Gaia (Gaia DR2). However, it has been proven that the radial velocities of some Gaia HVS candidates are not reliable. In this paper, we employ refined astrometric criteria to re-examine Gaia DR2, arriving at a more reliable sample of HVS and high velocity star candidates than those found by previous authors.We develop a method called Binary Escape Probability Analysis to identify some HVS candidates. This method allows us to work with stars having only two epochs of measured radial velocity. These stars were usually discarded in previous similar studies. A scrutiny of our final results sheds light on selection effects present in our studies, which we propose to be the focus of future studies. In total, we find three late-type (2 G-type and 1 K-type) HVS and 21 high velocity star candidates, 3 and 11 of which are new, respectively. Judging by their historical trajectories, which we calculate, all three HVS candidates could not have had Galactic center origins. Further monitoring is required to confirm their status.

preprint2020arXiv

Ultra-high Hydrogen Storage Capacity of Holey Graphyne

Holey graphyne (HGY), a novel 2D single-crystalline carbon allotrope, was synthesized most recently by Castro-Stephens coupling reaction. The natural existing uniform periodic holes in the 2D carbon-carbon network demonstrate its tremendous potential application in the area of energy storage. Herein, we conducted density functional theory calculation to predict the hydrogen storage capacity of HGY sheet. It's found the Li-decorated single-layer HGY can serve as a promising candidate for hydrogen storage. Our numerical calculations demonstrate that Li atoms can bind strongly to the HGY sheet without the formation of Li clusters, and each Li atom can anchor four H2 molecules with the average adsorption energy about -0.22 eV/H2. The largest hydrogen storage capacity of the doped HGY sheet can arrive as high as 12.8 wt%, this value largely surpasses the target of the U. S. Department of Energy (9 wt%), showing the Li/HGY complex is an ideal hydrogen storage material at ambient conditions. In addition, we investigate the polarization mechanism of the storage media and and find that the polarization stemed from both the electric field induced by the ionic Li decorated on the HGY and the weak polarized hydrogen molecules dominated the H2 adsorption process.

preprint2019arXiv

An Empirical Fit for Viscoelastic Simulations of Tertiary Tides

Tertiary tides (TTs), or the continuous tidal distortion of the tertiary in a hierarchical triple system, can extract energy from the inner binary, inducing within it a proclivity to merge. Despite previous work on the subject, which established that it is significant for certain close triple systems, it is still not a well-understood process. A portion of our ignorance in this regard stems from our inability to integrate a simulation of this phenomenon into conventional stellar evolution codes, since full calculations of these tidal interactions are computationally expensive on stellar evolution timescales. Thus, to attain a better understanding of how these TTs act on longer timescales, an empirical expression of its effects as a function of parameters of the triple system involved is required. In our work, we evaluate the rate at which TTs extract energy from the inner binary within a series of constructed hierarchical triple systems under varying parameters, and study the rate at which the inner binary orbital separation shrinks as a function of those parameters. We find that this rate varies little with the absolute values of the masses of the three component objects, but is very sensitive to the mass ratio of the inner binary $q$, the tertiary radius $R_{\rm 3}$, the inner binary orbital separation $a_{\rm 1}$, the outer orbital separation $a_{\rm 2}$, and the viscoelastic relaxation time of the tertiary $τ$. More specifically, we find that the percentage by which $a_{\rm 1}$ shrinks per unit time can be reasonably approximated by (1/$a_{\rm 1}$)(d$a_{\rm 1}$/d$t$)=$\left(2.22{\times}10^{-8}{\rm yrs}^{-1}\right)4q\left(1+q\right)^{-2}(R_{\rm 3}/100{\rm R}_{\odot})^{5.2}(a_{\rm 1}/0.2{\rm AU})^{4.8}(a_{\rm 2}/2{\rm AU})^{-10.2}$ $(τ/0.534{\rm yrs})^{-1.0}$. We also provide tests of how precise this fitting function is.