activity
20122023
most citedAn Online Boosting Algorithm with Theoretical Justifications

41 citations · 108 across the 11 of their papers we have counts for

collaborators

14 papers

cs.GT2023★ 1 cited

A Computational Analysis of Strategic Nominations: Modeling Equilibrium and Complexity in Organizational Elections

Chuang-Chieh Lin, Chi-Jen Lu, Po-An Chen +1

We study organizational elections in which each group nominates one candidate and receives as payoff its members expected utility under a probabilistic winning rule. We empirically…

cs.LG2022★ 1 cited

Improved analysis of randomized SVD for top-eigenvector approximation

Ruo-Chun Tzeng, Po-An Wang, Florian Adriaens +2

Computing the top eigenvectors of a matrix is a problem of fundamental interest to various fields. While the majority of the literature has focused on analyzing the reconstruction…

cs.CL2021

Rethinking Why Intermediate-Task Fine-Tuning Works

Ting-Yun Chang, Chi-Jen Lu

Supplementary Training on Intermediate Labeled-data Tasks (STILTs) is a widely applied technique, which first fine-tunes the pretrained language models on an intermediate task befo…

cs.CV2020★ 2 cited

TinyGAN: Distilling BigGAN for Conditional Image Generation

Ting-Yun Chang, Chi-Jen Lu

Generative Adversarial Networks (GANs) have become a powerful approach for generative image modeling. However, GANs are notorious for their training instability, especially on larg…

cs.GT2020

How Good Is a Two-Party Election Game?

Chuang-Chieh Lin, Chi-Jen Lu, Po-An Chen

In this paper, we propose a simple and intuitive model to investigate the efficiency of the two-party election system, especially regarding the nomination process. Each of the two…

cs.GT2019★ 2 cited

An Alternating Algorithm for Finding Linear Arrow-Debreu Market Equilibria

Po-An Chen, Chi-Jen Lu, Yu-Sin Lu

Motivated by the convergence result of mirror-descent algorithms to market equilibria in linear Fisher markets, it is natural for one to consider designing dynamics (specifically,…