Search

Recent technological advances have led to contemporary applications that demand real-time processing and analysis of sequentially arriving tensor data. Traditional offline learning, involving the storage and utilization of all data in each computational iteration, becomes impractical for high-dimensional tensor data due to its voluminous size. Furthermore, existing low-rank tensor methods lack the capability for statistical inference in an online fashion, which is essential for real-time predictions and informed decision-making. This paper addresses these challenges by introducing a novel online inference framework for low-rank tensor learning. Our approach employs Stochastic Gradient Descent (SGD) to enable efficient real-time data processing without extensive memory requirements, thereby significantly reducing computational demands. We establish a non-asymptotic convergence result for the online low-rank SGD estimator, nearly matches the minimax optimal rate of estimation error in offline models that store all historical data. Building upon this foundation, we propose a simple yet powerful online debiasing approach for sequential statistical inference in low-rank tensor learning. The entire online procedure, covering both estimation and inference, eliminates the need for data splitting or storing historical data, making it suitable for on-the-fly hypothesis testing. Given the sequential nature of our data collection, traditional analyses relying on offline methods and sample splitting are inadequate. In our analysis, we control the sum of constructed super-martingales to ensure estimates along the entire solution path remain within the benign region. Additionally, a novel spectral representation tool is employed to address statistical dependencies among iterative estimates, establishing the desired asymptotic normality.

Near-concentric cavities are excellent tools for enhancing atom--light interaction as they combine a small mode volume with a large optical access for atom manipulation. However, they are sensitive to longitudinal and transverse misalignment. To address this sensitivity, we present a compact near-concentric optical cavity system with a residual cavity length variation $\delta L_{C, rms}$=36(9) pm. A key part of this system is a cage-like tensegrity mirror support structure that allows to correct for longitudinal and transverse misalignment. The system is stable enough to allow the use of mirrors with higher cavity finesse to enhance the atom--light coupling strength in cavity-QED applications., Comment: 5 pages, 7 figures

Quantum key distribution (QKD) holds the potential to establish secure keys over long distances. The distance of point-to-point QKD secure key distribution is primarily impeded by the transmission loss inherent to the channel. In the quest to realize a large-scale quantum network, increasing the QKD distance under current technology is of great research interest. Here we adopt the 3-intensity sending-or-not-sending twin-field QKD (TF-QKD) protocol with the actively-odd-parity-pairing method. The experiment demonstrates the feasibility of secure QKD over a 1002 km fibre channel considering the finite size effect. The secure key rate is $3.11\times10^{-12}$ per pulse at this distance. Furthermore, by optimizing parameters for shorter fiber distances, we conducted performance tests on key distribution for fiber lengths ranging from 202 km to 505 km. Notably, the secure key rate for the 202 km, the normal distance between major cities, reached 111.74 kbps., Comment: 18 pages, 3 figures

Artificial Intelligence(AI) widely applies in Image Classification and Recognition, Text Understanding and Natural Language Processing, which makes great progress. In this paper, we introduced AI into the fruit quality detection field. We designed a fruit sugar degree regression model using an Artificial Neural Network based on spectra of fruits within the visible/near-infrared(V/NIR)range. After analysis of fruit spectra, we innovatively proposed a new neural network structure: low layers consist of a Multilayer Perceptron(MLP), a middle layer is a 2-dimensional correlation matrix layer, and high layers consist of several Convolutional Neural Network(CNN) layers. In this study, we used fruit sugar value as a detection target, collecting two fruits called Gan Nan Navel and Tian Shan Pear as samples, doing experiments respectively, and comparing their results. We used Analysis of Variance(ANOVA) to evaluate the reliability of the dataset we collected. Then, we tried multiple strategies to process spectrum data, evaluating their effects. In this paper, we tried to add Wavelet Decomposition(WD) to reduce feature dimensions and a Genetic Algorithm(GA) to find excellent features. Then, we compared Neural Network models with traditional Partial Least Squares(PLS) based models. We also compared the neural network structure we designed(MLP-CNN) with other traditional neural network structures. In this paper, we proposed a new evaluation standard derived from dataset standard deviation(STD) for evaluating detection performance, validating the viability of using an artificial neural network model to do fruit sugar degree nondestructive detection.

