Mathematics
Tight Complexity Bounds for Composite Optimization
We provide tight upper and lower bounds on the complexity of minimizing the average of $m$ convex functions using gradient and prox information for the component functions. We show a significant gap between the complexity…
Learning from Explicit and Implicit Supervision Jointly For Algebra Word Problems
This is a public release of the dataset corresponding the paper “Learning from Explicit and Implicit Supervision Jointly For Algebra Word Problems” that appeared in EMNLP 2016. This set only contains the implicit supervised examples.…
Dr. TLA+ Series – Fast Paxos
The presentation slide and the complete schedule of Dr. TLA+ Series are available at https://github.com/tlaplus/DrTLAPlus. Replicating data across geographically distributed data centers is the new norm in cloud services. Compared to Classic Paxos, Fast Paxos shines…
Near-Optimal Robust Matrix Completion via Non-convex Optimization
Several important applications require completion a low-rank matrix in presence of gross outliers. Examples include robust PCA with missing entries, robust recommendation system, foreground background separation in sublinear time etc. Existing solutions for this problem…
