Searcharxiv⌕ Search

arXiv subjects

Can Zhang

Publications and source records attributed to Can Zhang.

At least 73 records · Page 4Linked to original sources

MISS: Multi-Interest Self-Supervised Learning Framework for Click-Through Rate Prediction

CTR prediction is essential for modern recommender systems. Ranging from early factorization machines to deep learning based models in recent years, existing CTR methods focus on capturing useful feature interactions or mining important behavior patterns. Despite the effectiveness, we argue that these methods suffer from the risk of label sparsity (i.e., the user-item interactions are highly sparse with respect to the feature space), label noise (i.e., the collected user-item interactions are usually noisy), and the underuse of domain knowledge (i.e., the pairwise correlations between samples). To address these challenging problems, we propose a novel Multi-Interest Self-Supervised learning (MISS) framework which enhances the feature embeddings with interest-level self-supervision signals. With the help of two novel CNN-based multi-interest extractors,self-supervision signals are discovered with full considerations of different interest representations (point-wise and union-wise), interest dependencies (short-range and long-range), and interest correlations (inter-item and intra-item). Based on that, contrastive learning losses are further applied to the augmented views of interest representations, which effectively improves the feature representation learning. Furthermore, our proposed MISS framework can be used as an plug-in component with existing CTR prediction models and further boost their performances. Extensive experiments on three large-scale datasets show that MISS significantly outperforms the state-of-the-art models, by up to 13.55% in AUC, and also enjoys good compatibility with representative deep CTR models.

cs.IR↗

Analyticity and observability for fractional heat equation on $\mathbb{R}^n$

In this paper, we study quantitative spatial analytic bounds and unique continuation inequalities of solutions for fractional heat equations with an analytic lower order term on the whole space. At first, we show that the solution has a uniform positive analytic radius for all time, and the solution enjoys a log-type ultra-analytic bound if the coefficient is ultra-analytic. Second, we prove a Hölder type interpolation inequality on a thick set, with an explicit dependence on the analytic radius of coefficient. Finally, by the telescoping series method, we establish an observability inequality from a thick set. As a byproduct of the proof, we obtain observability inequalities in weighted spaces from a thick set for the classical heat equation with a lower order term.

math.AP↗

Quantitative unique continuation and observability on an equidistributed set for the diffusion equation in R^N

In this paper, we obtain a quantitative estimate of unique continuation and an observability inequality from an equidistributed set for solutions of the diffusion equation in the whole space RN. This kind of observability indicates that the total energy of solutions can be controlled by the energy localized in a measurable subset, which is equidistributed over the whole space. The proof of our results is based on an interesting reduction method [18, 22], as well as the propagation of smallness for the gradient of solutions to elliptic equations [24].

math.AP↗

CoLA: Weakly-Supervised Temporal Action Localization with Snippet Contrastive Learning

Weakly-supervised temporal action localization (WS-TAL) aims to localize actions in untrimmed videos with only video-level labels. Most existing models follow the "localization by classification" procedure: locate temporal regions contributing most to the video-level classification. Generally, they process each snippet (or frame) individually and thus overlook the fruitful temporal context relation. Here arises the single snippet cheating issue: "hard" snippets are too vague to be classified. In this paper, we argue that learning by comparing helps identify these hard snippets and we propose to utilize snippet Contrastive learning to Localize Actions, CoLA for short. Specifically, we propose a Snippet Contrast (SniCo) Loss to refine the hard snippet representation in feature space, which guides the network to perceive precise temporal boundaries and avoid the temporal interval interruption. Besides, since it is infeasible to access frame-level annotations, we introduce a Hard Snippet Mining algorithm to locate the potential hard snippets. Substantial analyses verify that this mining strategy efficaciously captures the hard snippets and SniCo Loss leads to more informative feature representation. Extensive experiments show that CoLA achieves state-of-the-art results on THUMOS'14 and ActivityNet v1.2 datasets. CoLA code is publicly available at https://github.com/zhang-can/CoLA.

cs.CV↗

Long-Short Temporal Modeling for Efficient Action Recognition

