◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Nataly Brukhim

15 papers hereh-index 10275 citations20 works total

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

author position
  • first author10
  • middle author5

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

fields
  • cs.LG13
  • cs.AI1
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20182026
most citedPredict and Constrain: Modeling Cardinality in Deep Structured Prediction

8 citations · 20 across the 14 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

cs.LG2024

Of Dice and Games: A Theory of Generalized Boosting

Marco Bressan, Nataly Brukhim, Nicolò Cesa-Bianchi +4

Cost-sensitive loss functions are crucial in many real-world prediction problems, where different types of errors are penalized differently; for example, in medical diagnosis, a fa…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.