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

Joshua Kortje

dblp:385/2960 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 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.

Theoretical computer science
1 paper
Information theory · 50% Algorithms and data structures · 25% Mathematical optimization · 25%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › discriminant analysis
linear discriminant analysis
0.912025
Divergence Maximizing Linear Projection for Supervised Dimension Reduction · IEEE Trans. Inf. Theory 2025
Algorithms and data structures › numerical linear algebra
dimensionality reduction
0.912025
Divergence Maximizing Linear Projection for Supervised Dimension Reduction · IEEE Trans. Inf. Theory 2025
Information theory › information measures
divergence measures
0.912025
Divergence Maximizing Linear Projection for Supervised Dimension Reduction · IEEE Trans. Inf. Theory 2025
Information theory › information measures › divergence measures
kullback-leibler divergence
0.912025
Divergence Maximizing Linear Projection for Supervised Dimension Reduction · IEEE Trans. Inf. Theory 2025
Mathematical optimization
supervised dimension reduction
0.912025
Divergence Maximizing Linear Projection for Supervised Dimension Reduction · IEEE Trans. Inf. Theory 2025

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

linear projection · 1.7gaussian model · 1.7
YearPublicationVenuePosition
2025 Supervised Dimension Reduction Through Linear Projection
abstract
This paper proposes two linear projection approaches for supervised dimension reduction using only the first and second-order statistics for the binary classification problem. They are derived under the general Gaussian model by maximizing the Kullback-Leibler divergence between the two classes in the projected sample. They subsume existing linear projection approaches developed under simplifying assumptions of Gaussian distributions, i.e., when these distributions share an equal mean or covariance matrix. Experiments are conducted to validate the proposed solutions and demonstrate their effectiveness for supervised dimension reduction.
Biao Chen 0001, Joshua Kortje
ICASSP2
2025 Divergence Maximizing Linear Projection for Supervised Dimension Reduction
abstract
This paper proposes two linear projection methods for supervised dimension reduction using only the first and second-order statistics. The methods, each catering to a different parameter regime, are derived under the general Gaussian model by maximizing the Kullback-Leibler divergence between the two classes in the projected sample for a binary classification problem. They subsume existing linear projection approaches developed under simplifying assumptions of Gaussian distributions, such as these distributions might share an equal mean or covariance matrix. As a by-product, we establish that the multi-class linear discriminant analysis, a celebrated method for classification and supervised dimension reduction, is provably optimal for maximizing pairwise Kullback-Leibler divergence when the Gaussian populations share an identical covariance matrix. For the case when the Gaussian distributions share an equal mean, we establish conditions under which the optimal subspace remains invariant regardless of how the Kullback-Leibler divergence is defined, despite the asymmetry of the divergence measure itself. Such conditions encompass the classical case of signal plus noise, where both signal and noise have zero mean and arbitrary covariance matrices. Experiments are conducted to validate the proposed solutions, demonstrate their superior performance over existing alternatives, and illustrate the procedure for selecting the appropriate linear projection solution.
Biao Chen 0001, Joshua Kortje
IEEE Trans. Inf. Theory2