Demo Data from VLDB 2026 / reviewers in the wild / expert
Lixuan Yi
dblp:211/7228
· DBLP profile ↗
3ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Trustworthy machine learning · 54% Learning paradigms · 23% Transfer learning and domain adaptation · 23% | |
| Computer graphics and multimedia
1 paper |
Image and video processing · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning paradigms
class imbalance |
0.4 | 1 | 2019 | Meta-Weight-Net: Learning an Explicit Mapping For Sample Weighting · NeurIPS 2019 |
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels |
0.4 | 1 | 2019 | Meta-Weight-Net: Learning an Explicit Mapping For Sample Weighting · NeurIPS 2019 |
Machine learning › Transfer learning and domain adaptation
meta-learning |
0.4 | 1 | 2019 | Meta-Weight-Net: Learning an Explicit Mapping For Sample Weighting · NeurIPS 2019 |
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
sample reweighting |
0.4 | 1 | 2019 | Meta-Weight-Net: Learning an Explicit Mapping For Sample Weighting · NeurIPS 2019 |
Image and video processing › image restoration › image deraining
rain streak removal |
0.3 | 1 | 2017 | Should We Encode Rain Streaks in Video as Deterministic or Stochastic? · ICCV 2017 |
Image and video processing
video restoration |
0.3 | 1 | 2017 | Should We Encode Rain Streaks in Video as Deterministic or Stochastic? · ICCV 2017 |
Machine learning › Trustworthy machine learning › robustness
overfitting mitigation |
0.1 | 1 | 2019 | Meta-Weight-Net: Learning an Explicit Mapping For Sample Weighting · NeurIPS 2019 |
Methods — techniques the papers use, named apart from their topics
meta-learning · 0.4MLP weighting function · 0.4spatiotemporal smoothness · 0.3mixture of gaussians · 0.3low-rank background modeling · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Robust online rain removal for surveillance videos with dynamic rains
Lixuan Yi, Qian Zhao 0002, Wei Wei 0006, Zongben Xu |
Knowl. Based Syst. | 1 |
| 2019 | Meta-Weight-Net: Learning an Explicit Mapping For Sample WeightingabstractCurrent deep neural networks(DNNs) can easily overfit to biased training data with corrupted labels or class imbalance. Sample re-weighting strategy is commonly used to alleviate this issue by designing a weighting function mapping from training loss to sample weight, and then iterating between weight recalculating and classifier updating. Current approaches, however, need manually pre-specify the weighting function as well as its additional hyper-parameters. It makes them fairly hard to be generally applied in practice due to the significant variation of proper weighting schemes relying on the investigated problem and training data. To address this issue, we propose a method capable of adaptively learning an explicit weighting function directly from data. The weighting function is an MLP with one hidden layer, constituting a universal approximator to almost any continuous functions, making the method able to fit a wide range of weighting function forms including those assumed in conventional research. Guided by a small amount of unbiased meta-data, the parameters of the weighting function can be finely updated simultaneously with the learning process of the classifiers. Synthetic and real experiments substantiate the capability of our method for achieving proper weighting functions in class imbalance and noisy label cases, fully complying with the common settings in traditional methods, and more complicated scenarios beyond conventional cases. This naturally leads to its better accuracy than other state-of-the-art methods. Qi Xie 0002, Lixuan Yi, Qian Zhao 0002, Sanping Zhou, Zongben Xu, Deyu Meng |
NeurIPS | 3 |
| 2017 | Should We Encode Rain Streaks in Video as Deterministic or Stochastic?abstractVideos taken in the wild sometimes contain unexpected rain streaks, which brings difficulty in subsequent video processing tasks. Rain streak removal in a video (RSRV) is thus an important issue and has been attracting much attention in computer vision. Different from previous RSRV methods formulating rain streaks as a deterministic message, this work first encodes the rains in a stochastic manner, i.e., a patch-based mixture of Gaussians. Such modification makes the proposed model capable of finely adapting a wider range of rain variations instead of certain types of rain configurations as traditional. By integrating with the spatiotemporal smoothness configuration of moving objects and low-rank structure of background scene, we propose a concise model for RSRV, containing one likelihood term imposed on the rain streak layer and two prior terms on the moving object and background scene layers of the video. Experiments implemented on videos with synthetic and real rains verify the superiority of the proposed method, as compared with the state-of-the-art methods, both visually and quantitatively in various performance metrics. Wei Wei 0006, Lixuan Yi, Qi Xie 0002, Qian Zhao 0002, Deyu Meng, Zongben Xu |
ICCV | 2 |