Efficient long-short temporal modeling is key for enhancing the performance of action recognition task. In this paper, we propose a new two-stream action recognition network, termed as MENet, consisting of a Motion Enhancement (ME) module and a Video-level Aggregation (VLA) module to achieve long-short temporal modeling. Specifically, motion representations have been proved effective in capturing short-term and high-frequency action. However, current motion representations are calculated from adjacent frames, which may have poor interpretation and bring useless information (noisy or blank). Thus, for short-term motions, we design an efficient ME module to enhance the short-term motions by mingling the motion saliency among neighboring segments. As for long-term aggregations, VLA is adopted at the top of the appearance branch to integrate the long-term dependencies across all segments. The two components of MENet are complementary in temporal modeling. Extensive experiments are conducted on UCF101 and HMDB51 benchmarks, which verify the effectiveness and efficiency of our proposed MENet.

cs.CV↗

SRF-Net: Selective Receptive Field Network for Anchor-Free Temporal Action Detection

Temporal action detection (TAD) is a challenging task which aims to temporally localize and recognize the human action in untrimmed videos. Current mainstream one-stage TAD approaches localize and classify action proposals relying on pre-defined anchors, where the location and scale for action instances are set by designers. Obviously, such an anchor-based TAD method limits its generalization capability and will lead to performance degradation when videos contain rich action variation. In this study, we explore to remove the requirement of pre-defined anchors for TAD methods. A novel TAD model termed as Selective Receptive Field Network (SRF-Net) is developed, in which the location offsets and classification scores at each temporal location can be directly estimated in the feature map and SRF-Net is trained in an end-to-end manner. Innovatively, a building block called Selective Receptive Field Convolution (SRFC) is dedicatedly designed which is able to adaptively adjust its receptive field size according to multiple scales of input information at each temporal location in the feature map. Extensive experiments are conducted on the THUMOS14 dataset, and superior results are reported comparing to state-of-the-art TAD approaches.

cs.CV↗

All You Need is a Second Look: Towards Arbitrary-Shaped Text Detection

Arbitrary-shaped text detection is a challenging task since curved texts in the wild are of the complex geometric layouts. Existing mainstream methods follow the instance segmentation pipeline to obtain the text regions. However, arbitraryshaped texts are difficult to be depicted through one single segmentation network because of the varying scales. In this paper, we propose a two-stage segmentation-based detector, termed as NASK (Need A Second looK), for arbitrary-shaped text detection. Compared to the traditional single-stage segmentation network, our NASK conducts the detection in a coarse-to-fine manner with the first stage segmentation spotting the rectangle text proposals and the second one retrieving compact representations. Specifically, NASK is composed of a Text Instance Segmentation (TIS) network (1st stage), a Geometry-aware Text RoI Alignment (GeoAlign) module, and a Fiducial pOint eXpression (FOX) module (2nd stage). Firstly, TIS extracts the augmented features with a novel Group Spatial and Channel Attention (GSCA) module and conducts instance segmentation to obtain rectangle proposals. Then, GeoAlign converts these rectangles into the fixed size and encodes RoI-wise feature representation. Finally, FOX disintegrates the text instance into serval pivotal geometrical attributes to refine the detection results. Extensive experimental results on three public benchmarks including Total-Text, SCUTCTW1500, and ICDAR 2015 verify that our NASK outperforms recent state-of-the-art methods.

cs.CV↗

RR-Net: Injecting Interactive Semantics in Human-Object Interaction Detection

Human-Object Interaction (HOI) detection devotes to learn how humans interact with surrounding objects. Latest end-to-end HOI detectors are short of relation reasoning, which leads to inability to learn HOI-specific interactive semantics for predictions. In this paper, we therefore propose novel relation reasoning for HOI detection. We first present a progressive Relation-aware Frame, which brings a new structure and parameter sharing pattern for interaction inference. Upon the frame, an Interaction Intensifier Module and a Correlation Parsing Module are carefully designed, where: a) interactive semantics from humans can be exploited and passed to objects to intensify interactions, b) interactive correlations among humans, objects and interactions are integrated to promote predictions. Based on modules above, we construct an end-to-end trainable framework named Relation Reasoning Network (abbr. RR-Net). Extensive experiments show that our proposed RR-Net sets a new state-of-the-art on both V-COCO and HICO-DET benchmarks and improves the baseline about 5.5% and 9.8% relatively, validating that this first effort in exploring relation reasoning and integrating interactive semantics has brought obvious improvement for end-to-end HOI detection.

