Search Results for author:
Found 63 papers, 24 papers with code
PCR-CG: Point Cloud Registration via Deep Color and Geometry
Different from previous methods that only use geometry representation, our module is specifically designed to effectively correlate color into geometry for the point cloud registration task.
Investigating Catastrophic Overfitting in Fast Adversarial Training: A Self-fitting Perspective
Based on self-fitting, we provide new insights into the existing methods to mitigate CO and extend CO to multi-step adversarial training.
Self-Ensemble Protection: Training Checkpoints Are Good Data Protectors
In this paper, we uncover them by model checkpoints' gradients, forming the proposed self-ensemble protection (SEP), which is very effective because (1) learning on examples ignored during normal training tends to yield DNNs ignoring normal examples; (2) checkpoints' cross-model gradients are close to orthogonal, meaning that they are as diverse as DNNs with different architectures.
Efficient Generalization Improvement Guided by Random Weight Perturbation
To fully uncover the great potential of deep neural networks (DNNs), various learning algorithms have been developed to improve the model's generalization ability.
On Multi-head Ensemble of Smoothed Classifiers for Certified Robustness
Randomized Smoothing (RS) is a promising technique for certified robustness, and recently in RS the ensemble of multiple deep neural networks (DNNs) has shown state-of-the-art performances.
FG-UAP: Feature-Gathering Universal Adversarial Perturbation
Deep Neural Networks (DNNs) are susceptible to elaborately designed perturbations, whether such perturbations are dependent or independent of images.
Random Fourier Features for Asymmetric Kernels
The theoretical foundation of RFFs is based on the Bochner theorem that relates symmetric, positive definite (PD) functions to probability measures.
Unifying Gradients to Improve Real-world Robustness for Deep Networks
The wide application of deep neural networks (DNNs) demands an increasing amount of attention to their real-world robustness, i. e., whether a DNN resists black-box adversarial attacks, among them score-based query attacks (SQAs) are the most threatening ones because of their practicalities and effectiveness: the attackers only need dozens of queries on model outputs to seriously hurt a victim network.
BYHE: A Simple Framework for Boosting End-to-end Video-based Heart Rate Measurement Network
Heart rate measuring based on remote photoplethysmography (rPPG) plays an important role in health caring, which estimates heart rate from facial video in a non-contact, less-constrained way.
Piecewise Linear Neural Networks and Deep Learning
To apply PWLNN methods, both the representation and the learning have long been studied.
Trainable Weight Averaging for Fast Convergence and Better Generalization
Recently, an interesting attempt is stochastic weight averaging (SWA), which significantly improves the generalization by simply averaging the solutions at the tail stage of training.
Adversarial Attack on Attackers: Post-Process to Mitigate Black-Box Score-Based Query Attacks
The score-based query attacks (SQAs) pose practical threats to deep neural networks by crafting adversarial perturbations within dozens of queries, only using the model's output scores.
One-Pixel Shortcut: on the Learning Preference of Deep Neural Networks
Based on OPS, we introduce an unlearnable dataset called CIFAR-10-S, which is indistinguishable from CIFAR-10 by humans but induces the trained model to extremely low accuracy.
Learning Perspective Deformation in X-Ray Transmission Imaging
The complementary view setting provides a practical way to identify perspectively deformed structures by assessing the deviation between the two views.
Learning with Asymmetric Kernels: Least Squares and Feature Interpretation
Asymmetric kernels naturally exist in real life, e. g., for conditional probability and directed graphs.
Subspace Adversarial Training
Single-step adversarial training (AT) has received wide attention as it proved to be both efficient and robust.
Semi-tensor Product-based TensorDecomposition for Neural Network Compression
Tucker decomposition, Tensor Train (TT) and Tensor Ring (TR) are common decomposition for low rank compression of deep neural networks.
A Generalized Framework for Edge-preserving and Structure-preserving Image Smoothing
The effectiveness and superior performance of our approach are validated through comprehensive experiments in a range of applications.
Adaptive Feature Alignment for Adversarial Training
Based on this observation, we propose the adaptive feature alignment (AFA) to generate features of arbitrary attacking strengths.
Query Attack by Multi-Identity Surrogates
Deep Neural Networks (DNNs) are acknowledged as vulnerable to adversarial attacks, while the existing black-box attacks require extensive queries on the victim DNN to achieve high success rates.
Dominant Patterns: Critical Features Hidden in Deep Neural Networks
As the name suggests, for a natural image, if we add the dominant pattern of a DNN to it, the output of this DNN is determined by the dominant pattern instead of the original image, i. e., DNN's prediction is the same with the dominant pattern's.
Residual Enhanced Multi-Hypergraph Neural Network
Hypergraphs are a generalized data structure of graphs to model higher-order correlations among entities, which have been successfully adopted into various research domains.
Towards Unbiased Random Features with Lower Variance For Stationary Indefinite Kernels
Random Fourier Features (RFF) demonstrate wellappreciated performance in kernel approximation for largescale situations but restrict kernels to be stationary and positive definite.
Weighted Neural Tangent Kernel: A Generalized and Improved Network-Induced Kernel
In this paper, we introduce the Weighted Neural Tangent Kernel (WNTK), a generalized and improved tool, which can capture an over-parameterized NN's training dynamics under different optimizers.
Low Dimensional Landscape Hypothesis is True: DNNs can be Trained in Tiny Subspaces
Deep neural networks (DNNs) usually contain massive parameters, but there is redundancy such that it is guessed that the DNNs could be trained in low-dimensional subspaces.
Measuring the Transferability of $\ell_\infty$ Attacks by the $\ell_2$ Norm
Deep neural networks could be fooled by adversarial examples with trivial differences to original samples.
Learning Tubule-Sensitive CNNs for Pulmonary Airway and Artery-Vein Segmentation in CT
Training convolutional neural networks (CNNs) for segmentation of pulmonary airway, artery, and vein is challenging due to sparse supervisory signals caused by the severe class imbalance between tubular targets and background.
Towards a Unified Quadrature Framework for Large-Scale Kernel Machines
In this paper, we develop a quadrature framework for large-scale kernel machines via a numerical integration representation.
Towards Robust Neural Networks via Orthogonal Diversity
Despite of the efficiency in defending specific attacks, adversarial training is benefited from the data augmentation, which does not contribute to the robustness of DNN itself and usually suffers from accuracy drop on clean data as well as inefficiency in unknown attacks.
One-shot Distributed Algorithm for Generalized Eigenvalue Problem
Nowadays, more and more datasets are stored in a distributed way for the sake of memory storage or data privacy.
Learn Robust Features via Orthogonal Multi-Path
To defend adversarial attacks, we design a block containing multiple paths to learn robust features and the parameters of these paths are required to be orthogonal with each other.
End-to-end Kernel Learning via Generative Random Fourier Features
In the second-stage process, a linear learner is conducted with respect to the mapped random features.
Relevance Attack on Detectors
This paper focuses on high-transferable adversarial attacks on detectors, which are hard to attack in a black-box manner, because of their multiple-output characteristics and the diversity across architectures.
Analysis of Regularized Least Squares in Reproducing Kernel Krein Spaces
In this paper, we study the asymptotic properties of regularized least squares with indefinite kernels in reproducing kernel Krein spaces (RKKS).
Fast Learning in Reproducing Kernel Krein Spaces via Signed Measures
In this paper, we attempt to solve a long-lasting open question for non-positive definite (non-PD) kernels in machine learning community: can a given non-PD kernel be decomposed into the difference of two PD kernels (termed as positive decomposition)?
One-shot Distibuted Algorithm for PCA with RBF Kernels
This letter proposes a one-shot algorithm for feature-distributed kernel PCA.
Sparse Generalized Canonical Correlation Analysis: Distributed Alternating Iteration based Approach
To overcome this limitation, in this paper, we propose a sparse generalized canonical correlation analysis (GCCA), which could detect the latent relations of multiview data with sparse structures.
Random Features for Kernel Approximation: A Survey on Algorithms, Theory, and Beyond
This survey may serve as a gentle introduction to this topic, and as a users' guide for practitioners interested in applying the representative algorithms and understanding theoretical results under various technical assumptions.
Adversarial Imitation Attack
Then, the adversarial examples generated by the imitation model are utilized to fool the attacked model.
Stereo Endoscopic Image Super-Resolution Using Disparity-Constrained Parallel Attention
In particular, we incorporate a disparity-based constraint mechanism into the generation of SR images in a deep neural network framework with an additional atrous parallax-attention modules.
Type I Attack for Generative Models
To implement the Type I attack, we destroy the original one by increasing the distance in input space while keeping the output similar because different inputs may correspond to similar features for the property of deep neural network.
Double Backpropagation for Training Autoencoders against Adversarial Attack
We restrict the gradient from the reconstruction image to the original one so that the autoencoder is not sensitive to trivial perturbation produced by the adversarial attack.
HRFA: High-Resolution Feature-based Attack
Adversarial attacks have long been developed for revealing the vulnerability of Deep Neural Networks (DNNs) by adding imperceptible perturbations to the input.
Universal Adversarial Attack on Attention and the Resulting Dataset DAmageNet
AoA enjoys a significant increase in transferability when the traditional cross entropy loss is replaced with the attention loss.
Mixed-Precision Quantized Neural Network with Progressively Decreasing Bitwidth For Image Classification and Object Detection
In addition, the results also demonstrate that the higher-precision bottom layers could boost the 1-bit network performance appreciably due to a better preservation of the original image information while the lower-precision posterior layers contribute to the regularization of $k-$bit networks.
DAmageNet: A Universal Adversarial Dataset
Adversarial samples are similar to the clean ones, but are able to cheat the attacked DNN to produce incorrect predictions in high confidence.
Random Fourier Features via Fast Surrogate Leverage Weighted Sampling
In this paper, we propose a fast surrogate leverage weighted sampling strategy to generate refined random Fourier features for kernel approximation.
Deep Kernel Learning via Random Fourier Features
On small datasets (less than 1000 samples), for which deep learning is generally not suitable due to overfitting, our method achieves superior performance compared to advanced kernel methods.
Data Consistent Artifact Reduction for Limited Angle Tomography with Deep Learning Prior
Robustness of deep learning methods for limited angle tomography is challenged by two major factors: a) due to insufficient training data the network may not generalize well to unseen data; b) deep learning methods are sensitive to noise.
A Generalized Framework for Edge-preserving and Structure-preserving Image Smoothing
In this paper, a non-convex non-smooth optimization framework is proposed to achieve diverse smoothing natures where even contradictive smoothing behaviors can be achieved.
AirwayNet: A Voxel-Connectivity Aware Approach for Accurate Airway Segmentation Using Convolutional Neural Networks
Airway segmentation on CT scans is critical for pulmonary disease diagnosis and endobronchial navigation.
Robust Visual Tracking Revisited: From Correlation Filter to Template Matching
In this paper, we propose a novel matching based tracker by investigating the relationship between template matching and the recent popular correlation filter based trackers (CFTs).
Online PCB Defect Detector On A New PCB Defect Dataset
To train the deep model, a dataset is established, namely DeepPCB, which contains 1, 500 image pairs with annotations including positions of 6 common types of PCB defects.
Varifocal-Net: A Chromosome Classification Approach using Deep Convolutional Networks
To expedite the diagnosis, we present a novel method named Varifocal-Net for simultaneous classification of chromosome's type and polarity using deep convolutional networks.
Generalization Properties of hyper-RKHS and its Applications
This paper generalizes regularized regression problems in a hyper-reproducing kernel Hilbert space (hyper-RKHS), illustrates its utility for kernel learning and out-of-sample extensions, and proves asymptotic convergence results for the introduced regression models in an approximation theory view.
Adversarial Attack Type I: Cheat Classifiers by Significant Changes
Despite the great success of deep neural networks, the adversarial attack can cheat some well-trained classifiers by small permutations.
Learning Data-adaptive Nonparametric Kernels
Learning this data-adaptive matrix in a formulation-free strategy enlarges the margin between classes and thus improves the model flexibility.
Scale-Space Anisotropic Total Variation for Limited Angle Tomography
Hence, the main purpose of this paper is to reduce streak artifacts at various scales.
Indefinite Kernel Logistic Regression with Concave-inexact-convex Procedure
Since the concave-convex procedure has to solve a sub-problem in each iteration, we propose a concave-inexact-convex procedure (CCICP) algorithm with an inexact solving scheme to accelerate the solving process.
Nonconvex penalties with analytical solutions for one-bit compressive sensing
For several nonconvex penalties, including minimax concave penalty (MCP), $\ell_0$ norm, and sorted $\ell_1$ penalty, we provide fast algorithms for finding the analytical solutions by solving the dual problem.
Online Robust Principal Component Analysis with Change Point Detection
Robust PCA methods are typically batch algorithms which requires loading all observations into memory before processing.
Mixed one-bit compressive sensing with applications to overexposure correction for CT reconstruction
Aiming at overexposure correction for computed tomography (CT) reconstruction, we in this paper propose a mixed one-bit compressive sensing (M1bit-CS) to acquire information from both regular and saturated measurements.
Pinball Loss Minimization for One-bit Compressive Sensing: Convex Models and Algorithms
The one-sided $\ell_1$ loss and the linear loss are two popular loss functions for 1bit-CS.
