<!DOCTYPE html>
<html>

<head>
	<meta charset="UTF-8">
	<title>Mingyang Deng</title>
	<link href="https://fonts.googleapis.com/css?family=Roboto" rel="stylesheet">
	<style>
		body {
			font-family: 'Roboto', sans-serif;
			margin: 0;
			padding: 0;
			background-color: #f2f2f2;
		}

		.container {
			max-width: 800px;
			margin: 0 auto;
			padding: 40px;
			background-color: #fff;
			box-shadow: 0px 0px 10px rgba(0, 0, 0, 0.2);
			display: flex;
			flex-wrap: wrap;
			align-items: flex-start;
			justify-content: space-between;
		}

		.container section {
			flex-basis: calc(50% - 20px);
			margin-bottom: 20px;
		}

		h1,
		h2,
		h3 {
			margin-top: 0;
		}

		h1 {
			font-size: 36px;
			font-weight: bold;
			color: #333;
		}

		h2 {
			font-size: 24px;
			font-weight: bold;
			color: #333;
		}

		h3 {
			font-size: 18px;
			font-weight: bold;
			color: #333;
			padding: 20px;
		}

		p {
			font-size: 16px;
			line-height: 1.5;
			color: #666;
		}

		ul {
			margin: 0;
			padding: 0;
			list-style: none;
		}

		li {
			margin-bottom: 10px;
		}

		a {
			color: #0077cc;
			text-decoration: none;
		}

		a:hover {
			text-decoration: underline;
		}

		img {
			/* flex: 1 1 50%; */
			width: 30%;
			height: auto;
		}

		.publication-title {
			font-weight: bold;
			font-size: 18px;
			margin-bottom: 5px;
		}

		.publication-author {
			font-size: 16px;
			margin-bottom: 5px;
		}

		.publication-info {
			font-size: 14px;
			color: #666;
		}

		.publication-link a {
			color: #0066cc;
			text-decoration: none;
		}

		.publication-link a:hover {
			text-decoration: underline;
		}
	</style>
</head>

