Search Results for author:
Found 31 papers, 9 papers with code
AiluRus: A Scalable ViT Framework for Dense Prediction
Specifically, at the intermediate layer of the ViT, we utilize a spatial-aware density-based clustering algorithm to select representative tokens from the token sequence.
Frequency-Aware Transformer for Learned Image Compression
Learned image compression (LIC) has gained traction as an effective solution for image storage and transmission in recent years.
ActionPrompt: Action-Guided 3D Human Pose Estimation With Text and Pose Prompting
Recent 2D-to-3D human pose estimation (HPE) utilizes temporal consistency across sequences to alleviate the depth ambiguity problem but ignore the action related prior knowledge hidden in the pose sequence.
Hybrid Distillation: Connecting Masked Autoencoders with Contrastive Learners
In order to better obtain both discrimination and diversity, we propose a simple but effective Hybrid Distillation strategy, which utilizes both the supervised/CL teacher and the MIM teacher to jointly guide the student model.
Learned Lossless Compression for JPEG via Frequency-Domain Prediction
In this paper, we propose a novel framework for learned lossless compression of JPEG images that achieves end-to-end optimized prediction of the distribution of decoded DCT coefficients.
Pose-Oriented Transformer with Uncertainty-Guided Refinement for 2D-to-3D Human Pose Estimation
There has been a recent surge of interest in introducing transformers to 3D human pose estimation (HPE) due to their powerful capabilities in modeling long-term dependencies.
Towards Unsupervised Domain Generalization for Face Anti-Spoofing
In this paper, we propose the first Unsupervised Domain Generalization framework for Face Anti-Spoofing, namely UDG-FAS, which could exploit large amounts of easily accessible unlabeled data to learn generalizable features for enhancing the low-data regime of FAS.
Adapting Shortcut With Normalizing Flow: An Efficient Tuning Framework for Visual Recognition
To mitigate the computational and storage demands, recent research has explored Parameter-Efficient Fine-Tuning (PEFT), which focuses on tuning a minimal number of parameters for efficient adaptation.
Promoting Semantic Connectivity: Dual Nearest Neighbors Contrastive Learning for Unsupervised Domain Generalization
Then, we propose a novel unsupervised domain generalization approach, namely Dual Nearest Neighbors contrastive learning with strong Augmentation (DN^2A).
SdAE: Self-distillated Masked Autoencoder
We also analyze how to build good views for the teacher branch to produce latent representation from the perspective of information bottleneck.
Hierarchical Spherical CNNs with Lifting-based Adaptive Wavelets for Pooling and Unpooling
Specifically, adaptive spherical wavelets are learned with a lifting structure that consists of trainable lifting operators (i. e., update and predict operators).
LiftPool: Lifting-based Graph Pooling for Hierarchical Graph Representation Learning
Subsequently, this local information is aligned and propagated to the preserved nodes to alleviate information loss in graph coarsening.
Hybrid ISTA: Unfolding ISTA With Convergence Guarantees Using Free-Form Deep Neural Networks
This framework is general to endow arbitrary DNNs for solving linear inverse problems with convergence guarantees.
Contrastive Regression for Domain Adaptation on Gaze Estimation
Appearance-based Gaze Estimation leverages deep neural networks to regress the gaze direction from monocular images and achieve impressive performance.
Hierarchical Graph Networks for 3D Human Pose Estimation
Recent 2D-to-3D human pose estimation works tend to utilize the graph structure formed by the topology of the human skeleton.
Ranked #40 on
3D Human Pose Estimation
on MPI-INF-3DHP
(AUC metric)
Variance Reduced Domain Randomization for Policy Gradient
In this paper, we theoretically derive a bias-free and state/environment-dependent optimal baseline for DR, and analytically show its ability to achieve further variance reduction over the standard constant and state-dependent baselines for DR. We further propose a variance reduced domain randomization (VRDR) approach for policy gradient methods, to strike a tradeoff between the variance reduction and computational complexity in practice.
Understanding Self-supervised Learning via Information Bottleneck Principle
To address this issue, we introduce the information bottleneck principle and propose the Self-supervised Variational Information Bottleneck (SVIB) learning framework.
Graph Convolutional Networks via Adaptive Filter Banks
Graph convolutional networks have been a powerful tool in representation learning of networked data.
Graph Neural Networks With Lifting-based Adaptive Graph Wavelets
To ensure that the learned graph representations are invariant to node permutations, a layer is employed at the input of the networks to reorder the nodes according to their local topology information.
Bag of Instances Aggregation Boosts Self-supervised Distillation
Here bag of instances indicates a set of similar samples constructed by the teacher and are grouped within a bag, and the goal of distillation is to aggregate compact representations over the student with respect to instances in a bag.
Message Passing in Graph Convolution Networks via Adaptive Filter Banks
Furthermore, each filter in the spectral domain corresponds to a message passing scheme, and diverse schemes are implemented via the filter bank.
Multi-dataset Pretraining: A Unified Model for Semantic Segmentation
This is achieved by first pretraining the network via the proposed pixel-to-prototype contrastive loss over multiple datasets regardless of their taxonomy labels, and followed by fine-tuning the pretrained model over specific dataset as usual.
VEM-GCN: Topology Optimization with Variational EM for Graph Convolutional Networks
In the variational E-step, graph topology is optimized by approximating the posterior probability distribution of the latent adjacency matrix with a neural network learned from node embeddings.
Monotonic Robust Policy Optimization with Model Discrepancy
To mitigate the model discrepancy between training and target (testing) environments, domain randomization (DR) can generate plenty of environments with a sufficient diversity by randomly sampling environment parameters in simulator.
PAC-Bayesian Randomized Value Function with Informative Prior
To address this, in this paper, we propose a Bayesian linear regression with informative prior (IP-BLR) operator to leverage the data-dependent prior in the learning process of randomized value function, which can leverage the statistics of training results from previous iterations.
Learning Latent Architectural Distribution in Differentiable Neural Architecture Search via Variational Information Maximization
Existing differentiable neural architecture search approaches simply assume the architectural distribution on each edge is independent of each other, which conflicts with the intrinsic properties of architecture.
NCGNN: Node-Level Capsule Graph Neural Network for Semisupervised Classification
Therefore, it can relieve the over-smoothing issue and learn effective node representations over graphs with homophily or heterophily.
MimicNorm: Weight Mean and Last BN Layer Mimic the Dynamic of Batch Normalization
We leverage the neural tangent kernel (NTK) theory to prove that our weight mean operation whitens activations and transits network into the chaotic regime like BN layer, and consequently, leads to an enhanced convergence.
Graph Pooling with Node Proximity for Hierarchical Representation Learning
In this paper, we propose a novel graph pooling strategy that leverages node proximity to improve the hierarchical representation learning of graph data with their multi-hop topology.
Spatial-Temporal Transformer Networks for Traffic Flow Forecasting
In this paper, we propose a novel paradigm of Spatial-Temporal Transformer Networks (STTNs) that leverages dynamical directed spatial dependencies and long-range temporal dependencies to improve the accuracy of long-term traffic forecasting.
Trained Rank Pruning for Efficient Deep Neural Networks
To accelerate DNNs inference, low-rank approximation has been widely adopted because of its solid theoretical rationale and efficient implementations.
