Zobrazeno 1 - 10
of 183
pro vyhledávání: '"Ugander Johan"'
Autor:
Awadelkarim, Amel, Ugander, Johan
In many contexts involving ranked preferences, agents submit partial orders over available alternatives. Statistical models often treat these as marginal in the space of total orders, but this approach overlooks information contained in the list leng
Externí odkaz:
http://arxiv.org/abs/2406.15893
Variance reduction for causal inference in the presence of network interference is often achieved through either outcome modeling, which is typically analyzed under unit-randomized Bernoulli designs, or clustered experimental designs, which are typic
Externí odkaz:
http://arxiv.org/abs/2405.07979
A wide range of graph embedding objectives decompose into two components: one that attracts the embeddings of nodes that are perceived as similar, and another that repels embeddings of nodes that are perceived as dissimilar. Because real-world graphs
Externí odkaz:
http://arxiv.org/abs/2405.00172
Publikováno v:
Proceedings of the 41st International Conference on Machine Learning, PMLR 235:6202-6252, 2024
A common network inference problem, arising from real-world data constraints, is how to infer a dynamic network from its time-aggregated adjacency matrix and time-varying marginals (i.e., row and column sums). Prior approaches to this problem have re
Externí odkaz:
http://arxiv.org/abs/2402.18697
A core tension in the study of plurality elections is the clash between the classic Hotelling-Downs model, which predicts that two office-seeking candidates should position themselves at the median voter's policy, and the empirical observation that r
Externí odkaz:
http://arxiv.org/abs/2402.17109
Although the foundations of ranking are well established, the ranking literature has primarily been focused on simple, unimodal models, e.g. the Mallows and Plackett-Luce models, that define distributions centered around a single total ordering. Expl
Externí odkaz:
http://arxiv.org/abs/2312.15081
For a broad class of choice and ranking models based on Luce's choice axiom, including the Bradley--Terry--Luce and Plackett--Luce models, we show that the associated maximum likelihood estimation problems are equivalent to a classic matrix balancing
Externí odkaz:
http://arxiv.org/abs/2310.00260
Autor:
Aguiar, Izabel, Ugander, Johan
When people are asked to recall their social networks, theoretical and empirical work tells us that they rely on shortcuts, or heuristics. Cognitive Social Structures (CSS) are multilayer social networks where each layer corresponds to an individual'
Externí odkaz:
http://arxiv.org/abs/2309.11639
School choice mechanism designers use discrete choice models to understand and predict families' preferences. The most widely-used choice model, the multinomial logit (MNL), is linear in school and/or household attributes. While the model is simple a
Externí odkaz:
http://arxiv.org/abs/2306.01801
Peer review assignment algorithms aim to match research papers to suitable expert reviewers, working to maximize the quality of the resulting reviews. A key challenge in designing effective assignment policies is evaluating how changes to the assignm
Externí odkaz:
http://arxiv.org/abs/2305.17339