all AI news
Beyond kNN: Adaptive, Sparse Neighborhood Graphs via Optimal Transport. (arXiv:2208.00604v1 [stat.ML])
Aug. 2, 2022, 2:12 a.m. | Tetsuya Matsumoto, Stephen Zhang, Geoffrey Schiebinger
stat.ML updates on arXiv.org arxiv.org
Nearest neighbour graphs are widely used to capture the geometry or topology
of a dataset. One of the most common strategies to construct such a graph is
based on selecting a fixed number k of nearest neighbours (kNN) for each point.
However, the kNN heuristic may become inappropriate when sampling density or
noise level varies across datasets. Strategies that try to get around this
typically introduce additional parameters that need to be tuned. We propose a
simple approach to construct …
More from arxiv.org / stat.ML updates on arXiv.org
Mixture of partially linear experts
7 hours ago |
arxiv.org
Adaptive deep learning for nonlinear time series models
1 day, 7 hours ago |
arxiv.org
A Full Adagrad algorithm with O(Nd) operations
1 day, 7 hours ago |
arxiv.org
Minimax Regret Learning for Data with Heterogeneous Subgroups
1 day, 7 hours ago |
arxiv.org
Jobs in AI, ML, Big Data
Founding AI Engineer, Agents
@ Occam AI | New York
AI Engineer Intern, Agents
@ Occam AI | US
AI Research Scientist
@ Vara | Berlin, Germany and Remote
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Machine Learning Engineer - Sr. Consultant level
@ Visa | Bellevue, WA, United States