research
∙
08/14/2023
KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
The Maximum k-Defective Clique Problem (MDCP) aims to find a maximum k-d...
share
research
∙
06/22/2023
Rethinking the Backward Propagation for Adversarial Transferability
Transfer-based attacks generate adversarial examples on the surrogate mo...
research
∙
06/20/2023
Knowledge Distillation via Token-level Relationship Graph
Knowledge distillation is a powerful technique for transferring knowledg...
research
∙
06/09/2023
Two Independent Teachers are Better Role Model
Recent deep learning models have attracted substantial attention in infa...
research
∙
05/22/2023
Tokenized Graph Transformer with Neighborhood Augmentation for Node Classification in Large Graphs
Graph Transformers, emerging as a new architecture for graph representat...
research
∙
05/17/2023
An Efficient Solution Space Exploring and Descent Method for Packing Equal Spheres in a Sphere
The problem of packing equal spheres in a spherical container is a class...
research
∙
04/24/2023
AssemblyHands: Towards Egocentric Activity Understanding via 3D Hand Pose Estimation
We present AssemblyHands, a large-scale benchmark dataset with accurate ...
research
∙
03/24/2023
PIAT: Parameter Interpolation based Adversarial Training for Image Classification
Adversarial training has been demonstrated to be the most effective appr...
research
∙
03/05/2023
Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale
The problem of packing equal circles in a circle is a classic and famous...
research
∙
02/09/2023
Gaussian Mask Convolution for Convolutional Neural Networks
Square convolution is a default unit in convolutional neural networks as...
research
∙
01/28/2023
Semantic Adversarial Attacks on Face Recognition through Significant Attributes
Face recognition is known to be vulnerable to adversarial face images. E...
research
∙
01/18/2023
Relaxed Graph Color Bound for the Maximum k-plex Problem
As a relaxation of the clique, a k-plex of a graph is a vertex set that ...
research
∙
01/05/2023
All in Tokens: Unifying Output Space of Visual Tasks via Soft Token
Unlike language tasks, where the output space is usually limited to a se...
research
∙
12/30/2022
Deterministic counting Lovász local lemma beyond linear programming
We give a simple combinatorial algorithm to deterministically approximat...
research
∙
11/29/2022
Incorporating Multi-armed Bandit with Local Search for MaxSAT
Partial MaxSAT (PMS) and Weighted PMS (WPMS) are two practical generaliz...
research
∙
11/27/2022
Class-aware Information for Logit-based Knowledge Distillation
Knowledge distillation aims to transfer knowledge to the student model b...
research
∙
11/27/2022
Differentiable Meta Multigraph Search with Partial Message Propagation on Heterogeneous Information Networks
Heterogeneous information networks (HINs) are widely employed for descri...
research
∙
11/15/2022
Adaptive Multi-Neighborhood Attention based Transformer for Graph Representation Learning
By incorporating the graph structural information into Transformers, gra...
research
∙
11/15/2022
Local Magnification for Data and Feature Augmentation
In recent years, many data augmentation techniques have been proposed to...
research
∙
11/15/2022
Neighborhood Convolutional Network: A New Paradigm of Graph Neural Networks for Node Classification
The decoupled Graph Convolutional Network (GCN), a recent development of...
research
∙
08/18/2022
Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem
Maximum Common induced Subgraph (MCS) is an important NP-hard problem wi...
research
∙
07/25/2022
Improved Bounds for Sampling Solutions of Random CNF Formulas
Let Φ be a random k-CNF formula on n variables and m clauses, where each...
research
∙
07/09/2022
Generating Pseudo-labels Adaptively for Few-shot Model-Agnostic Meta-Learning
Model-Agnostic Meta-Learning (MAML) is a famous few-shot learning method...
research
∙
07/08/2022
Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems
TSP is a classical NP-hard combinatorial optimization problem with many ...
research
∙
06/21/2022
Propagation with Adaptive Mask then Training for Node Classification on Attributed Networks
Node classification on attributed networks is a semi-supervised task tha...
research
∙
06/10/2022
NAGphormer: Neighborhood Aggregation Graph Transformer for Node Classification in Large Graphs
Graph Transformers have demonstrated superiority on various graph learni...
research
∙
04/10/2022
Enhancing the Robustness, Efficiency, and Diversity of Differentiable Architecture Search
Differentiable architecture search (DARTS) has attracted much attention ...
research
∙
04/06/2022
Sampling-based Fast Gradient Rescaling Method for Highly Transferable Adversarial Attacks
Deep neural networks have shown to be very vulnerable to adversarial exa...
research
∙
04/04/2022
Sampling Lovász Local Lemma For General Constraint Satisfaction Solutions In Near-Linear Time
We give a fast algorithm for sampling uniform solutions of general const...
research
∙
03/28/2022
Assembly101: A Large-Scale Multi-View Video Dataset for Understanding Procedural Activities
Assembly101 is a new procedural activity dataset featuring 4321 videos o...
research
∙
02/28/2022
Robust Textual Embedding against Word-level Adversarial Attacks
We attribute the vulnerability of natural language processing models to ...
research
∙
02/07/2022
Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem
We address the Budgeted Maximum Coverage Problem (BMCP), which is a natu...
research
∙
01/25/2022
An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem
The Partitioning Min-Max Weighted Matching (PMMWM) problem is an NP-hard...
research
∙
01/20/2022
Learning-based Hybrid Local Search for the Hard-label Textual Attack
Deep neural networks are vulnerable to adversarial examples in Natural L...
research
∙
01/17/2022
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem
We propose a new and strengthened Branch-and-Bound (BnB) algorithm for t...
research
∙
01/14/2022
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit
We address Partial MaxSAT (PMS) and Weighted PMS (WPMS), two practical g...
research
∙
12/27/2021
Active Learning with Pseudo-Labels for Multi-View 3D Pose Estimation
Pose estimation of the human body/hand is a fundamental problem in compu...
research
∙
12/13/2021
Triangle Attack: A Query-efficient Decision-based Adversarial Attack
Decision-based attack poses a severe threat to real-world applications s...
research
∙
12/08/2021
Uncovering the Local Hidden Community Structure in Social Networks
Hidden community is a useful concept proposed recently for social networ...
research
∙
11/21/2021
Stochastic Variance Reduced Ensemble Adversarial Attack for Boosting the Adversarial Transferability
The black-box adversarial attack has attracted impressive attention for ...
research
∙
11/17/2021
TraSw: Tracklet-Switch Adversarial Attacks against Multi-Object Tracking
Benefiting from the development of Deep Neural Networks, Multi-Object Tr...
research
∙
11/12/2021
Moser-Tardos Algorithm: Beyond Shearer's Bound
In a seminal paper (Moser and Tardos, JACM'10), Moser and Tardos develop...
research
∙
09/13/2021
Randomized Substitution and Vote for Textual Adversarial Example Detection
A line of work has shown that natural text processing models are vulnera...
research
∙
09/09/2021
TimeTraveler: Reinforcement Learning for Temporal Knowledge Graph Forecasting
Temporal knowledge graph (TKG) reasoning is a crucial task that has gain...
research
∙
09/02/2021
Regional Adversarial Training for Better Robust Generalization
Adversarial training (AT) has been demonstrated as one of the most promi...
research
∙
08/23/2021
Farsighted Probabilistic Sampling based Local Search for (Weighted) Partial MaxSAT
Partial MaxSAT (PMS) and Weighted Partial MaxSAT (WPMS) are both practic...
research
∙
08/14/2021
A New Entity Extraction Method Based on Machine Reading Comprehension
Entity extraction is a key technology for obtaining information from mas...
research
∙
08/06/2021
Adaptive Simulated Annealing with Greedy Search for the Circle Bin Packing Problem
We introduce a new bin packing problem, termed the circle bin packing pr...
research
∙
07/31/2021
Structure Amplification on Multi-layer Stochastic Block Models
Much of the complexity of social, biological, and engineered systems ari...
research
∙
07/09/2021