Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Introducing the expohedron for efficient pareto-optimal fairness-utility amortizations in repeated rankings
We consider the problem of computing a sequence of rankings that maximizes consumer-
side utility while minimizing producer-side individual unfairness of exposure. While prior …
side utility while minimizing producer-side individual unfairness of exposure. While prior …
Hide-and-seek game with capacitated locations and imperfect detection
We consider a variant of the hide-and-seek game in which a seeker inspects multiple hiding
locations to find multiple items hidden by a hider. Each hiding location has a maximum …
locations to find multiple items hidden by a hider. Each hiding location has a maximum …
Anonymous bandits for multi-user systems
In this work, we present and study a new framework for online learning in systems with
multiple users that provide user anonymity. Specifically, we extend the notion of bandits to …
multiple users that provide user anonymity. Specifically, we extend the notion of bandits to …
Quasi-Newton algorithm for optimal approximate linear regression design: Optimization in matrix space
N Gaffke, R Schwabe - Journal of Statistical Planning and Inference, 2019 - Elsevier
Given a linear regression model and an experimental region for the independent variable,
the problem of finding an optimal approximate design calls for minimizing a convex …
the problem of finding an optimal approximate design calls for minimizing a convex …
Ranking systems and methods using a dynamic bayesian network exposure model
A method for ranking a set of objects includes: receiving the set of objects to rank, a
relevance score for each object, and a set of objective functions; based on the relevance …
relevance score for each object, and a set of objective functions; based on the relevance …