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

Yan Zhang 0067

dblp:04/3348-67 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
3since 2021 · last 2025
0000-0003-3470-3663ORCID · verified

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

Artificial intelligence and machine learning · 7 · 4 first-author · 3 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
7 papers
Representation and self-supervised learning · 39% Deep learning architectures and training · 20% Image recognition and object detection · 9%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 16 heaviest of 21, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
equivariant neural network
1.522025
Improving Equivariant Networks with Probabilistic Symmetry Breaking · ICLR 2025
Equivariance with Learned Canonicalization Functions · ICML 2023
Machine learning › Generative modeling › diffusion model › geometric diffusion model
equivariant diffusion model
0.912025
Improving Equivariant Networks with Probabilistic Symmetry Breaking · ICLR 2025
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › constraint satisfaction
symmetry breaking
0.912025
Improving Equivariant Networks with Probabilistic Symmetry Breaking · ICLR 2025
Machine learning › Representation and self-supervised learning › representation learning › structured representation learning
set representation learning
0.822020
FSPool: Learning Set Representations with Featurewise Sort Pooling · ICLR 2020
Learning Representations of Sets through Optimized Permutations · ICLR (Poster) 2019
Machine learning › Representation and self-supervised learning
causal representation learning
0.812024
Object centric architectures enable efficient causal representation learning · ICLR 2024
Machine learning › Representation and self-supervised learning › representation learning
object-centric representation learning
0.812024
Object centric architectures enable efficient causal representation learning · ICLR 2024
Machine learning › Representation and self-supervised learning › representation learning › object-centric representation learning
slot attention
0.812024
Object centric architectures enable efficient causal representation learning · ICLR 2024
Machine learning › Deep learning architectures and training › neural network layer design
pooling
0.412020
FSPool: Learning Set Representations with Featurewise Sort Pooling · ICLR 2020
Computer vision › Image recognition and object detection
object detection
0.412019
Deep Set Prediction Networks · NeurIPS 2019
Computer vision › 3D vision › geometric deep learning › set learning
set prediction
0.412019
Deep Set Prediction Networks · NeurIPS 2019
Mathematical optimization › combinatorial optimization › permutation problems
permutation optimization
0.412019
Learning Representations of Sets through Optimized Permutations · ICLR (Poster) 2019
Computer vision › Image recognition and object detection
object counting
0.312018
Learning to Count Objects in Natural Images for Visual Question Answering · ICLR (Poster) 2018
Computer vision › Vision and language
visual question answering
0.312018
Learning to Count Objects in Natural Images for Visual Question Answering · ICLR (Poster) 2018
Machine learning › Graph learning
graph neural network
0.312025
Improving Equivariant Networks with Probabilistic Symmetry Breaking · ICLR 2025
Computer vision › Image recognition and object detection
image classification
0.212023
Equivariance with Learned Canonicalization Functions · ICML 2023
Computer vision › 3D vision › point cloud analysis
point cloud classification
0.212023
Equivariance with Learned Canonicalization Functions · ICML 2023

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

randomized canonicalization · 0.9positional encoding · 0.9weak supervision · 0.8sparse perturbations · 0.8permutation learning · 0.8group equivariance · 0.7canonicalization functions · 0.7featurewise sort pooling · 0.4deep set prediction networks · 0.4autoencoding · 0.4
YearPublicationVenuePosition
2025 Improving Equivariant Networks with Probabilistic Symmetry Breaking
abstract
Equivariance encodes known symmetries into neural networks, often enhancing generalization. However, equivariant networks cannot *break* symmetries: the output of an equivariant network must, by definition, have at least the same self-symmetries as its input. This poses an important problem, both (1) for prediction tasks on domains where self-symmetries are common, and (2) for generative models, which must break symmetries in order to reconstruct from highly symmetric latent spaces. This fundamental limitation can in fact be addressed by considering *equivariant conditional distributions*, instead of equivariant functions. We therefore present novel theoretical results that establish necessary and sufficient conditions for representing such distributions. Concretely, this representation provides a practical framework for breaking symmetries in any equivariant network via randomized canonicalization. Our method, SymPE (Symmetry-breaking Positional Encodings), admits a simple interpretation in terms of positional encodings. This approach expands the representational power of equivariant networks while retaining the inductive bias of symmetry, which we justify through generalization bounds. Experimental results demonstrate that SymPE significantly improves performance of group-equivariant and graph neural networks across diffusion models for graphs, graph autoencoders, and lattice spin system modeling.
Hannah Lawrence, Vasco Portilheiro, Yan Zhang 0067, Sékou-Oumar Kaba
ICLR3
2024 Object centric architectures enable efficient causal representation learning
abstract
Causal representation learning has showed a variety of settings in which we can disentangle latent variables with identifiability guarantees (up to some reasonable equivalence class). Common to all of these approaches is the assumption that (1) the latent variables are represented as $d$-dimensional vectors, and (2) that the observations are the output of some injective generative function of these latent variables. While these assumptions appear benign, we show that when the observations are of multiple objects, the generative function is no longer injective and disentanglement fails in practice. We can address this failure by combining recent developments in object-centric learning and causal representation learning. By modifying the Slot Attention architecture (Locatello et al., 2020), we develop an object-centric architecture that leverages weak supervision from sparse perturbations to disentangle each object's properties. This approach is more data-efficient in the sense that it requires significantly fewer perturbations than a comparable approach that encodes to a Euclidean space and we show that this approach successfully disentangles the properties of a set of objects in a series of simple image-based disentanglement experiments.
Amin Mansouri, Jason S. Hartford, Yan Zhang 0067, Yoshua Bengio
ICLR3
2023 Equivariance with Learned Canonicalization Functions
abstract
Symmetry-based neural networks often constrain the architecture in order to achieve invariance or equivariance to a group of transformations. In this paper, we propose an alternative that avoids this architectural constraint by learning to produce canonical representations of the data. These canonicalization functions can readily be plugged into non-equivariant backbone architectures. We offer explicit ways to implement them for some groups of interest. We show that this approach enjoys universality while providing interpretable insights. Our main hypothesis, supported by our empirical results, is that learning a small neural network to perform canonicalization is better than using predefined heuristics. Our experiments show that learning the canonicalization function is competitive with existing techniques for learning equivariant functions across many tasks, including image classification, $N$-body dynamics prediction, point cloud classification and part segmentation, while being faster across the board.
Sékou-Oumar Kaba, Arnab Kumar Mondal, Yan Zhang 0067, Yoshua Bengio, Siamak Ravanbakhsh
ICML3
2020 FSPool: Learning Set Representations with Featurewise Sort Pooling
Yan Zhang 0067, Jonathon S. Hare, Adam Prügel-Bennett
ICLR1
2019 Learning Representations of Sets through Optimized Permutations
Yan Zhang 0067, Jonathon S. Hare, Adam Prügel-Bennett
ICLR (Poster)1
2019 Deep Set Prediction Networks
abstract
Current approaches for predicting sets from feature vectors ignore the unordered nature of sets and suffer from discontinuity issues as a result. We propose a general model for predicting sets that properly respects the structure of sets and avoids this problem. With a single feature vector as input, we show that our model is able to auto-encode point sets, predict the set of bounding boxes of objects in an image, and predict the set of attributes of these objects.
Yan Zhang 0067, Jonathon S. Hare, Adam Prügel-Bennett
NeurIPS1
2018 Learning to Count Objects in Natural Images for Visual Question Answering
Yan Zhang 0067, Jonathon S. Hare, Adam Prügel-Bennett
ICLR (Poster)1