Demo Data from EDBT 2026 / reviewers in the wild / expert
Roger Jin
dblp:185/2889
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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 theory · 56% Learning paradigms · 44% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning theory › nonparametric regression
kernel regression |
0.8 | 1 | 2024 | Spectrally Transformed Kernel Regression · ICLR 2024 |
Machine learning › Learning paradigms
semi-supervised learning |
0.8 | 1 | 2024 | Spectrally Transformed Kernel Regression · ICLR 2024 |
Machine learning › Learning theory
statistical guarantees |
0.2 | 1 | 2024 | Spectrally Transformed Kernel Regression · ICLR 2024 |
Methods — techniques the papers use, named apart from their topics
spectral transformation · 0.8kernel PCA · 0.8RKHS · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Spectrally Transformed Kernel RegressionabstractUnlabeled data is a key component of modern machine learning. In general, the role
of unlabeled data is to impose a form of smoothness, usually from the similarity
information encoded in a base kernel, such as the ϵ-neighbor kernel or the adjacency
matrix of a graph. This work revisits the classical idea of spectrally transformed
kernel regression (STKR), and provides a new class of general and scalable STKR
estimators able to leverage unlabeled data. Intuitively, via spectral transformation,
STKR exploits the data distribution for which unlabeled data can provide additional
information. First, we show that STKR is a principled and general approach,
by characterizing a universal type of “target smoothness”, and proving that any
sufficiently smooth function can be learned by STKR. Second, we provide scalable
STKR implementations for the inductive setting and a general transformation
function, while prior work is mostly limited to the transductive setting. Third, we
derive statistical guarantees for two scenarios: STKR with a known polynomial
transformation, and STKR with kernel PCA when the transformation is unknown.
Overall, we believe that this work helps deepen our understanding of how to work
with unlabeled data, and its generality makes it easier to inspire new methods. Runtian Zhai, Rattana Pukdee, Roger Jin, Maria-Florina Balcan, Pradeep Ravikumar |
ICLR | 3 |
| 2016 | Conversational Recommendation System with Unsupervised LearningabstractWe will demonstrate a conversational products recommendation agent. This system shows how we combine research in personalized recommendation systems with research in dialogue systems to build a virtual sales agent. Based on new deep learning technologies we developed, the virtual agent is capable of learning how to interact with users, how to answer user questions, what is the next question to ask, and what to recommend when chatting with a human user. Normally a descent conversational agent for a particular domain requires tens of thousands of hand labeled conversational data or hand written rules. This is a major barrier when launching a conversation agent for a new domain. We will explore and demonstrate the effectiveness of the learning solution even when there is no hand written rules or hand labeled training data. Yueming Sun 0001, Yi Zhang 0001, Yunfei Chen 0003, Roger Jin |
RecSys | 4 |