cs.CV↗

Non-Autoregressive Coarse-to-Fine Video Captioning

It is encouraged to see that progress has been made to bridge videos and natural language. However, mainstream video captioning methods suffer from slow inference speed due to the sequential manner of autoregressive decoding, and prefer generating generic descriptions due to the insufficient training of visual words (e.g., nouns and verbs) and inadequate decoding paradigm. In this paper, we propose a non-autoregressive decoding based model with a coarse-to-fine captioning procedure to alleviate these defects. In implementations, we employ a bi-directional self-attention based network as our language model for achieving inference speedup, based on which we decompose the captioning procedure into two stages, where the model has different focuses. Specifically, given that visual words determine the semantic correctness of captions, we design a mechanism of generating visual words to not only promote the training of scene-related words but also capture relevant details from videos to construct a coarse-grained sentence "template". Thereafter, we devise dedicated decoding algorithms that fill in the "template" with suitable words and modify inappropriate phrasing via iterative refinement to obtain a fine-grained description. Extensive experiments on two mainstream video captioning benchmarks, i.e., MSVD and MSR-VTT, demonstrate that our approach achieves state-of-the-art performance, generates diverse descriptions, and obtains high inference efficiency. Our code is available at https://github.com/yangbang18/Non-Autoregressive-Video-Captioning.

cs.CV↗

Multi-Scale Cascading Network with Compact Feature Learning for RGB-Infrared Person Re-Identification

RGB-Infrared person re-identification (RGB-IR Re-ID) aims to match persons from heterogeneous images captured by visible and thermal cameras, which is of great significance in the surveillance system under poor light conditions. Facing great challenges in complex variances including conventional single-modality and additional inter-modality discrepancies, most of the existing RGB-IR Re-ID methods propose to impose constraints in image level, feature level or a hybrid of both. Despite the better performance of hybrid constraints, they are usually implemented with heavy network architecture. As a matter of fact, previous efforts contribute more as pioneering works in new cross-modal Re-ID area while leaving large space for improvement. This can be mainly attributed to: (1) lack of abundant person image pairs from different modalities for training, and (2) scarcity of salient modality-invariant features especially on coarse representations for effective matching. To address these issues, a novel Multi-Scale Part-Aware Cascading framework (MSPAC) is formulated by aggregating multi-scale fine-grained features from part to global in a cascading manner, which results in a unified representation containing rich and enhanced semantic features. Furthermore, a marginal exponential centre (MeCen) loss is introduced to jointly eliminate mixed variances from intra- and inter-modal examples. Cross-modality correlations can thus be efficiently explored on salient features for distinctive modality-invariant feature learning. Extensive experiments are conducted to demonstrate that the proposed method outperforms all the state-of-the-art by a large margin.

cs.CV↗

A uniform bound on costs of controlling semilinear heat equations on a sequence of increasing domains and its application

In this paper, we first prove a uniform upper bound on costs of null controls for semilinear heat equations with globally Lipschitz nonlinearity on a sequence of increasing domains, where the controls are acted on an equidistributed set that spreads out in the whole Euclidean space R^N . As an application, we then show the exactly null controllability for this semilinear heat equation in R^N . The main novelty here is that the upper bound on costs of null controls for such kind of equations in large but bounded domains can be made uniformly with respect to the sizes of domains under consideration. The latter is crucial when one uses a suitable approximation argument to derive the global null controllability for the semilinear heat equation in R^N . This allows us to overcome the well-known problem of the lack of compactness embedding arising in the study of null controllability for nonlinear PDEs in generally unbounded domains.

math.OC↗

PAN: Towards Fast Action Recognition via Learning Persistence of Appearance

