Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jonathan Yuyang Zhou

dblp:404/6644 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

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
Representation and self-supervised learning · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
sequence representation learning
0.912025
Nonlinear Sequence Embedding by Monotone Variational Inequality · ICLR 2025
Data mining › time series analysis
time series representation learning
0.912025
Nonlinear Sequence Embedding by Monotone Variational Inequality · ICLR 2025
Mathematical optimization › continuous optimization › convex optimization › variational inequality
monotone variational inequalities
0.312025
Nonlinear Sequence Embedding by Monotone Variational Inequality · ICLR 2025
Mathematical optimization › continuous optimization › convex optimization
variational inequality
0.312025
Nonlinear Sequence Embedding by Monotone Variational Inequality · ICLR 2025

Methods — techniques the papers use, named apart from their topics

monotone variational inequalities · 2.6low-rank regularization · 2.6convex matrix recovery · 2.6
YearPublicationVenuePosition
2025 Nonlinear Sequence Embedding by Monotone Variational Inequality
abstract
In the wild, we often encounter collections of sequential data such as electrocardiograms, motion capture, genomes, and natural language, and sequences may be multichannel or symbolic with nonlinear dynamics. We introduce a method to learn low-dimensional representations of nonlinear sequence and time-series data without supervision which has provable recovery guarantees. The learned representation can be used for downstream machine-learning tasks such as clustering and classification. The method assumes that the observed sequences arise from a common domain, with each sequence following its own autoregressive model, and these models are related through low-rank regularization. We cast the problem as a convex matrix parameter recovery problem using monotone variational inequalities (VIs) and encode the common domain assumption via low-rank constraint across the learned representations, which can learn a subspace approximately spanning the entire domain as well as faithful representations for the dynamics of each individual sequence incorporating the domain information in totality. We show the competitive performance of our method on real-world time-series data with baselines and demonstrate its effectiveness for symbolic text modeling and RNA sequence clustering.
Jonathan Yuyang Zhou
ICLR1