
Fast Gradient Projection Method for Text Adversary Generation and Adversarial Training
Adversarial training has shown effectiveness and efficiency in improving...
read it

Probability Learning based Tabu Search for the Budgeted Maximum Coverage Problem
Knapsack problems are classic models that can formulate a wide range of ...
read it

Dynamic Graph Correlation Learning for Disease Diagnosis with Incomplete Labels
Disease diagnosis on chest Xray images is a challenging multilabel cla...
read it

Errorfeedback Stochastic Configuration Strategy on Convolutional Neural Networks for Time Series Forecasting
Despite the superiority of convolutional neural networks demonstrated in...
read it

Stochastic Item Descent Method for Large Scale Equal Circle Packing Problem
Stochastic gradient descent (SGD) is a powerful method for largescale o...
read it

Adaptive Large Neighborhood Search for Circle Bin Packing Problem
We address a new variant of packing problem called the circle bin packin...
read it

Single Image Reflection Removal through Cascaded Refinement
We address the problem of removing undesirable reflections from a single...
read it

Robust Local Features for Improving the Generalization of Adversarial Training
Adversarial training has been demonstrated as one of the most effective ...
read it

Natural Language Adversarial Attacks and Defenses in Word Level
Up until recent two years, inspired by the big amount of research about ...
read it

Nesterov Accelerated Gradient and Scale Invariance for Improving Transferability of Adversarial Examples
Recent evidence suggests that deep neural networks (DNNs) are vulnerable...
read it

Adversarially Robust Generalization Just Requires More Unlabeled Data
Neural network robustness has recently been highlighted by the existence...
read it

A Learning based Branch and Bound for Maximum Common Subgraph Problems
Branchandbound (BnB) algorithms are widely used to solve combinatorial...
read it

A New Anchor Word Selection Method for the Separable Topic Discovery
Separable Nonnegative Matrix Factorization (SNMF) is an important metho...
read it

Dynamic MCMC Sampling
The Markov chain Monte Carlo (MCMC) methods are the primary tools for sa...
read it

ATGAN: A Generative Attack Model for Adversarial Transferring on Generative Adversarial Nets
Recent studies have discovered the vulnerability of Deep Neural Networks...
read it

Effective reinforcement learning based local search for the maximum kplex problem
The maximum kplex problem is a computationally complex problem, which e...
read it

Adaptive Wavelet Clustering for Highly Noisy Data
In this paper we make progress on the unsupervised task of mining arbitr...
read it

Adaptive Wavelet Clustering for High Noise Data
In this paper we make progress on the unsupervised task of mining arbitr...
read it

Child Gender Determination with Convolutional Neural Networks on Hand RadioGraphs
Motivation: In forensic or medicolegal investigation as well as in anth...
read it

Towards Understanding Learning Representations: To What Extent Do Different Neural Networks Learn the Same Representation
It is widely believed that learning good representations is one of the m...
read it

Improving the Generalization of Adversarial Training with Domain Adaptation
By injecting adversarial examples into training data, the adversarial tr...
read it

An Iterative PathBreaking Approach with Mutation and Restart Strategies for the MAXSAT Problem
Although PathRelinking is an effective local search method for many com...
read it

Hashing with Binary Matrix Pursuit
We propose theoretical and empirical improvements for twostage hashing ...
read it

Tight bounds for popping algorithms
We sharpen runtime analysis for algorithms under the partial rejection ...
read it

A direct approach to false discovery rates by decoy permutations
The current approaches to false discovery rates (FDRs) in multiple hypot...
read it

Quantum Lovász Local Lemma: Shearer's Bound is Tight
Lovász Local Lemma (LLL) is a very powerful tool in combinatorics and pr...
read it

Local Descriptors Optimized for Average Precision
Extraction of local feature descriptors is a vital stage in the solution...
read it

TexttoClip Video Retrieval with Early Fusion and ReCaptioning
We propose a novel method capable of retrieving clips from untrimmed vid...
read it

Hashing with Mutual Information
Binary vector embeddings enable fast nearest neighbor retrieval in large...
read it

The Local Dimension of Deep Manifold
Based on our observation that there exists a dramatic drop for the singu...
read it

Rectangle Transformation Problem
In this paper, we propose the rectangle transformation problem (RTP) and...
read it

Variable Version Lovász Local Lemma: Beyond Shearer's Bound
A tight criterion under which the abstract version Lovász Local Lemma (a...
read it

Hashing as TieAware Learning to Rank
Hashing, or learning binary embeddings of data, is frequently used in ne...
read it

Understanding Deep Representations through Random Weights
We systematically study the deep representation of random weight CNN (co...
read it

MIHash: Online Hashing with Mutual Information
Learningbased hashing methods are widely used for nearest neighbor retr...
read it

Hidden Community Detection in Social Networks
We introduce a new paradigm that is important for community detection in...
read it

A Powerful Generative Model Using Random Weights for the Deep Image Representation
To what extent is the success of deep visualization due to the training?...
read it

Generalized MajorizationMinimization
Nonconvex optimization is ubiquitous in machine learning. The Majorizat...
read it
Kun He
is this you? claim profile
Professor in School of Computer Science and Technology at Huazhong University of Science and Technology