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

Petar Raykov

dblp:267/9844 · DBLP profile ↗
← Back
1ranked-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 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
Probabilistic and Bayesian machine learning · 50% Representation and self-supervised learning · 50%

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
dimensionality reduction
0.812024
Adaptive Latent Feature Sharing for Piecewise Linear Dimensionality Reduction · J. Mach. Learn. Res. 2024
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
factor analysis
0.812024
Adaptive Latent Feature Sharing for Piecewise Linear Dimensionality Reduction · J. Mach. Learn. Res. 2024
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
latent feature model
0.812024
Adaptive Latent Feature Sharing for Piecewise Linear Dimensionality Reduction · J. Mach. Learn. Res. 2024
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
probabilistic principal component analysis
0.812024
Adaptive Latent Feature Sharing for Piecewise Linear Dimensionality Reduction · J. Mach. Learn. Res. 2024

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

two-parameter discrete distribution · 0.8gibbs sampling · 0.8expectation-maximisation · 0.8
YearPublicationVenuePosition
2024 Adaptive Latent Feature Sharing for Piecewise Linear Dimensionality Reduction
abstract
Linear Gaussian exploratory tools such as principal component analysis (PCA) and factor analysis (FA) are widely used for exploratory analysis, pre-processing, data visualization, and related tasks. Because the linear-Gaussian assumption is restrictive, for very high dimensional problems, they have been replaced by robust, sparse extensions or more flexible discrete-continuous latent feature models. Discrete-continuous latent feature models specify a dictionary of features dependent on subsets of the data and then infer the likelihood that each data point shares any of these features. This is often achieved using rich-get-richer assumptions about the feature allocation process where the dictionary tries to couple the feature frequency with the portion of total variance that it explains. In this work, we propose an alternative approach that allows for better control over the feature to data point allocation. This new approach is based on two-parameter discrete distribution models which decouple feature sparsity and dictionary size, hence capturing both common and rare features in a parsimonious way. The new framework is used to derive a novel adaptive variant of factor analysis (aFA), as well as an adaptive probabilistic principal component analysis (aPPCA) capable of flexible structure discovery and dimensionality reduction in a wide variety of scenarios. We derive both standard Gibbs sampling, as well as efficient expectation-maximisation inference approximations converging orders of magnitude faster, to a reasonable point estimate solution. The utility of the proposed aPPCA and aFA models is demonstrated on standard tasks such as feature learning, data visualization, and data whitening. We show that aPPCA and aFA can extract interpretable, high-level features for raw MNIST or COLI-20 images, or when applied to the analysis of autoencoder features. We also demonstrate that replacing common PCA pre-processing pipelines in the analysis of functional magnetic resonance imaging (fMRI) data with aPPCA, leads to more robust and better-localised blind source separation of neural activity.
Adam Farooq, Yordan P. Raykov, Petar Raykov, Max A. Little
J. Mach. Learn. Res.3