$T\bar T$ deformed CFTs with positive deformation parameter have been proposed to be holographically dual to Einstein gravity in a glue-on $\mathrm{AdS}_3$ spacetime. The latter is constructed from AdS$_3$ by gluing a patch of an auxiliary AdS$_3^*$ spacetime to its asymptotic boundary. In this work, we propose a glue-on version of the Ryu-Takayanagi formula, which is given by the signed area of an extremal surface. The extremal surface is anchored at the endpoints of an interval on a cutoff surface in the glue-on geometry. It consists of an RT surface lying in the AdS$_3$ part of the spacetime and its extension to the AdS$_3^*$ region. The signed area is the length of the RT surface minus the length of the segments in AdS$_3^*$. We find that the Ryu-Takayanagi formula with the signed area reproduces the entanglement entropy of a half interval for $T\bar T$-deformed CFTs on the sphere. We then study the properties of extremal surfaces on various glue-on geometries, including Poincar\'e $\mathrm{AdS}_3$, global $\mathrm{AdS}_3$, and the BTZ black hole. When anchored on multiple intervals at the boundary, the signed area of the minimal surfaces undergoes phase transitions with novel properties. In all of these examples, we find that the glue-on extremal surfaces exhibit a minimum length related to the deformation parameter of $T\bar T$-deformed CFTs., Comment: 39 pages, 9 figures; v2: added references; v3: fixed typos, matches published version

Deriving reliable region-word alignment from image-text pairs is critical to learn object-level vision-language representations for open-vocabulary object detection. Existing methods typically rely on pre-trained or self-trained vision-language models for alignment, which are prone to limitations in localization accuracy or generalization capabilities. In this paper, we propose CoDet, a novel approach that overcomes the reliance on pre-aligned vision-language space by reformulating region-word alignment as a co-occurring object discovery problem. Intuitively, by grouping images that mention a shared concept in their captions, objects corresponding to the shared concept shall exhibit high co-occurrence among the group. CoDet then leverages visual similarities to discover the co-occurring objects and align them with the shared concept. Extensive experiments demonstrate that CoDet has superior performances and compelling scalability in open-vocabulary detection, e.g., by scaling up the visual backbone, CoDet achieves 37.0 $\text{AP}^m_{novel}$ and 44.7 $\text{AP}^m_{all}$ on OV-LVIS, surpassing the previous SoTA by 4.2 $\text{AP}^m_{novel}$ and 9.8 $\text{AP}^m_{all}$. Code is available at https://github.com/CVMI-Lab/CoDet., Comment: Accepted by NeurIPS 2023

Counterfactual reasoning, a fundamental aspect of human cognition, involves contemplating alternatives to established facts or past events, significantly enhancing our abilities in planning and decision-making. In light of the advancements in current multi-modal large language models, we explore their effectiveness in counterfactual reasoning. To facilitate this investigation, we introduce a novel dataset, C-VQA, specifically designed to test the counterfactual reasoning capabilities of modern multi-modal large language models. This dataset is constructed by infusing original questions with counterfactual presuppositions, spanning various types such as numerical and boolean queries. It encompasses a mix of real and synthetic data, representing a wide range of difficulty levels. Our thorough evaluations of contemporary vision-language models using this dataset have revealed substantial performance drops, with some models showing up to a 40% decrease, highlighting a significant gap between current models and human-like vision reasoning capabilities. We hope our dataset will serve as a vital benchmark for evaluating the counterfactual reasoning capabilities of models. Code and dataset are publicly available at https://bzhao.me/C-VQA/.

With the Schwinger's proper-time formalism of the Nambu-Jona-Lasinio model, we investigate the finite volume effects in the presence of magnetic fields. Since the coupling constant $G$ can be influenced by strong magnetic fields, the model is solved with a running coupling constant $G(B)$ which is fitted by the lattice average $(\Sigma_u+\Sigma_d)/2$ and difference $\Sigma_u-\Sigma_d$. The investigation mainly focuses on the constituent quark mass and the thermal susceptibility depending on the magnetic fields, the temperatures and the finite sizes. For the model in finite or infinite volume, the magnetic fields can increase the constituent quark mass while the temperatures can decrease it inversely. There is a narrow range of the box length that makes the effects of finite volume perform prominently. The model will behave close to infinite volume limit for larger box length. It is shown that the influence of finite volume can be changed by magnetic fields and temperatures. Finally, we discuss the thermal susceptibility depending on the temperature in finite volume in the presence of magnetic fields., Comment: 13 pages, 6 figures

