Search Results for author: Han Qi

Found 7 papers, 2 papers with code

Multi-view Distillation based on Multi-modal Fusion for Few-shot Action Recognition(CLIP-$\mathrm{M^2}$DF)

no code implementations16 Jan 2024 Fei Guo, Yikang Wang, Han Qi, Wenping Jin, Li Zhu

In each view, we fuse the prompt embedding as consistent information with visual and the global or local temporal context to overcome the overlapping distribution of classes and outliers.

Few-Shot action recognition Few Shot Action Recognition +1

Forced Exploration in Bandit Problems

1 code implementation12 Dec 2023 Han Qi, Fei Guo, Li Zhu

This paper aims to design a multi-armed bandit algorithm that can be implemented without using information about the reward distribution while still achieving substantial regret upper bounds.

Consistency Prototype Module and Motion Compensation for Few-Shot Action Recognition (CLIP-CP$\mathbf{M^2}$C)

no code implementations2 Dec 2023 Fei Guo, Li Zhu, Yikang Wang, Han Qi

Although some multi-modal works use labels as supplementary to construct prototypes of support videos, they can not use this information for query videos.

Domain Adaptation Few-Shot action recognition +2

Latent Conservative Objective Models for Data-Driven Crystal Structure Prediction

no code implementations16 Oct 2023 Han Qi, Xinyang Geng, Stefano Rando, Iku Ohama, Aviral Kumar, Sergey Levine

In computational chemistry, crystal structure prediction (CSP) is an optimization problem that involves discovering the lowest energy stable crystal structure for a given chemical formula.

Formation Energy

K-band: Self-supervised MRI Reconstruction via Stochastic Gradient Descent over K-space Subsets

1 code implementation5 Aug 2023 Frederic Wang, Han Qi, Alfredo De Goyeneche, Reinhard Heckel, Michael Lustig, Efrat Shimron

In each training iteration, rather than using the fully sampled k-space for computing gradients, we use only a small k-space portion.

MRI Reconstruction

Discounted Thompson Sampling for Non-Stationary Bandit Problems

no code implementations18 May 2023 Han Qi, Yue Wang, Li Zhu

Under mild assumptions, we show that DS-TS with Gaussian priors can achieve nearly optimal regret bound on the order of $\tilde{O}(\sqrt{TB_T})$ for abruptly changing and $\tilde{O}(T^{\beta})$ for smoothly changing, where $T$ is the number of time steps, $B_T$ is the number of breakpoints, $\beta$ is associated with the smoothly changing environment and $\tilde{O}$ hides the parameters independent of $T$ as well as logarithmic terms.

Thompson Sampling

Data-Driven Offline Decision-Making via Invariant Representation Learning

no code implementations21 Nov 2022 Han Qi, Yi Su, Aviral Kumar, Sergey Levine

The goal in offline data-driven decision-making is synthesize decisions that optimize a black-box utility function, using a previously-collected static dataset, with no active interaction.

Decision Making Domain Adaptation +2

Cannot find the paper you are looking for? You can Submit a new open access paper.