Demo Data from SIGIR 2026 / reviewers in the wild / expert
Ruilin Tong
dblp:252/7932
· DBLP profile ↗
3ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 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 |
Learning paradigms · 50% Efficient and distributed learning · 25% Optimization for machine learning · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Optimization for machine learning
bilevel optimization |
0.9 | 1 | 2025 | Coreset Selection via Reducible Loss in Continual Learning · ICLR 2025 |
Machine learning › Learning paradigms
continual learning |
0.9 | 1 | 2025 | Coreset Selection via Reducible Loss in Continual Learning · ICLR 2025 |
Machine learning › Efficient and distributed learning › data selection
coreset selection |
0.9 | 1 | 2025 | Coreset Selection via Reducible Loss in Continual Learning · ICLR 2025 |
Machine learning › Learning paradigms › continual learning
rehearsal-based continual learning |
0.9 | 1 | 2025 | Coreset Selection via Reducible Loss in Continual Learning · ICLR 2025 |
Methods — techniques the papers use, named apart from their topics
knowledge distillation · 0.9bi-level optimization · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Coreset Selection via Reducible Loss in Continual LearningabstractRehearsal-based continual learning (CL) aims to mitigate catastrophic forgetting by maintaining a subset of samples from previous tasks and replaying them. The rehearsal memory can be naturally constructed as a coreset, designed to form a compact subset that enables training with performance comparable to using the full dataset. The coreset selection task can be formulated as bilevel optimization that solves for the subset to minimize the outer objective of the learning task. Existing methods primarily rely on inefficient probabilistic sampling or local gradient-based scoring to approximate sample importance through an iterative process that can be susceptible to ambiguity or noise. Specifically, non-representative samples like ambiguous or noisy samples are difficult to learn and incur high loss values even when training on the full dataset. However, existing methods relying on local gradient tend to highlight these samples in an attempt to minimize the outer loss, leading to a suboptimal coreset. To enhance coreset selection, especially in CL where high-quality samples are essential, we propose a coreset selection method that measures sample importance using reducible loss (ReL) that quantifies the impact of adding a sample to model performance. By leveraging ReL and a process derived from bilevel optimization, we identify and retain samples that yield the highest performance gain. They are shown to be informative and representative. Furthermore, ReL requires only forward computation, making it significantly more efficient than previous methods. To better apply coreset selection in CL, we extend our method to address key challenges such as task interference, streaming data, and knowledge distillation. Experiments on data summarization and continual learning demonstrate the effectiveness and efficiency of our approach. Ruilin Tong, Yuhang Liu 0002, Qinfeng Shi, Dong Gong |
ICLR | 1 |
| 2025 | Model Inversion with Layer-Specific Modeling and Alignment for Data-Free Continual LearningabstractContinual learning (CL) aims to incrementally train a model to a sequence of tasks while maintaining performance on previously seen ones. Despite effectiveness in mitigating forgetting, data storage and replay may be infeasible due to privacy or security constraints, and are impractical or unavailable for arbitrary pre-trained models. Data-free or examplar-free CL aims to continually update models with new
tasks without storing previous data. In addition to regularizing updates, we employ model inversion to synthesize data from the trained model, anchoring learned knowledge through replay without retaining old data. However, model inversion in predictive models faces two key challenges. First, generating inputs (e.g., images) solely from highly compressed output labels (e.g., classes) often causes drift between synthetic and real data. Replaying on such synthetic data can contaminate and erode knowledge learned from real data, further degrading inversion quality over time. Second, performing inversion is usually computationally expensive, as each iteration requires backpropagation through the entire model and many steps are needed for convergence. These problems are more severe with large pre-trained models such as Contrastive Language-Image Pre-training (CLIP) models. To improve model inversion efficiency, we propose Per-layer Model Inversion (PMI) approach inspired by the faster convergence of single-layer optimization. The inputs optimized from PMI provide strong initialization for full-model inversion, significantly reducing the number of iterations required for convergence. To address feature distribution shift, we model class-wise feature distribution using a Gaussian distribution and preserve distributional information with a contrastive model. Sampling features for inversion ensures alignment between synthetic and real feature distributions. Combining PMI and feature modeling, we demonstrate the feasibility of incrementally training models on new classes by generating data from pseudo image features mapped through semantic-aware feature projection. Our method shows strong effectiveness and compatibility across multiple CL settings. Ruilin Tong, Yuhang Liu 0002, Dong Gong |
NeurIPS | 1 |
| 2019 | Identification and Control of Electric Elasticity Limit for Electric-Spring-Based Flexible LoadsabstractBy comprehensively analyzing the effective working voltage range of electric springs (ESs), this paper proposes a new control strategy to improve the absorption capacity of ES-based flexible loads for mains voltage fluctuations; thus, enhancing the stability of the microgrid fed by intermittent renewables. Analogous to a mechanical spring, the effective working voltage range of ESs is also restricted by the electric elasticity limit (EEL). In specific circumstances, the ES-based flexible load is incapable of dealing with excessive fluctuations of mains voltage caused by intermittent renewable energy sources. Accordingly, this paper investigates the impact of key parameters on the EEL of ESs, such as the distribution line, the voltage reference, and the loads. Besides, by adjusting the proportion between the critical and the noncritical loads, this paper proposes and implements an EEL controller to regulate the absorption capacity of ES-based flexible loads for mains voltage fluctuations; thus, effectively ensuring the voltage stability of critical loads. Finally, the simulated and experimental results are both given to verify the theoretical analysis for ES-based flexible loads and the feasibility of the proposed EEL controller. Zhen Zhang 0004, Ruilin Tong |
IEEE Trans. Ind. Informatics | 3 |