Automated code vulnerability detection has gained increasing attention in recent years. The deep learning (DL)-based methods, which implicitly learn vulnerable code patterns, have proven effective in vulnerability detection. The performance of DL-based methods usually relies on the quantity and quality of labeled data. However, the current labeled data are generally automatically collected, such as crawled from human-generated commits, making it hard to ensure the quality of the labels. Prior studies have demonstrated that the non-vulnerable code (i.e., negative labels) tends to be unreliable in commonly-used datasets, while vulnerable code (i.e., positive labels) is more determined. Considering the large numbers of unlabeled data in practice, it is necessary and worth exploring to leverage the positive data and large numbers of unlabeled data for more accurate vulnerability detection. In this paper, we focus on the Positive and Unlabeled (PU) learning problem for vulnerability detection and propose a novel model named PILOT, i.e., PositIve and unlabeled Learning mOdel for vulnerability deTection. PILOT only learns from positive and unlabeled data for vulnerability detection. It mainly contains two modules: (1) A distance-aware label selection module, aiming at generating pseudo-labels for selected unlabeled data, which involves the inter-class distance prototype and progressive fine-tuning; (2) A mixed-supervision representation learning module to further alleviate the influence of noise and enhance the discrimination of representations., Comment: This paper is accepted by ASE 2023

The rapid advancement of deep learning models often attributes to their ability to leverage massive training data. In contrast, such privilege has not yet fully benefited 3D deep learning, mainly due to the limited availability of large-scale 3D datasets. Merging multiple available data sources and letting them collaboratively train a single model is a potential solution. However, due to the large domain gap between 3D point cloud datasets, such mixed supervision could adversely affect the model's performance and lead to degenerated performance (i.e., negative transfer) compared to single-dataset training. In view of this challenge, we introduce Point Prompt Training (PPT), a novel framework for multi-dataset synergistic learning in the context of 3D representation learning that supports multiple pre-training paradigms. Based on this framework, we propose Prompt-driven Normalization, which adapts the model to different datasets with domain-specific prompts and Language-guided Categorical Alignment that decently unifies the multiple-dataset label spaces by leveraging the relationship between label text. Extensive experiments verify that PPT can overcome the negative transfer associated with synergistic learning and produce generalizable representations. Notably, it achieves state-of-the-art performance on each dataset using a single weight-shared model with supervised multi-dataset training. Moreover, when served as a pre-training framework, it outperforms other pre-training approaches regarding representation quality and attains remarkable state-of-the-art performance across over ten diverse downstream tasks spanning both indoor and outdoor 3D scenarios., Comment: CVPR 2024, code available at Pointcept (https://github.com/Pointcept/Pointcept)

Learning per-point semantic features from the hierarchical feature pyramid is essential for point cloud semantic segmentation. However, most previous methods suffered from ambiguous region features or failed to refine per-point features effectively, which leads to information loss and ambiguous semantic identification. To resolve this, we propose Retro-FPN to model the per-point feature prediction as an explicit and retrospective refining process, which goes through all the pyramid layers to extract semantic features explicitly for each point. Its key novelty is a retro-transformer for summarizing semantic contexts from the previous layer and accordingly refining the features in the current stage. In this way, the categorization of each point is conditioned on its local semantic pattern. Specifically, the retro-transformer consists of a local cross-attention block and a semantic gate unit. The cross-attention serves to summarize the semantic pattern retrospectively from the previous layer. And the gate unit carefully incorporates the summarized contexts and refines the current semantic features. Retro-FPN is a pluggable neural network that applies to hierarchical decoders. By integrating Retro-FPN with three representative backbones, including both point-based and voxel-based methods, we show that Retro-FPN can significantly improve performance over state-of-the-art backbones. Comprehensive experiments on widely used benchmarks can justify the effectiveness of our design. The source is available at https://github.com/AllenXiangX/Retro-FPN, Comment: Accepted by ICCV 2023

Cross-corpus speech emotion recognition (SER) seeks to generalize the ability of inferring speech emotion from a well-labeled corpus to an unlabeled one, which is a rather challenging task due to the significant discrepancy between two corpora. Existing methods, typically based on unsupervised domain adaptation (UDA), struggle to learn corpus-invariant features by global distribution alignment, but unfortunately, the resulting features are mixed with corpus-specific features or not class-discriminative. To tackle these challenges, we propose a novel Emotion Decoupling aNd Alignment learning framework (EMO-DNA) for cross-corpus SER, a novel UDA method to learn emotion-relevant corpus-invariant features. The novelties of EMO-DNA are two-fold: contrastive emotion decoupling and dual-level emotion alignment. On one hand, our contrastive emotion decoupling achieves decoupling learning via a contrastive decoupling loss to strengthen the separability of emotion-relevant features from corpus-specific ones. On the other hand, our dual-level emotion alignment introduces an adaptive threshold pseudo-labeling to select confident target samples for class-level alignment, and performs corpus-level alignment to jointly guide model for learning class-discriminative corpus-invariant features across corpora. Extensive experimental results demonstrate the superior performance of EMO-DNA over the state-of-the-art methods in several cross-corpus scenarios. Source code is available at https://github.com/Jiaxin-Ye/Emo-DNA., Comment: Accepted by ACM MM 2023

