I am a fourth-year PhD student in Operations, Information & Technology at the Stanford Graduate School of Business. I am interested in optimization algorithms, and applying large scale optimization algorithms to statistical inference problems, revenue management problems, and economics modeling with specific interests in auctions and mechanism design.
The Alternating Direction Method of Multipliers (ADMM) has gained a lot of attention for solving large-scale and objective-separable constrained optimization. Unfortunately, the multi-block ADMM, with more than two blocks, is not guaranteed to be convergent. In this paper, we add more randomness into the ADMM by developing a randomly assembled cyclic ADMM (RAC-ADMM) where the decision variables in each block are randomly assembled. We discuss the theoretical properties of RAC-ADMM and show when random assembling helps and when it hurts, and develop a criterion to guarantee that it converges almost surely. Using the theoretical guidance on RAC-ADMM, we conduct multiple numerical tests on solving both randomly generated and large-scale benchmark quadratic optimization problems, which include continuous, and binary graph-partition and quadratic assignment, and selected machine learning problems. Our numerical tests show that the RAC-ADMM could significantly improve the computation efficiency on solving most quadratic optimization problems.
Work in Progress
We studied fast convergence algorithm under weak and strong data privacy constraints. We proposed a sharing algorithm that gives better prediction and improves efficiency on convergence under data privacy constraint, compared with traditional optimization algorithms including SGD, Stochastic Newton and other first and second order algorithms. We also established the worst case scenario under strong data privacy constraints for convergence rate.
We studied dynamic optimal credit line for the online lender under uncertainty of borrower’s type. We proved that the online lender’s optimal strategy is a mixture of exploration and exploitation. We also provided analytical solution to the optimal policy for the dynamic control problem under certain class of distributions.
Bidding in search advertising is commonplace today. However, determining a bid can be challenging in light of the complexity of the auction process. By designing the mechanism and aggregating the information of many bidders, the advertiser platform can assist less sophisticated advertisers. We analyze data from a platform that initiated a bid recommendation system and find that some advertisers may simply adopt the platform's suggestion instead of constructing their own bids. We discover that these less sophisticated advertisers were lower-rated and uncertain about ad effectiveness before the platform began offering information through the recommended bids. We characterize an equilibrium model of bidding in the Generalized Second Price (GSP) auction and show that following the platform's bid suggestion is theoretically sub-optimal. We then identify sophisticated and less sophisticated advertisers' private values using observed bids and the disclosed information. Counterfactual results suggest that the ad platform can increase revenue and the total surplus when it shares more information. Furthermore, the hybrid of auto-bidding with manual bidding could be a more efficient mechanism as we substitute less sophisticated bidding behavior for algorithmic bidding. These results shed light on the importance of exploring interactions between sophisticated and less sophisticated players when designing a market.