Search Results for author:
Found 15 papers, 2 papers with code
Criticality-Guided Efficient Pruning in Spiking Neural Networks Inspired by Critical Brain Hypothesis
Firstly, we propose a low-cost metric for the criticality in SNNs.
RAPHAEL: Text-to-Image Generation via Large Mixture of Diffusion Paths
Text-to-image generation has recently witnessed remarkable achievements.
Ranked #11 on
Text-to-Image Generation
on MS COCO
GeoMIM: Towards Better 3D Knowledge Transfer via Masked Image Modeling for Multi-view 3D Understanding
In this paper, we propose Geometry Enhanced Masked Image Modeling (GeoMIM) to transfer the knowledge of the LiDAR model in a pretrain-finetune paradigm for improving the multi-view camera-based 3D detection.
Masked Autoencoders Are Stronger Knowledge Distillers
In MKD, random patches of the input image are masked, and the corresponding missing feature is recovered by forcing it to imitate the output of the teacher.
UniKD: Universal Knowledge Distillation for Mimicking Homogeneous or Heterogeneous Object Detectors
Bridging this semantic gap now requires case-by-case algorithm design which is time-consuming and heavily relies on experienced adjustment.
Rethinking Robust Representation Learning Under Fine-grained Noisy Faces
To better understand this, we reformulate the noise type of each class in a more fine-grained manner as N-identities|K^C-clusters.
TokenMix: Rethinking Image Mixing for Data Augmentation in Vision Transformers
In this paper, we propose a novel data augmentation technique TokenMix to improve the performance of vision transformers.
Meta Knowledge Distillation
Recent studies pointed out that knowledge distillation (KD) suffers from two degradation problems, the teacher-student gap and the incompatibility with strong data augmentations, making it not applicable to training state-of-the-art models, which are trained with advanced augmentations.
Ranked #135 on
Image Classification
on ImageNet
An Efficient Pruning Process with Locality Aware Exploration and Dynamic Graph Editing for Subgraph Matching
Subgraph matching is a NP-complete problem that extracts isomorphic embeddings of a query graph $q$ in a data graph $G$.
Rectifying the Data Bias in Knowledge Distillation
In this paper, we first quantitatively define the uniformity of the sampled data for training, providing a unified view for methods that learn from biased data.
Ranked #1 on
Face Verification
on IJB-C
(training dataset metric)
Exploiting Knowledge Distillation for Few-Shot Image Generation
The existing pipeline is first pretraining a source model (which contains a generator and a discriminator) on a large-scale dataset and finetuning it on a target domain with limited samples.
FNAS: Uncertainty-Aware Fast Neural Architecture Search
Further, an architecture knowledge pool together with a block similarity function is proposed to utilize parameter knowledge and reduces the searching time by 2 times.
Switchable K-Class Hyperplanes for Noise-Robust Representation Learning
When collaborated with the popular ArcFace on million-level data representation learning, we found that the switchable manner in SKH can effectively eliminate the gradient conflict generated by real-world label noise on a single K-class hyperplane.
Fast MNAS: Uncertainty-aware Neural Architecture Search with Lifelong Learning
Further, a life-long knowledge pool together with a block similarity function is proposed to utilize the lifelong parameter knowledge and reduces the searching time by 2 times.
Utilizing the Instability in Weakly Supervised Object Detection
Weakly supervised object detection (WSOD) focuses on training object detector with only image-level annotations, and is challenging due to the gap between the supervision and the objective.