Efficiently modeling dynamic motion information in videos is crucial for action recognition task. Most state-of-the-art methods heavily rely on dense optical flow as motion representation. Although combining optical flow with RGB frames as input can achieve excellent recognition performance, the optical flow extraction is very time-consuming. This undoubtably will count against real-time action recognition. In this paper, we shed light on fast action recognition by lifting the reliance on optical flow. Our motivation lies in the observation that small displacements of motion boundaries are the most critical ingredients for distinguishing actions, so we design a novel motion cue called Persistence of Appearance (PA). In contrast to optical flow, our PA focuses more on distilling the motion information at boundaries. Also, it is more efficient by only accumulating pixel-wise differences in feature space, instead of using exhaustive patch-wise search of all the possible motion vectors. Our PA is over 1000x faster (8196fps vs. 8fps) than conventional optical flow in terms of motion modeling speed. To further aggregate the short-term dynamics in PA to long-term dynamics, we also devise a global temporal fusion strategy called Various-timescale Aggregation Pooling (VAP) that can adaptively model long-range temporal relationships across various timescales. We finally incorporate the proposed PA and VAP to form a unified framework called Persistent Appearance Network (PAN) with strong temporal modeling ability. Extensive experiments on six challenging action recognition benchmarks verify that our PAN outperforms recent state-of-the-art methods at low FLOPs. Codes and models are available at: https://github.com/zhang-can/PAN-PyTorch.

cs.CV↗

Dirac surface states in superconductors: a dual topological proximity effect

In this paper we present scanning tunneling microscopy of Bi$_2$Se$_3$ with superconducting Nb deposited on the surface. We find that the topologically protected surface states of the Bi$_2$Se$_3$ leak into the superconducting over-layer, suggesting a dual topological proximity effect. Coupling between theses states and the Nb states leads to an effective pairing mechanism for the surface states, leading to a modified model for a topological superconductor in these systems. This model is consistent with fits between the experimental data and the theory.

cond-mat.supr-con↗

Observability inequalities for the heat equation with bounded potentials on the whole space

In this paper we establish an observability inequality for the heat equation with bounded potentials on the whole space. Roughly speaking, such a kind of inequality says that the total energy of solutions can be controlled by the energy localized in a subdomain, which is equidistributed over the whole space. The proof of this inequality is mainly adapted from the parabolic frequency function method, which plays an important role in proving the unique continuation property for solutions of parabolic equations. As an immediate application, we show that the null controllability holds for the heat equation with bounded potentials on the whole space.

math.AP↗

Learning Representations for Predicting Future Activities

Foreseeing the future is one of the key factors of intelligence. It involves understanding of the past and current environment as well as decent experience of its possible dynamics. In this work, we address future prediction at the abstract level of activities. We propose a network module for learning embeddings of the environment's dynamics in a self-supervised way. To take the ambiguities and high variances in the future activities into account, we use a multi-hypotheses scheme that can represent multiple futures. We demonstrate the approach by classifying future activities on the Epic-Kitchens and Breakfast datasets. Moreover, we generate captions that describe the future activities

cs.CV↗

Observability on lattice points for heat equations and applications

Observability inequalities on lattice points are established for non-negative solutions of the heat equation with potentials in the whole space. As applications, some controllability results of heat equations are derived by the above-mentioned observability inequalities.

math.OC↗

In-situ strain tuning of the Dirac surface states in Bi2Se3 films

Elastic strain has the potential for a controlled manipulation of the band gap and spin-polarized Dirac states of topological materials, which can lead to pseudo-magnetic-field effects, helical flat bands and topological phase transitions. However, practical realization of these exotic phenomena is challenging and yet to be achieved. Here, we show that the Dirac surface states of the topological insulator Bi2Se3 can be reversibly tuned by an externally applied elastic strain. Performing in-situ x-ray diffraction and in-situ angle-resolved photoemission spectroscopy measurements during tensile testing of epitaxial Bi2Se3 films bonded onto a flexible substrate, we demonstrate elastic strains of up to 2.1% and quantify the resulting reversible changes in the topological surface state. Our study establishes the functional relationship between the lattice and electronic structures of Bi2Se3 and, more generally, demonstrates a new route toward momentum-resolved mapping of strain-induced band structure changes.

cond-mat.mtrl-sci↗

Minimal time impulse control of the heat equation

The paper is concerned with a kind of minimal time control problem for the heat equation with impulse controls. The purpose of such a problem is to find an optimal impulse control (among certain control constraint set) steering the solution of the heat equation from a given initial state to a given target set as soon as possible. We will first study the existence and uniqueness of optimal solution for this problem. In the formulation of this problem, there are two parameters: one is the upper bound of the control constraint and the other one is the moment of impulse time. Then, we will establish the continuity of the minimal time function of this problem with respect to the above mentioned two parameters. Moreover, the convergence of the optimal control is also discussed.

math.OC↗