Search

Search Funnelback University

Search powered by Funnelback
21 - 30 of 39 search results for KaKaoTalk:ZA31 24 24 |u:mlg.eng.cam.ac.uk where 0 match all words and 39 match some words.
  1. Results that match 2 of 3 words

  2. Blind Justice: Fairness with Encrypted Sensitive Attributes

    https://mlg.eng.cam.ac.uk/adrian/ICML18-BlindJustice.pdf
    19 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.
  3. 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.pdf
    19 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.
  4. One-network Adversarial Fairness

    https://mlg.eng.cam.ac.uk/adrian/AAAI2019_OneNetworkAdversarialFairness.pdf
    19 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.
  5. An Introduction to LP Relaxations for MAP Inference

    https://mlg.eng.cam.ac.uk/adrian/2018-MLSALT4-AW2-LP.pdf
    19 Jun 2024: x3. x4. x5. x6. s. balanced almost balanced(attractive up to flipping) 24 / 41.
  6. Leader Stochastic Gradient Descent for DistributedTraining of Deep…

    https://mlg.eng.cam.ac.uk/adrian/NeurIPS2019_LSGD_preprint.pdf
    19 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.
  7. 19 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
  8. C:/Users/Adrian/Documents/GitHub/betheClean/docs/nb-UAI.dvi

    https://mlg.eng.cam.ac.uk/adrian/nb-UAI.pdf
    19 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
  9. Uprooting and Rerooting Higher-Order GraphicalModels Mark…

    https://mlg.eng.cam.ac.uk/adrian/uprooting-higher-order.pdf
    19 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.
  10. Conditions Beyond Treewidth for Tightness of Higher-order LP…

    https://mlg.eng.cam.ac.uk/adrian/conditions.pdf
    19 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
  11. From Parity to Preference-based Notionsof Fairness in Classification…

    https://mlg.eng.cam.ac.uk/adrian/NeurIPS17-from-parity-to-preference.pdf
    19 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.

Refine your results

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.