The intact transfer and assembly of two-dimensional (2D) materials and their heterostructures are critical for their integration into advanced electronic and optical devices. Herein, we report a facile technique called volatile polymer stamping (VPS) to achieve efficient transfer of 2D materials and assembly of large-scale heterojunctions with clean interfaces. The central feature of the VPS technique is the use of volatile polyphthalaldehyde (PPA) together with hydrophobic polystyrene (PS). While PS enables the direct delamination of 2D materials from hydrophilic substrates owing to water intercalation, PPA can protect 2D materials from solution attack and maintain their integrity during PS removal. Thereafter, PPA can be completely removed by thermal annealing at 180 {\deg}C. The proposed VPS technique overcomes the limitations of currently used transfer techniques, such as chemical etching during the delamination stage, solution tearing during cleaning, and contamination from polymer residues.

Discrimination of entangled states is an important element of quantum enhanced metrology. This typically requires low-noise detection technology. Such a challenge can be circumvented by introducing nonlinear readout process. Traditionally, this is realized by reversing the very dynamics that generates the entangled state, which requires a full control over the system evolution. In this work, we present nonlinear readout of highly entangled states by employing reinforcement learning (RL) to manipulate the spin-mixing dynamics in a spin-1 atomic condensate. The RL found results in driving the system towards an unstable fixed point, whereby the (to be sensed) phase perturbation is amplified by the subsequent spin-mixing dynamics. Working with a condensate of 10900 {87}^Rb atoms, we achieve a metrological gain of 6.97 dB beyond the classical precision limit. Our work would open up new possibilities in unlocking the full potential of entanglement caused quantum enhancement in experiments.

Electroweak dipole operators in the Standard Model Effective Field Theory (SMEFT) are important indirect probes of quantum effects of new physics beyond the Standard Model (SM), yet they remain poorly constrained by current experimental analyses for lack of interference with the SM amplitudes in constructing cross section observables. In this Letter, we point out that dipole operators flip fermion helicities so are ideally studied through single transverse spin asymmetries. We illustrate this at a future electron-positron collider with transversely polarized beams, where such effect exhibits as azimuthal $\cos\phi$ and $\sin\phi$ distributions which originate from the interference of the electron dipole operators with the SM and are linearly dependent on their Wilson coefficients. This new method can improve the current constraints on the electron dipole couplings by one to two orders of magnitude, without depending on other new physics operators, and can also simultaneously constrain both their real and imaginary parts, offering a new opportunity for probing potential $CP$-violating effects., Comment: 5 pages, 1 figure, accepted version by PRL

The expected shortfall is defined as the average over the tail below (or above) a certain quantile of a probability distribution. The expected shortfall regression provides powerful tools for learning the relationship between a response variable and a set of covariates while exploring the heterogeneous effects of the covariates. In the health disparity research, for example, the lower/upper tail of the conditional distribution of a health-related outcome, given high-dimensional covariates, is often of importance. Under sparse models, we propose the lasso-penalized expected shortfall regression and establish non-asymptotic error bounds, depending explicitly on the sample size, dimension, and sparsity, for the proposed estimator. To perform statistical inference on a covariate of interest, we propose a debiased estimator and establish its asymptotic normality, from which asymptotically valid tests can be constructed. We illustrate the finite sample performance of the proposed method through numerical studies and a data application on health disparity., Comment: R code for fitting the proposed method can be found at https://github.com/shushuzh/ES_highD.git

Prior studies generally focus on software vulnerability detection and have demonstrated the effectiveness of Graph Neural Network (GNN)-based approaches for the task. Considering the various types of software vulnerabilities and the associated different degrees of severity, it is also beneficial to determine the type of each vulnerable code for developers. In this paper, we observe that the distribution of vulnerability type is long-tailed in practice, where a small portion of classes have massive samples (i.e., head classes) but the others contain only a few samples (i.e., tail classes). Directly adopting previous vulnerability detection approaches tends to result in poor detection performance, mainly due to two reasons. First, it is difficult to effectively learn the vulnerability representation due to the over-smoothing issue of GNNs. Second, vulnerability types in tails are hard to be predicted due to the extremely few associated samples.To alleviate these issues, we propose a Long-taIled software VulnerABiLity typE classification approach, called LIVABLE. LIVABLE mainly consists of two modules, including (1) vulnerability representation learning module, which improves the propagation steps in GNN to distinguish node representations by a differentiated propagation method. A sequence-to-sequence model is also involved to enhance the vulnerability representations. (2) adaptive re-weighting module, which adjusts the learning weights for different types according to the training epochs and numbers of associated samples by a novel training loss.

