9 citations · 12 across the 3 of their papers we have counts for
3 papers
cs.LG2021★ 2 cited
DL-DDA -- Deep Learning based Dynamic Difficulty Adjustment with UX and Gameplay constraints
Dvir Ben Or, Michael Kolomenkin, Gil Shabat
Dynamic difficulty adjustment () is a process of automatically changing a game difficulty for the optimization of user experience. It is a vital part of almost any modern game…
cs.LG2020★ 9 cited
Generalized Quantile Loss for Deep Neural Networks
Dvir Ben Or, Michael Kolomenkin, Gil Shabat
This note presents a simple way to add a count (or quantile) constraint to a regression neural net, such that given samples in the training set it guarantees that the predictio…
cs.LG2020★ 1 cited
Majority Voting and the Condorcet's Jury Theorem
Hanan Shteingart, Eran Marom, Igor Itkin +4
There is a striking relationship between a three hundred years old Political Science theorem named "Condorcet's jury theorem" (1785), which states that majorities are more likely t…