Search

Search Funnelback University

Search powered by Funnelback
10 results 20 results 50 results
Relevance Date (Newest first) Date (Oldest first) Title (A-Z) Title (Z-A) Distance URL (A-Z) URL (Z-A) Shuffle
21 - 30 of 43 search results for KaKaoTalk:ZA31 24 24 |u:mlg.eng.cam.ac.uk where 0 match all words and 43 match some words.

  1. Results that match 2 of 3 words

  2. ML-IRL: Machine Learning in Real Life Workshop at ICLR ...

    https://mlg.eng.cam.ac.uk/adrian/ML_IRL_2020-CLUE.pdf
    19 Jun 2024: 6). LSATAl. (7). COMPASEp. (6). COMPASAl. (5) Total (24). Prolific Unc.

  3. Human Perceptions of Fairness in Algorithmic Decision Making: A Case…

    https://mlg.eng.cam.ac.uk/adrian/WWW18-HumanPerceptions.pdf
    19 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.

  4. 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.

  5. Tightness of LP Relaxations for Almost Balanced Models Adrian ...

    https://mlg.eng.cam.ac.uk/adrian/tricam.pdf
    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

  6. 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

  7. Evaluating and Aggregating Feature-based Model Explanations

    https://mlg.eng.cam.ac.uk/adrian/IJCAI20_EvaluatingAndAggregating.pdf
    19 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.

  8. 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.

  9. Gauged Mini-Bucket Elimination for Approximate Inference Sungsoo Ahn…

    https://mlg.eng.cam.ac.uk/adrian/Gauge_for_Holder_Inference.pdf
    19 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.

  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. 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.

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.