In this paper, we address the problem of generalized category discovery (GCD), \ie, given a set of images where part of them are labelled and the rest are not, the task is to automatically cluster the images in the unlabelled data, leveraging the information from the labelled data, while the unlabelled data contain images from the labelled classes and also new ones. GCD is similar to semi-supervised learning (SSL) but is more realistic and challenging, as SSL assumes all the unlabelled images are from the same classes as the labelled ones. We also do not assume the class number in the unlabelled data is known a-priori, making the GCD problem even harder. To tackle the problem of GCD without knowing the class number, we propose an EM-like framework that alternates between representation learning and class number estimation. We propose a semi-supervised variant of the Gaussian Mixture Model (GMM) with a stochastic splitting and merging mechanism to dynamically determine the prototypes by examining the cluster compactness and separability. With these prototypes, we leverage prototypical contrastive learning for representation learning on the partially labelled data subject to the constraints imposed by the labelled data. Our framework alternates between these two steps until convergence. The cluster assignment for an unlabelled instance can then be retrieved by identifying its nearest prototype. We comprehensively evaluate our framework on both generic image classification datasets and challenging fine-grained object recognition datasets, achieving state-of-the-art performance., Comment: This paper is accepted at ICCV 2023

Pre-trained models of source code have gained widespread popularity in many code intelligence tasks. Recently, with the scaling of the model and corpus size, large language models have shown the ability of in-context learning (ICL). ICL employs task instructions and a few examples as demonstrations, and then inputs the demonstrations to the language models for making predictions. This new learning paradigm is training-free and has shown impressive performance in various natural language processing and code intelligence tasks. However, the performance of ICL heavily relies on the quality of demonstrations, e.g., the selected examples. It is important to systematically investigate how to construct a good demonstration for code-related tasks. In this paper, we empirically explore the impact of three key factors on the performance of ICL in code intelligence tasks: the selection, order, and number of demonstration examples. We conduct extensive experiments on three code intelligence tasks including code summarization, bug fixing, and program synthesis. Our experimental results demonstrate that all the above three factors dramatically impact the performance of ICL in code intelligence tasks. Additionally, we summarize our findings and provide takeaway suggestions on how to construct effective demonstrations, taking into account these three perspectives. We also show that a carefully-designed demonstration based on our findings can lead to substantial improvements over widely-used demonstration construction methods, e.g., improving BLEU-4, EM, and EM by at least 9.90%, 175.96%, and 50.81% on code summarization, bug fixing, and program synthesis, respectively, Comment: This paper is accepted by ASE 2023

Narrow linewidth is a long-pursuing goal in precision measurement and sensing. We propose a parity-time (PT )-symmetric feedback method to narrow the linewidths of resonance systems. By using a quadrature measurement-feedback loop, we transform a dissipative resonance system into a PT-symmetric system. Unlike the conventional PT-symmetric systems which typically require two or more modes, here the PT-symmetric feedback system contains only a single resonance mode, which greatly extends the scope of applications. The method enables remarkable linewidth narrowing and enhancement of measurement sensitivity. We illustrate the concept in a thermal ensemble of atoms, achieving a 48-fold narrowing of the magnetic resonance linewidth. By applying the method in magnetometry, we realize a 22-times improvement of the measurement sensitivity. This work opens the avenue for studying non-Hermitian physics and high-precision measurements in resonance systems with feedback., Comment: 5 pages, 5 figures

The thermodynamics of finite size quark matter in the quasiparticle model is self-consistently constructed by an effective bag function, which presents the medium effect to the confinement. We obtained completely analytic surface tension in the strong magnetic field with the multiple reflection expansion. The anisotropic structure is demonstrated by the splitting of the longitudinal and transverse surface tensions. The anisotropy of the surface tension could be enhanced by an increase of the magnetic field. The analytical surface tension is modified by an additional term related to the bag function. For strong enough magnetic fields, the increase of the longitudinal surface tension is proportional to the magnetic field.On the contrary, the transverse component vanishes due to all quarks locating in the lowest landau level., Comment: 9 pages, 5 figures