\n \n \n
\n
\n\n \n \n \n \n \n \n Prediction of hospitalization due to heart diseases by supervised learning methods.\n \n \n \n \n\n\n \n Dai, W.; Brisimi, T. S.; Adams, W. G.; Mela, T.; Saligrama, V.; and Paschalidis, I. C.\n\n\n \n\n\n\n
Int. J. Medical Informatics, 84(3): 189–197. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/ijmi/DaiBAMSP15,\n author = {Wuyang Dai and\n Theodora S. Brisimi and\n William G. Adams and\n Theofanie Mela and\n Venkatesh Saligrama and\n Ioannis Ch. Paschalidis},\n title = {Prediction of hospitalization due to heart diseases by supervised\n learning methods},\n journal = {Int. J. Medical Informatics},\n volume = {84},\n number = {3},\n pages = {189--197},\n year = {2015},\n url = {https://doi.org/10.1016/j.ijmedinf.2014.10.002},\n doi = {10.1016/J.IJMEDINF.2014.10.002},\n timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/ijmi/DaiBAMSP15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Correction to \"Boolean Compressed Sensing and Noisy Group Testing\".\n \n \n \n \n\n\n \n Atia, G. K.; Saligrama, V.; and Aksoylar, C.\n\n\n \n\n\n\n
IEEE Trans. Inf. Theory, 61(3): 1507. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/tit/AtiaSA15,\n author = {George K. Atia and\n Venkatesh Saligrama and\n Cem Aksoylar},\n title = {Correction to "Boolean Compressed Sensing and Noisy Group Testing"},\n journal = {{IEEE} Trans. Inf. Theory},\n volume = {61},\n number = {3},\n pages = {1507},\n year = {2015},\n url = {https://doi.org/10.1109/TIT.2015.2392116},\n doi = {10.1109/TIT.2015.2392116},\n timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/tit/AtiaSA15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n A Topic Modeling Approach to Ranking.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n In
Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2015, San Diego, California, USA, May 9-12, 2015, 2015. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/aistats/DingIS15,\n author = {Weicong Ding and\n Prakash Ishwar and\n Venkatesh Saligrama},\n title = {A Topic Modeling Approach to Ranking},\n booktitle = {Proceedings of the Eighteenth International Conference on Artificial\n Intelligence and Statistics, {AISTATS} 2015, San Diego, California,\n USA, May 9-12, 2015},\n year = {2015},\n crossref = {DBLP:conf/aistats/2015},\n url = {http://proceedings.mlr.press/v38/ding15.html},\n timestamp = {Wed, 29 May 2019 08:41:44 +0200},\n biburl = {https://dblp.org/rec/conf/aistats/DingIS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Learning Efficient Anomaly Detectors from K-NN Graphs.\n \n \n \n \n\n\n \n Root, J.; Qian, J.; and Saligrama, V.\n\n\n \n\n\n\n In
Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2015, San Diego, California, USA, May 9-12, 2015, 2015. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/aistats/RootQS15,\n author = {Jonathan Root and\n Jing Qian and\n Venkatesh Saligrama},\n title = {Learning Efficient Anomaly Detectors from {K-NN} Graphs},\n booktitle = {Proceedings of the Eighteenth International Conference on Artificial\n Intelligence and Statistics, {AISTATS} 2015, San Diego, California,\n USA, May 9-12, 2015},\n year = {2015},\n crossref = {DBLP:conf/aistats/2015},\n url = {http://proceedings.mlr.press/v38/root15.html},\n timestamp = {Wed, 29 May 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/aistats/RootQS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Cost effective algorithms for spectral bandits.\n \n \n \n \n\n\n \n Hanawal, M. K.; and Saligrama, V.\n\n\n \n\n\n\n In
53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015, Allerton Park & Retreat Center, Monticello, IL, USA, September 29 - October 2, 2015, pages 1323–1329, 2015. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/allerton/HanawalS15,\n author = {Manjesh Kumar Hanawal and\n Venkatesh Saligrama},\n title = {Cost effective algorithms for spectral bandits},\n booktitle = {53rd Annual Allerton Conference on Communication, Control, and Computing,\n Allerton 2015, Allerton Park {\\&} Retreat Center, Monticello, IL,\n USA, September 29 - October 2, 2015},\n pages = {1323--1329},\n year = {2015},\n crossref = {DBLP:conf/allerton/2015},\n url = {https://doi.org/10.1109/ALLERTON.2015.7447161},\n doi = {10.1109/ALLERTON.2015.7447161},\n timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/allerton/HanawalS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Rapid: Rapidly accelerated proximal gradient algorithms for convex minimization.\n \n \n \n \n\n\n \n Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n In
2015 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2015, South Brisbane, Queensland, Australia, April 19-24, 2015, pages 3796–3800, 2015. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/icassp/ZhangS15,\n author = {Ziming Zhang and\n Venkatesh Saligrama},\n title = {Rapid: Rapidly accelerated proximal gradient algorithms for convex\n minimization},\n booktitle = {2015 {IEEE} International Conference on Acoustics, Speech and Signal\n Processing, {ICASSP} 2015, South Brisbane, Queensland, Australia,\n April 19-24, 2015},\n pages = {3796--3800},\n year = {2015},\n crossref = {DBLP:conf/icassp/2015},\n url = {https://doi.org/10.1109/ICASSP.2015.7178681},\n doi = {10.1109/ICASSP.2015.7178681},\n timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/icassp/ZhangS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Learning shared rankings from mixtures of noisy pairwise comparisons.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n In
2015 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2015, South Brisbane, Queensland, Australia, April 19-24, 2015, pages 5446–5450, 2015. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/icassp/DingIS15,\n author = {Weicong Ding and\n Prakash Ishwar and\n Venkatesh Saligrama},\n title = {Learning shared rankings from mixtures of noisy pairwise comparisons},\n booktitle = {2015 {IEEE} International Conference on Acoustics, Speech and Signal\n Processing, {ICASSP} 2015, South Brisbane, Queensland, Australia,\n April 19-24, 2015},\n pages = {5446--5450},\n year = {2015},\n crossref = {DBLP:conf/icassp/2015},\n url = {https://doi.org/10.1109/ICASSP.2015.7179012},\n doi = {10.1109/ICASSP.2015.7179012},\n timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/icassp/DingIS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Efficient detection and localization on graph structured data.\n \n \n \n \n\n\n \n Hanawal, M. K.; and Saligrama, V.\n\n\n \n\n\n\n In
2015 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2015, South Brisbane, Queensland, Australia, April 19-24, 2015, pages 5590–5594, 2015. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/icassp/HanawalS15,\n author = {Manjesh Kumar Hanawal and\n Venkatesh Saligrama},\n title = {Efficient detection and localization on graph structured data},\n booktitle = {2015 {IEEE} International Conference on Acoustics, Speech and Signal\n Processing, {ICASSP} 2015, South Brisbane, Queensland, Australia,\n April 19-24, 2015},\n pages = {5590--5594},\n year = {2015},\n crossref = {DBLP:conf/icassp/2015},\n url = {https://doi.org/10.1109/ICASSP.2015.7179041},\n doi = {10.1109/ICASSP.2015.7179041},\n timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/icassp/HanawalS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Group Membership Prediction.\n \n \n \n \n\n\n \n Zhang, Z.; Chen, Y.; and Saligrama, V.\n\n\n \n\n\n\n In
2015 IEEE International Conference on Computer Vision, ICCV 2015, Santiago, Chile, December 7-13, 2015, pages 3916–3924, 2015. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/iccv/ZhangCS15,\n author = {Ziming Zhang and\n Yuting Chen and\n Venkatesh Saligrama},\n title = {Group Membership Prediction},\n booktitle = {2015 {IEEE} International Conference on Computer Vision, {ICCV} 2015,\n Santiago, Chile, December 7-13, 2015},\n pages = {3916--3924},\n year = {2015},\n crossref = {DBLP:conf/iccv/2015},\n url = {https://doi.org/10.1109/ICCV.2015.446},\n doi = {10.1109/ICCV.2015.446},\n timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/iccv/ZhangCS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Zero-Shot Learning via Semantic Similarity Embedding.\n \n \n \n \n\n\n \n Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n In
2015 IEEE International Conference on Computer Vision, ICCV 2015, Santiago, Chile, December 7-13, 2015, pages 4166–4174, 2015. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/iccv/ZhangS15a,\n author = {Ziming Zhang and\n Venkatesh Saligrama},\n title = {Zero-Shot Learning via Semantic Similarity Embedding},\n booktitle = {2015 {IEEE} International Conference on Computer Vision, {ICCV} 2015,\n Santiago, Chile, December 7-13, 2015},\n pages = {4166--4174},\n year = {2015},\n crossref = {DBLP:conf/iccv/2015},\n url = {https://doi.org/10.1109/ICCV.2015.474},\n doi = {10.1109/ICCV.2015.474},\n timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/iccv/ZhangS15a.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Feature-Budgeted Random Forest.\n \n \n \n \n\n\n \n Nan, F.; Wang, J.; and Saligrama, V.\n\n\n \n\n\n\n In
Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6-11 July 2015, pages 1983–1991, 2015. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/icml/NanWS15,\n author = {Feng Nan and\n Joseph Wang and\n Venkatesh Saligrama},\n title = {Feature-Budgeted Random Forest},\n booktitle = {Proceedings of the 32nd International Conference on Machine Learning,\n {ICML} 2015, Lille, France, 6-11 July 2015},\n pages = {1983--1991},\n year = {2015},\n crossref = {DBLP:conf/icml/2015},\n url = {http://proceedings.mlr.press/v37/nan15.html},\n timestamp = {Wed, 29 May 2019 08:41:45 +0200},\n biburl = {https://dblp.org/rec/conf/icml/NanWS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Cheap Bandits.\n \n \n \n \n\n\n \n Hanawal, M. K.; Saligrama, V.; Valko, M.; and Munos, R.\n\n\n \n\n\n\n In
Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6-11 July 2015, pages 2133–2142, 2015. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/icml/HanawalSVM15,\n author = {Manjesh Kumar Hanawal and\n Venkatesh Saligrama and\n Michal Valko and\n R{\\'{e}}mi Munos},\n title = {Cheap Bandits},\n booktitle = {Proceedings of the 32nd International Conference on Machine Learning,\n {ICML} 2015, Lille, France, 6-11 July 2015},\n pages = {2133--2142},\n year = {2015},\n crossref = {DBLP:conf/icml/2015},\n url = {http://proceedings.mlr.press/v37/hanawal15.html},\n timestamp = {Wed, 29 May 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/icml/HanawalSVM15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Learning immune-defectives graph through group tests.\n \n \n \n \n\n\n \n Ganesan, A.; Jaggi, S.; and Saligrama, V.\n\n\n \n\n\n\n In
IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015, pages 66–70, 2015. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/isit/GanesanJS15,\n author = {Abhinav Ganesan and\n Sidharth Jaggi and\n Venkatesh Saligrama},\n title = {Learning immune-defectives graph through group tests},\n booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2015,\n Hong Kong, China, June 14-19, 2015},\n pages = {66--70},\n year = {2015},\n crossref = {DBLP:conf/isit/2015},\n url = {https://doi.org/10.1109/ISIT.2015.7282418},\n doi = {10.1109/ISIT.2015.7282418},\n timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/isit/GanesanJS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Most large topic models are approximately separable.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n In
2015 Information Theory and Applications Workshop, ITA 2015, San Diego, CA, USA, February 1-6, 2015, pages 199–203, 2015. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/ita/DingIS15,\n author = {Weicong Ding and\n Prakash Ishwar and\n Venkatesh Saligrama},\n title = {Most large topic models are approximately separable},\n booktitle = {2015 Information Theory and Applications Workshop, {ITA} 2015, San\n Diego, CA, USA, February 1-6, 2015},\n pages = {199--203},\n year = {2015},\n crossref = {DBLP:conf/ita/2015},\n url = {https://doi.org/10.1109/ITA.2015.7308989},\n doi = {10.1109/ITA.2015.7308989},\n timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/ita/DingIS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Non-adaptive group testing with inhibitors.\n \n \n \n \n\n\n \n Ganesan, A.; Jaggi, S.; and Saligrama, V.\n\n\n \n\n\n\n In
2015 IEEE Information Theory Workshop, ITW 2015, Jerusalem, Israel, April 26 - May 1, 2015, pages 1–5, 2015. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/itw/GanesanJS15,\n author = {Abhinav Ganesan and\n Sidharth Jaggi and\n Venkatesh Saligrama},\n title = {Non-adaptive group testing with inhibitors},\n booktitle = {2015 {IEEE} Information Theory Workshop, {ITW} 2015, Jerusalem, Israel,\n April 26 - May 1, 2015},\n pages = {1--5},\n year = {2015},\n crossref = {DBLP:conf/itw/2015},\n url = {https://doi.org/10.1109/ITW.2015.7133108},\n doi = {10.1109/ITW.2015.7133108},\n timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/itw/GanesanJS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Efficient Activity Retrieval through Semantic Graph Queries.\n \n \n \n \n\n\n \n Castañón, G. D.; Chen, Y.; Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n In
Proceedings of the 23rd Annual ACM Conference on Multimedia Conference, MM '15, Brisbane, Australia, October 26 - 30, 2015, pages 391–400, 2015. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/mm/CastanonCZS15,\n author = {Gregory D. Casta{\\~{n}}{\\'{o}}n and\n Yuting Chen and\n Ziming Zhang and\n Venkatesh Saligrama},\n title = {Efficient Activity Retrieval through Semantic Graph Queries},\n booktitle = {Proceedings of the 23rd Annual {ACM} Conference on Multimedia Conference,\n {MM} '15, Brisbane, Australia, October 26 - 30, 2015},\n pages = {391--400},\n year = {2015},\n crossref = {DBLP:conf/mm/2015},\n url = {https://doi.org/10.1145/2733373.2806229},\n doi = {10.1145/2733373.2806229},\n timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/mm/CastanonCZS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Efficient Learning by Directed Acyclic Graph For Resource Constrained Prediction.\n \n \n \n \n\n\n \n Wang, J.; Trapeznikov, K.; and Saligrama, V.\n\n\n \n\n\n\n In
Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, December 7-12, 2015, Montreal, Quebec, Canada, pages 2152–2160, 2015. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/nips/WangTS15,\n author = {Joseph Wang and\n Kirill Trapeznikov and\n Venkatesh Saligrama},\n title = {Efficient Learning by Directed Acyclic Graph For Resource Constrained\n Prediction},\n booktitle = {Advances in Neural Information Processing Systems 28: Annual Conference\n on Neural Information Processing Systems 2015, December 7-12, 2015,\n Montreal, Quebec, Canada},\n pages = {2152--2160},\n year = {2015},\n crossref = {DBLP:conf/nips/2015},\n url = {https://proceedings.neurips.cc/paper/2015/hash/c0a271bc0ecb776a094786474322cb82-Abstract.html},\n timestamp = {Mon, 16 May 2022 15:41:51 +0200},\n biburl = {https://dblp.org/rec/conf/nips/WangTS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Max-Cost Discrete Function Evaluation Problem under a Budget.\n \n \n \n \n\n\n \n Nan, F.; Wang, J.; and Saligrama, V.\n\n\n \n\n\n\n
CoRR, abs/1501.02702. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/NanWS15,\n author = {Feng Nan and\n Joseph Wang and\n Venkatesh Saligrama},\n title = {Max-Cost Discrete Function Evaluation Problem under a Budget},\n journal = {CoRR},\n volume = {abs/1501.02702},\n year = {2015},\n url = {http://arxiv.org/abs/1501.02702},\n eprinttype = {arXiv},\n eprint = {1501.02702},\n timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/NanWS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Learning Efficient Anomaly Detectors from K-NN Graphs.\n \n \n \n \n\n\n \n Qian, J.; Root, J.; and Saligrama, V.\n\n\n \n\n\n\n
CoRR, abs/1502.01783. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/QianRS15,\n author = {Jing Qian and\n Jonathan Root and\n Venkatesh Saligrama},\n title = {Learning Efficient Anomaly Detectors from {K-NN} Graphs},\n journal = {CoRR},\n volume = {abs/1502.01783},\n year = {2015},\n url = {http://arxiv.org/abs/1502.01783},\n eprinttype = {arXiv},\n eprint = {1502.01783},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/QianRS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Feature-Budgeted Random Forest.\n \n \n \n \n\n\n \n Nan, F.; Wang, J.; and Saligrama, V.\n\n\n \n\n\n\n
CoRR, abs/1502.05925. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/NanWS15a,\n author = {Feng Nan and\n Joseph Wang and\n Venkatesh Saligrama},\n title = {Feature-Budgeted Random Forest},\n journal = {CoRR},\n volume = {abs/1502.05925},\n year = {2015},\n url = {http://arxiv.org/abs/1502.05925},\n eprinttype = {arXiv},\n eprint = {1502.05925},\n timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/NanWS15a.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Learning Immune-Defectives Graph through Group Tests.\n \n \n \n \n\n\n \n Ganesan, A.; Jaggi, S.; and Saligrama, V.\n\n\n \n\n\n\n
CoRR, abs/1503.00555. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/GanesanJS15,\n author = {Abhinav Ganesan and\n Sidharth Jaggi and\n Venkatesh Saligrama},\n title = {Learning Immune-Defectives Graph through Group Tests},\n journal = {CoRR},\n volume = {abs/1503.00555},\n year = {2015},\n url = {http://arxiv.org/abs/1503.00555},\n eprinttype = {arXiv},\n eprint = {1503.00555},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/GanesanJS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Learning Mixed Membership Mallows Models from Pairwise Comparisons.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n
CoRR, abs/1504.00757. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/DingIS15,\n author = {Weicong Ding and\n Prakash Ishwar and\n Venkatesh Saligrama},\n title = {Learning Mixed Membership Mallows Models from Pairwise Comparisons},\n journal = {CoRR},\n volume = {abs/1504.00757},\n year = {2015},\n url = {http://arxiv.org/abs/1504.00757},\n eprinttype = {arXiv},\n eprint = {1504.00757},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/DingIS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Cheap Bandits.\n \n \n \n \n\n\n \n Hanawal, M. K.; Saligrama, V.; Valko, M.; and Munos, R.\n\n\n \n\n\n\n
CoRR, abs/1506.04782. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/HanawalSVM15,\n author = {Manjesh Kumar Hanawal and\n Venkatesh Saligrama and\n Michal Valko and\n R{\\'{e}}mi Munos},\n title = {Cheap Bandits},\n journal = {CoRR},\n volume = {abs/1506.04782},\n year = {2015},\n url = {http://arxiv.org/abs/1506.04782},\n eprinttype = {arXiv},\n eprint = {1506.04782},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/HanawalSVM15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Necessary and Sufficient Conditions and a Provably Efficient Algorithm for Separable Topic Discovery.\n \n \n \n \n\n\n \n Ding, W.; Ishwar, P.; and Saligrama, V.\n\n\n \n\n\n\n
CoRR, abs/1508.05565. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/DingIS15a,\n author = {Weicong Ding and\n Prakash Ishwar and\n Venkatesh Saligrama},\n title = {Necessary and Sufficient Conditions and a Provably Efficient Algorithm\n for Separable Topic Discovery},\n journal = {CoRR},\n volume = {abs/1508.05565},\n year = {2015},\n url = {http://arxiv.org/abs/1508.05565},\n eprinttype = {arXiv},\n eprint = {1508.05565},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/DingIS15a.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Sensor Selection by Linear Programming.\n \n \n \n \n\n\n \n Wang, J.; Trapeznikov, K.; and Saligrama, V.\n\n\n \n\n\n\n
CoRR, abs/1509.02954. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/WangTS15,\n author = {Joseph Wang and\n Kirill Trapeznikov and\n Venkatesh Saligrama},\n title = {Sensor Selection by Linear Programming},\n journal = {CoRR},\n volume = {abs/1509.02954},\n year = {2015},\n url = {http://arxiv.org/abs/1509.02954},\n eprinttype = {arXiv},\n eprint = {1509.02954},\n timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/WangTS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Zero-Shot Learning via Semantic Similarity Embedding.\n \n \n \n \n\n\n \n Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n
CoRR, abs/1509.04767. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/ZhangS15d,\n author = {Ziming Zhang and\n Venkatesh Saligrama},\n title = {Zero-Shot Learning via Semantic Similarity Embedding},\n journal = {CoRR},\n volume = {abs/1509.04767},\n year = {2015},\n url = {http://arxiv.org/abs/1509.04767},\n eprinttype = {arXiv},\n eprint = {1509.04767},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/ZhangS15d.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Group Membership Prediction.\n \n \n \n \n\n\n \n Zhang, Z.; Chen, Y.; and Saligrama, V.\n\n\n \n\n\n\n
CoRR, abs/1509.04783. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/ZhangCS15,\n author = {Ziming Zhang and\n Yuting Chen and\n Venkatesh Saligrama},\n title = {Group Membership Prediction},\n journal = {CoRR},\n volume = {abs/1509.04783},\n year = {2015},\n url = {http://arxiv.org/abs/1509.04783},\n eprinttype = {arXiv},\n eprint = {1509.04783},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/ZhangCS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Algorithms for Linear Bandits on Polyhedral Sets.\n \n \n \n \n\n\n \n Hanawal, M. K.; Leshem, A.; and Saligrama, V.\n\n\n \n\n\n\n
CoRR, abs/1509.07927. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/HanawalLS15,\n author = {Manjesh Kumar Hanawal and\n Amir Leshem and\n Venkatesh Saligrama},\n title = {Algorithms for Linear Bandits on Polyhedral Sets},\n journal = {CoRR},\n volume = {abs/1509.07927},\n year = {2015},\n url = {http://arxiv.org/abs/1509.07927},\n eprinttype = {arXiv},\n eprint = {1509.07927},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/HanawalLS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Efficient Learning by Directed Acyclic Graph For Resource Constrained Prediction.\n \n \n \n \n\n\n \n Wang, J.; Trapeznikov, K.; and Saligrama, V.\n\n\n \n\n\n\n
CoRR, abs/1510.07609. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/WangTS15a,\n author = {Joseph Wang and\n Kirill Trapeznikov and\n Venkatesh Saligrama},\n title = {Efficient Learning by Directed Acyclic Graph For Resource Constrained\n Prediction},\n journal = {CoRR},\n volume = {abs/1510.07609},\n year = {2015},\n url = {http://arxiv.org/abs/1510.07609},\n eprinttype = {arXiv},\n eprint = {1510.07609},\n timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/WangTS15a.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n BING++: A Fast High Quality Object Proposal Generator at 100fps.\n \n \n \n \n\n\n \n Zhang, Z.; Liu, Y.; Bolukbasi, T.; Cheng, M.; and Saligrama, V.\n\n\n \n\n\n\n
CoRR, abs/1511.04511. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/ZhangLBCS15,\n author = {Ziming Zhang and\n Yun Liu and\n Tolga Bolukbasi and\n Ming{-}Ming Cheng and\n Venkatesh Saligrama},\n title = {{BING++:} {A} Fast High Quality Object Proposal Generator at 100fps},\n journal = {CoRR},\n volume = {abs/1511.04511},\n year = {2015},\n url = {http://arxiv.org/abs/1511.04511},\n eprinttype = {arXiv},\n eprint = {1511.04511},\n timestamp = {Wed, 18 Dec 2019 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/corr/ZhangLBCS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Classifying Unseen Instances by Learning Class-Independent Similarity Functions.\n \n \n \n \n\n\n \n Zhang, Z.; and Saligrama, V.\n\n\n \n\n\n\n
CoRR, abs/1511.04512. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/ZhangS15e,\n author = {Ziming Zhang and\n Venkatesh Saligrama},\n title = {Classifying Unseen Instances by Learning Class-Independent Similarity\n Functions},\n journal = {CoRR},\n volume = {abs/1511.04512},\n year = {2015},\n url = {http://arxiv.org/abs/1511.04512},\n eprinttype = {arXiv},\n eprint = {1511.04512},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/ZhangS15e.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Supervised Hashing with Deep Neural Networks.\n \n \n \n \n\n\n \n Zhang, Z.; Chen, Y.; and Saligrama, V.\n\n\n \n\n\n\n
CoRR, abs/1511.04524. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/ZhangCS15a,\n author = {Ziming Zhang and\n Yuting Chen and\n Venkatesh Saligrama},\n title = {Supervised Hashing with Deep Neural Networks},\n journal = {CoRR},\n volume = {abs/1511.04524},\n year = {2015},\n url = {http://arxiv.org/abs/1511.04524},\n eprinttype = {arXiv},\n eprint = {1511.04524},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/ZhangCS15a.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n