<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Semi-Supervised Learning | Bohan Chen's Personal Webpage</title><link>https://chenbh.com/tags/semi-supervised-learning/</link><atom:link href="https://chenbh.com/tags/semi-supervised-learning/index.xml" rel="self" type="application/rss+xml"/><description>Semi-Supervised Learning</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Wed, 11 Dec 2024 00:00:00 +0000</lastBuildDate><image><url>https://chenbh.com/media/icon_hu5000416120042106492.png</url><title>Semi-Supervised Learning</title><link>https://chenbh.com/tags/semi-supervised-learning/</link></image><item><title>GLL: A Differentiable Graph Learning Layer for Neural Networks</title><link>https://chenbh.com/publication/brown-gll-2024/</link><pubDate>Wed, 11 Dec 2024 00:00:00 +0000</pubDate><guid>https://chenbh.com/publication/brown-gll-2024/</guid><description>&lt;p>The &lt;strong>graph learning layer (GLL)&lt;/strong> replaces the usual projection head and softmax
classifier with graph-Laplacian label propagation. Samples in a minibatch become nodes of
a similarity graph, allowing predictions to use relationships among examples instead of
classifying each representation independently.&lt;/p>
&lt;p>The main technical contribution is an exact end-to-end differentiation rule for a broad
family of graph learning methods. By deriving the backward pass with the adjoint method,
the graph solver can participate directly in neural-network training rather than being
detached from the feature extractor or differentiated through a heuristic approximation.&lt;/p>
&lt;p>Experiments show smoother transitions between classes, improved optimization and
generalization, and stronger resistance to adversarial perturbations than a conventional
softmax head. The framework supports both supervised and semi-supervised learning and is
released with an open-source implementation.&lt;/p></description></item><item><title>Graph-Based Active Learning for Nearly Blind Hyperspectral Unmixing</title><link>https://chenbh.com/publication/chen-graph-based-2023/</link><pubDate>Mon, 11 Sep 2023 00:00:00 +0000</pubDate><guid>https://chenbh.com/publication/chen-graph-based-2023/</guid><description>&lt;p>This work formulates &lt;strong>nearly blind hyperspectral unmixing&lt;/strong> as a semi-supervised problem:
instead of assuming all endmember spectra are known, it requests abundance information or
simple one-hot pseudo-labels for only a very small set of pixels selected by graph-based
active learning.&lt;/p>
&lt;p>Two complementary models are introduced. Graph Learning Unmixing (GLU) interprets graph
Laplace class probabilities directly as abundance maps and then estimates the endmembers.
Graph-Regularized Semi-supervised Unmixing (GRSU) combines the linear mixing model,
nonnegativity and sum-to-one constraints, graph regularization, and supervision on the
queried pixels in a joint optimization problem initialized by GLU.&lt;/p>
&lt;p>Experiments on Urban, Samson, and Jasper Ridge imagery show that both exact abundances and
easy-to-obtain one-hot labels substantially improve blind-unmixing baselines. With only
0.4% of pixels labeled, the proposed methods improve state-of-the-art blind approaches by
50% or more on the reported reconstruction and abundance-estimation metrics.&lt;/p></description></item></channel></rss>