Vivek Madan

According to our database1, Vivek Madan authored at least 19 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Don't forget the nullspace! Nullspace occupancy as a mechanism for out of distribution failure.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Representation Projection Invariance Mitigates Representation Collapse.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2023, 2023

2022
Improving language models fine-tuning with representation consistency targets.
CoRR, 2022

2021
Improving Early Sepsis Prediction with Multi Modal Learning.
CoRR, 2021

TADPOLE: Task ADapted Pre-Training via AnOmaLy DEtection.
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, 2021

2020
A tight $\sqrt{2}$-approximation for linear 3-cut.
Math. Program., 2020

Improving the integrality gap for multiway cut.
Math. Program., 2020

Maximizing Determinants under Matroid Constraints.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
On the Expansion of Group-Based Lifts.
SIAM J. Discret. Math., 2019

Combinatorial Algorithms for Optimal Design.
Proceedings of the Conference on Learning Theory, 2019

2018
On approximability and LP formulations for multicut and feedback set problems
PhD thesis, 2018

A tight -approximation for Linear 3-Cut.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Spectrally Robust Graph Isomorphism.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Approximating Multicut and the Demand Graph.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Centrality of trees for capacitated k-center.
Math. Program., 2015

2013
Small Lifts of Expander Graphs are Expanding.
CoRR, 2013

2012
Preservation under Substructures modulo Bounded Cores.
Proceedings of the Logic, Language, Information and Computation, 2012


  Loading...