researcher

Matus Telgarsky

46 papers hereh-index 266.5k citations64 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

sole author12
first author3
middle author9
last author22

Across the 46 of 46 papers where every author was matched, so the position is known.

fields

cs.LG39
cs.GT3
cs.DS1
math.OC1
math.PR1
math.ST1

identity via Semantic Scholar / OpenAlex

activity

20092026

most citedSpectrally-normalized margin bounds for neural networks

174 citations · 991 across the 46 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

cs.DS2016★ 5 cited

Greedy bi-criteria approximations for $k$ -medians and $k$ -means

Daniel Hsu, Matus Telgarsky

This paper investigates the following natural greedy procedure for clustering in the bi-criterion setting: iteratively grow a set of centers, in each round adding the center from a…

cs.LG2016★ 93 cited

Benefits of depth in neural networks

Matus Telgarsky

For any positive integer $k$ , there exist neural networks with $Θ (k^{3})$ layers, $Θ (1)$ nodes per layer, and $Θ (1)$ distinct parameters which can not be approximated by networks wit…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

Greedy bi-criteria approximations for k-medians and k-means

Benefits of depth in neural networks

Greedy bi-criteria approximations for $k$ -medians and $k$ -means