<body>
	<div class="container">
		<header>
			<h1>Mingyang Deng</h1>
		</header>
		<main>
			<section style="display: flex; flex-direction: row; justify-content: space-between; align-items: center;">
				<div style="padding-right: 20px;">
					<p>Hello! I'm Mingyang Deng, a first-year PhD student at MIT, where I'm fortunate to be advised by
						Prof. <a href="https://people.csail.mit.edu/kaiming/">Kaiming He</a>. My research focuses on
						machine
						learning.
					</p>
					<p>I earned my undergraduate degree from MIT, double majoring in Mathematics
						and Computer Science. During my studies, I had the invaluable opportunity to collaborate with
						Prof. <a href="https://people.csail.mit.edu/tommi/">Tommi Jaakkola</a>. His mentorship was
						pivotal in igniting my passion for machine learning research, and I am deeply grateful for his
						guidance, which has shaped my current path in the field. Additionally, I had the privilege of
						exploring fine-grained complexity under the guidance of Prof. <a
							href="https://people.csail.mit.edu/virgi/">Virginia Vassilevska Williams</a> and delving
						into combinatorics with Prof. <a href="https://yufeizhao.com/">Yufei Zhao</a>.</p>

					<p>Prior to my PhD, I gained valuable industry experience through internships at Google DeepMind,
						Citadel Securities, and Pika.</p>


					<p> You can contact me at dengm at mit dot edu and
						view my resume <a href="resume.pdf">here</a>.
					</p>
				</div>
				<img src="./photo.jpg" alt="Mingyang Deng" style="max-width: 170px; height: auto;">
			</section>
			<section>
				<h2>Selected Awards</h2>
				<ul>
					<li>1st place @ 45th Annual ICPC World Finals </li>
					<li>Putnam Fellow @ 83rd William Lowell Putnam Competition</li>
					<li>Gold medal (1st place) @ 33rd International Olympiad in Informatics</li>
					<li>Gold medal @ 60th International Mathematical Olympiad</li>
					<li>2nd place @ HackMIT 2021</li>
					<li>4th place @ Google Code Jam Final 2021</li>
				</ul>
			</section>
			<section>
				<h2>Publications</h2>
				<ul>

					<li>
						<div class="publication-title"><a href="https://arxiv.org/abs/2406.11838.pdf">Autoregressive
								Image Generation without Vector Quantization</a></div>
						<div class="publication-info">Tianhong Li, Yonglong Tian, He Li, Mingyang Deng, Kaiming He |
							NeurIPS 2024 (Spotlight). </div>
					</li>
					<li>
						<div class="publication-title"><a href="https://arxiv.org/pdf/2306.14878.pdf">Restart Sampling
								for Improving Generative Processes</a></div>
						<div class="publication-info">Yilun Xu*, Mingyang Deng*, Xiang Cheng*, Yonglong Tian, Ziming
							Liu, Tommi Jaakkola | NeurIPS 2023. </div>
					</li>

					<li>
						<div class="publication-title"><a href="https://arxiv.org/pdf/2310.07837.pdf">Measuring Feature
								Sparsity in Language Models</a></div>
						<div class="publication-info">Mingyang Deng*, Lucas Tao*, Joe Benton | NeurIPS 2023 SoLAR
							workshop (Spotlight).</div>
					</li>
					<li>
						<div class="publication-title"><a href="https://arxiv.org/abs/2307.06914">Uniform sets with few
								progressions via colorings</a></div>
						<div class="publication-info">Mingyang Deng*, Jonathan Tidor*, Yufei Zhao* | Submitted to
							Mathematical Proceedings of the Cambridge Philosophical Society.</div>
					</li>
					<li>
						<div class="publication-title"><a
								href="https://epubs.siam.org/doi/epdf/10.1137/1.9781611977554.ch114">On Problems Related
								to Unbounded SubsetSum: A Unified Combinatorial Approach</a></div>
						<div class="publication-info">Mingyang Deng*, Xiao Mao*, Ziqian Zhong* | SODA 2023. </div>
					</li>
					<li>
						<div class="publication-title"><a
								href="https://epubs.siam.org/doi/epdf/10.1137/1.9781611977554.ch113">Approximating
								Knapsack and Partition via Dense Subset Sums</a></div>
						<div class="publication-info"> Mingyang Deng*, Ce Jin*, Xiao Mao* | SODA 2023. </div>
					</li>
					<li>
						<div class="publication-title"><a
								href="https://drops.dagstuhl.de/opus/volltexte/2022/16391/pdf/LIPIcs-ICALP-2022-50.pdf">New
								Additive Approximations for Shortest Paths and Cycles</a></div>
						<div class="publication-info"> Mingyang Deng*, Yael Kirkpatrick*, Victor Rong*, Virginia
							Vassilevska Williams*, Ziqian Zhong* | ICALP 2022.</div>
					</li>
					<li>
						<div class="publication-title"><a
								href="https://drops.dagstuhl.de/opus/volltexte/2022/16839/pdf/LIPIcs-MFCS-2022-41.pdf">New
								Lower Bounds and Upper Bounds for Listing Avoidable Vertices</a></div>
						<div class="publication-info"> Mingyang Deng*, Virginia Vassilevska Williams*, Ziqian Zhong* |
							MFCS 2022.</div>
					</li>

					<!-- Add more publications as needed -->
				</ul>
			</section>
			<section id="projects">
				<h2>Projects</h2>
				<p>I have lots of random thoughts, so I implemented many projects.</p>
				<ul>
					<li>
						<div class="publication-title"><a href="http://goodchess.top">Good chess</a></div>
						<div class="publication-info">A great chess game, as the name suggests. </div>
					</li>
					<li>
						<div class="publication-title"><a href="http://beaverdam.top">Beaverdam</a></div>
						<div class="publication-info">A social media platform that limits users to reading at most one
							article per day, thus encouraging them to seek out new content. </div>
					</li>
					<li>
						<div class="publication-title"><a
								href="https://fjzzq2002.github.io/april_fools_group_delivery/index.html">Group
								delivery</a></div>
						<div class="publication-info">MIT has an annual ring delivery where students order gold, silver,
							or copper rings, but it's not very MIT-like. So we designed group delivery.</div>
					</li>
					<li>
						<div class="publication-title"><a href="https://codeforces.com/blog/entry/90513">Hamiltonian
								paths</a></div>
						<div class="publication-info">A methodology to solve Hamiltonian paths in random graphs very
							quickly. </div>

					</li>
				</ul>
			</section>

		</main>
	</div>
</body>

</html>