<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Minghui Chen</title>
		<link>https://minghuichen.com/</link>
		<description>Recent content on Minghui Chen</description>
		<generator>Hugo</generator>
		<language>en</language>
		
		
		
		
			<lastBuildDate>Wed, 28 Jan 2026 00:00:00 +0000</lastBuildDate>
		
			<atom:link href="https://minghuichen.com/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>Textual Equilibrium Propagation for Deep Compound AI Systems</title>
				<link>https://minghuichen.com/publication/iclr_2026_tep/</link>
				<pubDate>Wed, 28 Jan 2026 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/publication/iclr_2026_tep/</guid>
				<description>&lt;p&gt;&lt;strong&gt;Authors:&lt;/strong&gt; Minghui Chen, Wenlong Deng, James Zou, Han Yu, Xiaoxiao Li&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Published in:&lt;/strong&gt; Accepted to The Fourteenth International Conference on Learning Representations (&lt;strong&gt;ICLR 2026&lt;/strong&gt;)&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h2 id=&#34;abstract&#34;&gt;Abstract&#xA;  &lt;a href=&#34;#abstract&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Large language models (LLMs) are increasingly deployed as part of compound AI systems that coordinate multiple modules, such as retrievers, tools, and verifiers, over long-horizon workflows. Recent approaches that propagate textual feedback globally, such as TextGrad, make it feasible to optimize such pipelines, but we find that performance degrades as system depth grows.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Predoctoral Staff Associate</title>
				<link>https://minghuichen.com/experience/columbia-2025/</link>
				<pubDate>Wed, 01 Oct 2025 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/experience/columbia-2025/</guid>
				<description>&lt;p&gt;&lt;strong&gt;Position:&lt;/strong&gt; Predoctoral Staff Associate&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Institution:&lt;/strong&gt; Columbia Business School, Columbia University&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Division:&lt;/strong&gt; Decision, Risk, and Operations&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Advisor:&lt;/strong&gt; Prof. Hongseok Namkoong&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Period:&lt;/strong&gt; October 2024 - Present&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Location:&lt;/strong&gt; New York, NY&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h2 id=&#34;research-focus&#34;&gt;Research Focus&#xA;  &lt;a href=&#34;#research-focus&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Exploring reinforcement learning with LLM agents, focusing on:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Decision making under uncertainty&lt;/li&gt;&#xA;&lt;li&gt;Applications of large language models in sequential decision problems&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
			</item>
			<item>
				<title>Can Textual Gradient Work in Federated Learning?</title>
				<link>https://minghuichen.com/publication/iclr_2025_fedtextgrad/</link>
				<pubDate>Fri, 24 Jan 2025 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/publication/iclr_2025_fedtextgrad/</guid>
				<description>&lt;p&gt;&lt;strong&gt;Authors:&lt;/strong&gt; Minghui Chen, Ruinan Jin, Wenlong Deng, Yuanyuan Chen, Zhi Huang, Han Yu, Xiaoxiao Li&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Published in:&lt;/strong&gt; The Thirteenth International Conference on Learning Representations (&lt;strong&gt;ICLR 2025&lt;/strong&gt;)&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h2 id=&#34;abstract&#34;&gt;Abstract&#xA;  &lt;a href=&#34;#abstract&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Recent studies highlight the promise of LLM-based prompt optimization, especially with TextGrad, which automates &amp;ldquo;differentiation&amp;rdquo; via texts and backpropagates textual feedback provided by LLMs. This approach facilitates training in various real-world applications that do not support numerical gradient propagation or loss calculation. It opens new avenues for optimization in decentralized, resource-constrained environments, suggesting that users of black-box LLMs (e.g., ChatGPT) could enhance components of LLM agentic systems (such as prompt optimization) through collaborative paradigms like federated learning (FL).&lt;/p&gt;</description>
			</item>
			<item>
				<title>Revisiting Delta-Parameter Pruning For Fine-Tuned Models</title>
				<link>https://minghuichen.com/publication/iclr_2025_xdare/</link>
				<pubDate>Thu, 23 Jan 2025 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/publication/iclr_2025_xdare/</guid>
				<description>&lt;p&gt;&lt;strong&gt;Authors:&lt;/strong&gt; Wenlong Deng, Yize Zhao, Vala Vakilian, Minghui Chen, Xiaoxiao Li, Christos Thrampoulidis&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Published in:&lt;/strong&gt; The Thirteenth International Conference on Learning Representations (&lt;strong&gt;ICLR 2025, Spotlight&lt;/strong&gt;)&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h2 id=&#34;abstract&#34;&gt;Abstract&#xA;  &lt;a href=&#34;#abstract&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Storing open-source fine-tuned models separately introduces redundancy and increases response times in applications utilizing multiple models. Delta-parameter pruning (DPP), particularly the random drop and rescale (DARE) method proposed by Yu et al., addresses this by pruning the majority of delta parameters—the differences between fine-tuned and pre-trained model weights—while typically maintaining minimal performance loss. However, DARE fails when either the pruning rate or the magnitude of the delta parameters is large. We highlight two key reasons for this failure - (1) an excessively large rescaling factor as pruning rates increase, and (2) high mean and variance in the delta parameters. To address these, we develop two algorithmic improvements - (1) DARq, which modifies the rescaling factor in DARE, leading to significant performance gains at high pruning rates (e.g., &amp;gt;30% on COLA and SST2 for encoder models, with even larger improvements in decoder models), and (2) AdamR, an in-training modification that incorporates appropriate Delta regularization before applying DPP. We also demonstrate that DARq can be seamlessly combined with vanilla parameter-efficient fine-tuning techniques like LoRA and can facilitate structural DPP. Additionally, we revisit the application of importance-based pruning techniques within DPP, demonstrating that they outperform random-based methods when delta parameters are large. Through this comprehensive study, we develop a pipeline for selecting the most appropriate DPP method under various practical scenarios.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Local Superior Soups: A Catalyst for Model Merging in Cross-Silo Federated Learning</title>
				<link>https://minghuichen.com/publication/neurips_2024_lss/</link>
				<pubDate>Tue, 15 Oct 2024 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/publication/neurips_2024_lss/</guid>
				<description>&lt;p&gt;&lt;strong&gt;Authors:&lt;/strong&gt; Minghui Chen, Meirui Jiang, Xin Zhang, Qi Dou, Zehua Wang, Xiaoxiao Li&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Published in:&lt;/strong&gt; The Thirty-Eighth Conference on Neural Information Processing Systems (&lt;strong&gt;NeurIPS 2024&lt;/strong&gt;)&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h2 id=&#34;abstract&#34;&gt;Abstract&#xA;  &lt;a href=&#34;#abstract&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Federated learning (FL) is a learning paradigm that enables collaborative training of models using decentralized data. Recently, the utilization of pre-trained weight initialization in FL has been demonstrated to effectively improve model performance. However, the evolving complexity of current pre-trained models, characterized by a substantial increase in parameters, markedly intensifies the challenges associated with communication rounds required for their adaptation to FL. To address these communication cost issues and increase the performance of pre-trained model adaptation in FL, we propose an innovative model interpolation-based local training technique called &amp;ldquo;Local Superior Soups.&amp;rdquo; Our method enhances local training across different clients, encouraging the exploration of a connected low-loss basin within a few communication rounds through regularized model interpolation. This approach acts as a catalyst for the seamless adaptation of pre-trained models in in FL. We demonstrated its effectiveness and efficiency across diverse widely-used FL datasets.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Debiased Noise Editing on Foundation Models for Fair Medical Image Classification</title>
				<link>https://minghuichen.com/publication/miccai_2024_dne/</link>
				<pubDate>Fri, 20 Sep 2024 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/publication/miccai_2024_dne/</guid>
				<description>&lt;p&gt;&lt;strong&gt;Authors:&lt;/strong&gt; Ruinan Jin, Wenlong Deng, Minghui Chen, Xiaoxiao Li&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Published in:&lt;/strong&gt; The 27th International Conference on Medical Image Computing and Computer Assisted Intervention (&lt;strong&gt;MICCAI 2024&lt;/strong&gt;)&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h2 id=&#34;abstract&#34;&gt;Abstract&#xA;  &lt;a href=&#34;#abstract&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;In the era of Foundation Models&amp;rsquo; (FMs) rising prominence in AI, our study addresses the challenge of biases in medical images while the model operates in black-box (e.g., using FM API), particularly spurious correlations between pixels and sensitive attributes. Traditional methods for bias mitigation face limitations due to the restricted access to web-hosted FMs and difficulties in addressing the underlying bias encoded within the FM API. We propose a D(ebiased) N(oise) E(diting) strategy, termed DNE, which generates DNE noise to mask such spurious correlation. DNE is capable of mitigating bias both within the FM API embedding and the images themselves. Furthermore, DNE is suitable for both white-box and black-box FM APIs, where we introduced G(reedy) (Z)eroth-O(rder) (GeZO) optimization for it when the gradient is inaccessible in black-box APIs. Our whole pipeline enables fairness-aware image editing that can be applied across various medical contexts without requiring direct model manipulation or significant computational resources. Our empirical results demonstrate the method&amp;rsquo;s effectiveness in maintaining fairness and utility across different patient groups and diseases. In the era of AI-driven medicine, this work contributes to making healthcare diagnostics more equitable, showcasing a practical solution for bias mitigation in pre-trained image FMs.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Forgettable Federated Linear Learning with Certified Data Removal</title>
				<link>https://minghuichen.com/publication/preprint_2024_f2l2/</link>
				<pubDate>Fri, 20 Sep 2024 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/publication/preprint_2024_f2l2/</guid>
				<description>&lt;p&gt;&lt;strong&gt;Authors:&lt;/strong&gt; Ruinan Jin, Minghui Chen, Qiong Zhang, Xiaoxiao Li&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Published in:&lt;/strong&gt; WWW 2024 FL@FM Workshop (&lt;strong&gt;Best Paper Award&lt;/strong&gt; 🏆)&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h2 id=&#34;abstract&#34;&gt;Abstract&#xA;  &lt;a href=&#34;#abstract&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Federated learning (FL) is a trending distributed learning framework that enables collaborative model training without data sharing. Machine learning models trained on datasets can potentially expose the private information of the training data, revealing details about individual data records. In this study, we focus on the FL paradigm that grants clients the &amp;ldquo;right to be forgotten&amp;rdquo;. The forgettable FL framework should bleach its global model weights as it has never seen that client and hence does not reveal any information about the client. To this end, we propose the Forgettable Federated Linear Learning (2F2L) framework featured with novel training and data removal strategies. The training pipeline, named Federated linear training, employs linear approximation on the model parameter space to enable our 2F2L framework work for deep neural networks while achieving comparable results with canonical neural network training. We also introduce FedRemoval, an efficient and effective removal strategy that tackles the computational challenges in FL by approximating the Hessian matrix using public server data from the pretrained model. Unlike the previous uncertified and heuristic machine unlearning methods in FL, we provide theoretical guarantees by bounding the differences of model weights by our FedRemoval and that from retraining from scratch. Experimental results on MNIST and Fashion-MNIST datasets demonstrate the effectiveness of our method in achieving a balance between model accuracy and information removal, outperforming baseline strategies and approaching retraining from scratch.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Research Associate</title>
				<link>https://minghuichen.com/experience/ntu-2024/</link>
				<pubDate>Mon, 01 Jul 2024 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/experience/ntu-2024/</guid>
				<description>&lt;p&gt;&lt;strong&gt;Position:&lt;/strong&gt; Research Associate&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Institution:&lt;/strong&gt; Nanyang Technological University&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Advisor:&lt;/strong&gt; Prof. Xiaoxiao Li &amp;amp; Prof. Han Yu&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Period:&lt;/strong&gt; July 2024 - October 2025&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Location:&lt;/strong&gt; Singapore&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h2 id=&#34;research-focus&#34;&gt;Research Focus&#xA;  &lt;a href=&#34;#research-focus&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Exploring federated learning and multi-agent collaboration, focusing on:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Personalization in heterogeneous federated learning&lt;/li&gt;&#xA;&lt;li&gt;LLM-driven multi-agent collaboration&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
			</item>
			<item>
				<title>Research Associate</title>
				<link>https://minghuichen.com/experience/vector-2023/</link>
				<pubDate>Fri, 01 Sep 2023 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/experience/vector-2023/</guid>
				<description>&lt;p&gt;&lt;strong&gt;Position:&lt;/strong&gt; Research Associate&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Institution:&lt;/strong&gt; Vector Institute&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Advisor:&lt;/strong&gt; Prof. Xiaoxiao Li&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Period:&lt;/strong&gt; September 2023 - July 2024&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Location:&lt;/strong&gt; Remote&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h2 id=&#34;research-focus&#34;&gt;Research Focus&#xA;  &lt;a href=&#34;#research-focus&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Exploring federated learning, focusing on:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Personalization in heterogeneous federated learning&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
			</item>
			<item>
				<title>FedSoup: Improving Generalization and Personalization in Federated Learning via Selective Model Interpolation</title>
				<link>https://minghuichen.com/publication/miccai_2023_fedsoup/</link>
				<pubDate>Thu, 20 Jul 2023 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/publication/miccai_2023_fedsoup/</guid>
				<description>&lt;p&gt;&lt;strong&gt;Authors:&lt;/strong&gt; Minghui Chen, Meirui Jiang, Qi Dou, Zehua Wang, Xiaoxiao Li&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Published in:&lt;/strong&gt; The 26th International Conference on Medical Image Computing and Computer Assisted Intervention (&lt;strong&gt;MICCAI 2023&lt;/strong&gt;)&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h2 id=&#34;abstract&#34;&gt;Abstract&#xA;  &lt;a href=&#34;#abstract&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Cross-silo federated learning (FL) enables the development of machine learning models on datasets distributed across data centers such as hospitals and clinical research laboratories. However, recent research has found that current FL algorithms face a trade-off between local and global performance when confronted with distribution shifts. Specifically, personalized FL methods have a tendency to overfit to local data, leading to a sharp valley in the local model and inhibiting its ability to generalize to out-of-distribution data. In this paper, we propose a novel federated model soup method (i.e., selective interpolation of model parameters) to optimize the trade-off between local and global performance. Specifically, during the federated training phase, each client maintains its own global model pool by monitoring the performance of the interpolated model between the local and global models. This allows us to alleviate overfitting and seek flat minima, which can significantly improve the model&amp;rsquo;s generalization performance.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Research Associate</title>
				<link>https://minghuichen.com/experience/ubc-2022/</link>
				<pubDate>Thu, 01 Sep 2022 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/experience/ubc-2022/</guid>
				<description>&lt;p&gt;&lt;strong&gt;Position:&lt;/strong&gt; Research Associate&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Institution:&lt;/strong&gt; University of British Columbia&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Advisor:&lt;/strong&gt; Prof. Xiaoxiao Li &amp;amp; Prof. Zehua Wang&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Period:&lt;/strong&gt; September 2022 - July 2024&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Location:&lt;/strong&gt; Remote&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h2 id=&#34;research-focus&#34;&gt;Research Focus&#xA;  &lt;a href=&#34;#research-focus&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Exploring federated learning, focusing on:&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Personalization in heterogeneous federated learning&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
			</item>
			<item>
				<title>VITA: A Multi-Source Vicinal Transfer Augmentation Method for Out-of-Distribution Generalization</title>
				<link>https://minghuichen.com/publication/aaai_2022_vita/</link>
				<pubDate>Tue, 01 Feb 2022 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/publication/aaai_2022_vita/</guid>
				<description>&lt;p&gt;&lt;strong&gt;Authors:&lt;/strong&gt; Minghui Chen, Cheng Wen, Feng Zheng, Fengxiang He, Ling Shao&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Published in:&lt;/strong&gt; Proceedings of the AAAI Conference on Artificial Intelligence (&lt;strong&gt;AAAI 2022&lt;/strong&gt;)&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h2 id=&#34;abstract&#34;&gt;Abstract&#xA;  &lt;a href=&#34;#abstract&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Invariance to diverse types of image corruption, such as noise, blurring, or colour shifts, is essential to establish robust models in computer vision. Data augmentation has been the major approach in improving the robustness against common corruptions. However, the samples produced by popular augmentation strategies deviate significantly from the underlying data manifold. As a result, performance is skewed toward certain types of corruption. To address this issue, we propose a multi-source vicinal transfer augmentation (VITA) method for generating diverse on-manifold samples. The proposed VITA consists of two complementary parts, tangent transfer and integration of multi-source vicinal samples. The tangent transfer creates initial augmented samples for improving corruption robustness. The integration employs a generative model to characterize the underlying manifold built by vicinal samples, facilitating the generation of on-manifold samples. Our proposed VITA significantly outperforms the current state-of-the-art augmentation methods, demonstrated in extensive experiments on corruption benchmarks.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Peer Reviewer</title>
				<link>https://minghuichen.com/service/reviewer/</link>
				<pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/service/reviewer/</guid>
				<description>&lt;h2 id=&#34;conference-reviewer&#34;&gt;Conference Reviewer&#xA;  &lt;a href=&#34;#conference-reviewer&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Period:&lt;/strong&gt; 2022 - Present&lt;/p&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;NeurIPS&lt;/strong&gt; - Conference on Neural Information Processing Systems&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;ICLR&lt;/strong&gt; - International Conference on Learning Representations&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;ICML&lt;/strong&gt; - International Conference on Machine Learning&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;AISTATS&lt;/strong&gt; - International Conference on Artificial Intelligence and Statistics&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;CVPR&lt;/strong&gt; - Conference on Computer Vision and Pattern Recognition&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;ICCV&lt;/strong&gt; - International Conference on Computer Vision&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;ECCV&lt;/strong&gt; - European Conference on Computer Vision&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;CoLLAs&lt;/strong&gt; - Conference on Lifelong Learning Agents&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;MIDL&lt;/strong&gt; - Medical Imaging with Deep Learning&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h2 id=&#34;journal-reviewer&#34;&gt;Journal Reviewer&#xA;  &lt;a href=&#34;#journal-reviewer&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;&lt;strong&gt;Period:&lt;/strong&gt; 2023 - Present&lt;/p&gt;</description>
			</item>
			<item>
				<title>Corruption Invariant Person Re-Identification</title>
				<link>https://minghuichen.com/talk/valse_cil-reid/</link>
				<pubDate>Thu, 30 Dec 2021 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/talk/valse_cil-reid/</guid>
				<description>&lt;h2 id=&#34;abstract&#34;&gt;Abstract&#xA;  &lt;a href=&#34;#abstract&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;When deploying person re-identification (ReID) model in safety-critical applications, it is pivotal to understanding the robustness of the model against a diverse array of image corruptions. However, current evaluations of person ReID only consider the performance on clean datasets and ignore images in various corrupted scenarios.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Benchmarks for Corruption Invariant Person Re-Identification</title>
				<link>https://minghuichen.com/publication/neurips_2021_cil-reid/</link>
				<pubDate>Wed, 01 Dec 2021 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/publication/neurips_2021_cil-reid/</guid>
				<description>&lt;p&gt;&lt;strong&gt;Authors:&lt;/strong&gt; Minghui Chen (Equal contribution), Zhiqiang Wang (Equal contribution), Feng Zheng&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Published in:&lt;/strong&gt; Thirty-sixth Conference on Neural Information Processing Systems (&lt;strong&gt;NeurIPS 2021&lt;/strong&gt;)&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h2 id=&#34;abstract&#34;&gt;Abstract&#xA;  &lt;a href=&#34;#abstract&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;When deploying person re-identification (ReID) model in safety-critical applications, it is pivotal to understanding the robustness of the model against a diverse array of image corruptions. However, current evaluations of person ReID only consider the performance on clean datasets and ignore images in various corrupted scenarios. In this work, we comprehensively establish five ReID benchmarks for learning corruption invariant representation. In the field of ReID, we are the first to conduct an exhaustive study on corruption invariant learning in single- and cross-modality datasets, including Market-1501, CUHK03, MSMT17, RegDB, SYSU-MM01. After reproducing and examining the robustness performance of 21 recent ReID methods, we have some observations, 1) transformer-based models are more robust towards corrupted images, compared with CNN-based models, 2) increasing the probability of random erasing (a commonly used augmentation method) hurts model corruption robustness, 3) cross-dataset generalization improves with corruption robustness increases. By analyzing the above observations, we propose a strong baseline on both single- and cross-modality ReID datasets which achieves improved robustness against diverse corruptions. Our codes are available on github(&#xA;&lt;a href=&#34;https://github.com/MinghuiChen43/CIL-ReID%29&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;https://github.com/MinghuiChen43/CIL-ReID)&lt;/a&gt;.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Contact</title>
				<link>https://minghuichen.com/contact/</link>
				<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/contact/</guid>
				<description>&lt;h2 id=&#34;get-in-touch&#34;&gt;Get in Touch&#xA;  &lt;a href=&#34;#get-in-touch&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;I&amp;rsquo;m always interested in discussing research collaborations, new ideas, and opportunities in AI and machine learning.&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h3 id=&#34;email&#34;&gt;Email&#xA;  &lt;a href=&#34;#email&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h3&gt;&#xA;&lt;p&gt;For academic inquiries and collaborations, please reach out via email:&lt;/p&gt;</description>
			</item>
			<item>
				<title>Full Publication List</title>
				<link>https://minghuichen.com/publication-list/</link>
				<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/publication-list/</guid>
				<description></description>
			</item>
			<item>
				<title>License</title>
				<link>https://minghuichen.com/license/</link>
				<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
				<guid>https://minghuichen.com/license/</guid>
				<description>&lt;h2 id=&#34;website-license&#34;&gt;Website License&#xA;  &lt;a href=&#34;#website-license&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;This website is built using &#xA;&lt;a href=&#34;https://gohugo.io/&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;Hugo&lt;/a&gt; and the &#xA;&lt;a href=&#34;https://github.com/hugo-apero/hugo-apero&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;Hugo Apéro theme&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;The Hugo Apéro theme is licensed under the &#xA;&lt;a href=&#34;https://creativecommons.org/licenses/by/4.0/&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;CC-BY-4.0 License&lt;/a&gt;.&lt;/p&gt;&#xA;&#xA;&#xA;&#xA;&#xA;&lt;h2 id=&#34;content-license&#34;&gt;Content License&#xA;  &lt;a href=&#34;#content-license&#34;&gt;&lt;svg class=&#34;anchor-symbol&#34; aria-hidden=&#34;true&#34; height=&#34;26&#34; width=&#34;26&#34; viewBox=&#34;0 0 22 22&#34; xmlns=&#34;http://www.w3.org/2000/svg&#34;&gt;&#xA;      &lt;path d=&#34;M0 0h24v24H0z&#34; fill=&#34;currentColor&#34;&gt;&lt;/path&gt;&#xA;      &lt;path d=&#34;M3.9 12c0-1.71 1.39-3.1 3.1-3.1h4V7H7c-2.76.0-5 2.24-5 5s2.24 5 5 5h4v-1.9H7c-1.71.0-3.1-1.39-3.1-3.1zM8 13h8v-2H8v2zm9-6h-4v1.9h4c1.71.0 3.1 1.39 3.1 3.1s-1.39 3.1-3.1 3.1h-4V17h4c2.76.0 5-2.24 5-5s-2.24-5-5-5z&#34;&gt;&lt;/path&gt;&#xA;    &lt;/svg&gt;&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Unless otherwise noted, all content on this website (including blog posts, documentation, and other written materials) is licensed under a &#xA;&lt;a href=&#34;https://creativecommons.org/licenses/by/4.0/&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;Creative Commons Attribution 4.0 International License&lt;/a&gt;.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
