Search
Search Funnelback University
- Refined by:
- Date: Past fortnight
21 -
30 of
38
search results for KaKaoTalk:ZA31 24 24 |u:mlg.eng.cam.ac.uk
where 0
match all words and 38
match some words.
Results that match 2 of 3 words
-
You Shouldn’t Trust Me: Learning Models WhichConceal Unfairness From…
https://mlg.eng.cam.ac.uk/adrian/ECAI20-You_Shouldn%E2%80%99t_Trust_Me.pdf19 Jun 2024: mostimportant feature) in 2D reduced input space (scikit-learn [24]’s PCA imple-mentation). ... 4765–4774, (2017). [24] F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. -
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. -
Leader Stochastic Gradient Descent for DistributedTraining of Deep…
https://mlg.eng.cam.ac.uk/adrian/NeurIPS2019_LSGD_preprint.pdf19 Jun 2024: Landscape symmetries are commonin a plethora of non-convex problems [18, 19, 20, 21, 22], including deep learning [23, 24, 25, 26]. ... Understanding symmetries in deep networks. CoRR,abs/1511.01029, 2015. [24] A. Choromanska, M. -
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. -
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 -
C:/Users/Adrian/Documents/GitHub/betheClean/docs/nb-UAI.dvi
https://mlg.eng.cam.ac.uk/adrian/nb-UAI.pdf19 Jun 2024: Approximating the Bethe Partition Function. Adrian WellerDepartment of Computer Science. Columbia UniversityNew York NY 10027. adrian@cs.columbia.edu. Tony JebaraDepartment of Computer Science. Columbia UniversityNew York NY 10027. jebara@cs.columbia -
Uprooting and Rerooting Higher-Order GraphicalModels Mark…
https://mlg.eng.cam.ac.uk/adrian/uprooting-higher-order.pdf19 Jun 2024: 4], which relates to generalized belief propagation,24) and MAP inference (using loopy belief propagation, LBP [9]). ... InArtificial Intelligence and Statistics (AISTATS), 2016. [24] J. Yedidia, W. Freeman, and Y. -
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 -
From Parity to Preference-based Notionsof Fairness in Classification…
https://mlg.eng.cam.ac.uk/adrian/NeurIPS17-from-parity-to-preference.pdf19 Jun 2024: decisionoutcomes. A number of learning mechanisms have been proposed to achieve parity in treatment [24],. ... Angwin. https://github.com/propublica/compas-analysis, 2016. [24] B. T. Luong, S. Ruggieri, and F. -
A Unified Approach to Quantifying Algorithmic Unfairness: Measuring…
https://mlg.eng.cam.ac.uk/adrian/KDD2018_inequality_indices.pdf19 Jun 2024: 2.3 Axioms for Measuring InequalityBorrowing insights from the rich body of work on the axiomaticcharacterization of inequality indices in economics and social sci-ence [3, 10, 19, 24, 25, 28,
Refine your results
clear all
Date
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.