Search
Search Funnelback University
- Refined by:
- Date: 2024
31 -
40 of
52
search results for katalk:PC53 24 / |u:mlg.eng.cam.ac.uk
where 0
match all words and 52
match some words.
Results that match 1 of 2 words
-
Blind Justice: Fairness with Encrypted Sensitive Attributes
https://mlg.eng.cam.ac.uk/adrian/ICML18-BlindJustice.pdf19 Jun 2024: d features 51 62 7 24 23p sensitive attr. 1 1 7 1 1certification 802 ms 827 ms 288 ms 250 ms 765 mstraining 43 min 51 min 7 min 1 ... Bennett Capers, I. Blind justice. Yale Journal of Law &Humanities, 24:179, 2012. -
An Introduction to LP Relaxations for MAP Inference
https://mlg.eng.cam.ac.uk/adrian/2018-MLSALT4-AW2-LP.pdf19 Jun 2024: x3. x4. x5. x6. s. balanced almost balanced(attractive up to flipping) 24 / 41. -
Human Perceptions of Fairness in Algorithmic Decision Making: A Case…
https://mlg.eng.cam.ac.uk/adrian/WWW18-HumanPerceptions.pdf19 Jun 2024: 47% 68% 70%B.S. 51% 32% 30%Liberal 57% 37% 33%Conservative 17% 24% 29%Moderate 21% 33% 34%Other 5% 6% 4%. ... Substance Abuse 4.84 0.08 0.07 0.10 0.24 0.07 0.68 0.26 0.22 0.20 0.07 0.284. -
Evaluating and Aggregating Feature-based Model Explanations
https://mlg.eng.cam.ac.uk/adrian/IJCAI20_EvaluatingAndAggregating.pdf19 Jun 2024: µC(f, gSHAP) 1.94 0.26 1.36 0.36 2.33 0.23µC(f, gAVA) 1.93 0.24 1.24 0.32 2.61 0.29. -
Tightness of LP Relaxations for Almost Balanced Models Adrian ...
https://mlg.eng.cam.ac.uk/adrian/tricam.pdf19 Jun 2024: Tightness of LP Relaxations for Almost Balanced Models. Adrian Weller Mark Rowland David SontagUniversity of Cambridge University of Cambridge New York University. Abstract. Linear programming (LP) relaxations are widelyused to attempt to identify a -
Gauged Mini-Bucket Elimination for Approximate Inference Sungsoo Ahn…
https://mlg.eng.cam.ac.uk/adrian/Gauge_for_Holder_Inference.pdf19 Jun 2024: We call these methods collectively Z-invariant methods. See [23, 24, 25] for discussions ofthe differences and relations between these methods. ... 24] G. David Forney Jr and Pascal O. Vontobel. Par-tition functions of normal factor graphs. -
Conditions Beyond Treewidth for Tightness of Higher-order LP…
https://mlg.eng.cam.ac.uk/adrian/conditions.pdf19 Jun 2024: Conditions Beyond Treewidth for Tightness of Higher-order LP Relaxations. Mark Rowland Aldo Pacchiano Adrian WellerUniversity of Cambridge UC Berkeley University of Cambridge. Abstract. Linear programming (LP) relaxations are a pop-ular method to -
Unifying Orthogonal Monte Carlo Methods
https://mlg.eng.cam.ac.uk/adrian/ICML2019-unified.pdf19 Jun 2024: E[x̃λỹλx̃λvỹλv x̃. 2λỹ. 2λv. ] (24)We next show the following. Lemma A.7. -
Clamping Variables and Approximate Inference Adrian WellerColumbia…
https://mlg.eng.cam.ac.uk/adrian/NeurIPS14-clamp.pdf19 Jun 2024: Journal of Automated Reasoning, 24(1-2):225–275, 2000. N. Ruozzi. The Bethe partition function of log-supermodular graphical models. -
One-network Adversarial Fairness
https://mlg.eng.cam.ac.uk/adrian/AAAI2019_OneNetworkAdversarialFairness.pdf19 Jun 2024: log(1/δ). n(24). The term[4nI(x D0). 4nI(x D1). ]is what is estimated. ... From the latter note and (24), the two classifiers of theadversarial formulation proposed in (9) in the main docu-ment can be interpreted w.r.t.
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.