Refined Lower Bounds for Nearest Neighbor Condensation

Rajesh Chitnis

Refined Lower Bounds for Nearest Neighbor Condensation

Rajesh Chitnis

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

20 Downloads (Pure)

Abstract

Original language	English
Title of host publication	Proceedings of The 33rd International Conference on Algorithmic Learning Theory
Editors	Sanjoy Dasgupta, Nika Haghtalab
Publisher	Proceedings of Machine Learning Research
Pages	262-281
Number of pages	20
Publication status	Published - 1 Apr 2022
Event	33rd International Conference on Algorithmic Learning Theory (ALT 2022) - Paris, France Duration: 29 Mar 2022 → 1 Apr 2022

Publication series

Name	Proceedings of Machine Learning Research
Volume	167
ISSN (Electronic)	2640-3498

Conference

Conference	33rd International Conference on Algorithmic Learning Theory (ALT 2022)
Abbreviated title	ALT 2022
Country/Territory	France
City	Paris
Period	29/03/22 → 1/04/22

Keywords

nearest neighbor condensation
parameterized complexity
exponential time hypothesis

Access to Document

ChitnisR2022RefinedFinal published version, 460 KBLicence: Creative Commons: Attribution (CC BY)

https://proceedings.mlr.press/v167/chitnis22a.htmlLicence: Creative Commons: Attribution (CC BY)

Cite this

@inproceedings{b8e4a6561e984cbfb9fae15244ed1bfc,

title = "Refined Lower Bounds for Nearest Neighbor Condensation",

keywords = "nearest neighbor condensation, parameterized complexity, exponential time hypothesis",

author = "Rajesh Chitnis",

year = "2022",

month = apr,

day = "1",

language = "English",

series = "Proceedings of Machine Learning Research",

publisher = "Proceedings of Machine Learning Research",

pages = "262--281",

editor = "Sanjoy Dasgupta and Nika Haghtalab",

booktitle = "Proceedings of The 33rd International Conference on Algorithmic Learning Theory",

note = "33rd International Conference on Algorithmic Learning Theory (ALT 2022), ALT 2022 ; Conference date: 29-03-2022 Through 01-04-2022",

}

Chitnis, R 2022, Refined Lower Bounds for Nearest Neighbor Condensation. in S Dasgupta & N Haghtalab (eds), Proceedings of The 33rd International Conference on Algorithmic Learning Theory. Proceedings of Machine Learning Research, vol. 167, Proceedings of Machine Learning Research, pp. 262-281, 33rd International Conference on Algorithmic Learning Theory (ALT 2022), Paris, France, 29/03/22. <https://proceedings.mlr.press/v167/chitnis22a.html>

Refined Lower Bounds for Nearest Neighbor Condensation. / Chitnis, Rajesh.
Proceedings of The 33rd International Conference on Algorithmic Learning Theory. ed. / Sanjoy Dasgupta; Nika Haghtalab. Proceedings of Machine Learning Research, 2022. p. 262-281 (Proceedings of Machine Learning Research; Vol. 167).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Refined Lower Bounds for Nearest Neighbor Condensation

AU - Chitnis, Rajesh

PY - 2022/4/1

Y1 - 2022/4/1

KW - nearest neighbor condensation

KW - parameterized complexity

KW - exponential time hypothesis

M3 - Conference contribution

T3 - Proceedings of Machine Learning Research

SP - 262

EP - 281

BT - Proceedings of The 33rd International Conference on Algorithmic Learning Theory

A2 - Dasgupta, Sanjoy

A2 - Haghtalab, Nika

PB - Proceedings of Machine Learning Research

T2 - 33rd International Conference on Algorithmic Learning Theory (ALT 2022)

Y2 - 29 March 2022 through 1 April 2022

ER -

Refined Lower Bounds for Nearest Neighbor Condensation

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this