Search

Search Funnelback University

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

  2. Now You See Me (CME): Concept-based Model Extraction

    https://mlg.eng.cam.ac.uk/adrian/AIMLAI20-CME.pdf
    16 May 2024: Model ExtractionModel extraction techniques use rules [20, 21, 22], de-cision trees [23, 24], or other more readily explainablemodels [25] to approximate complex models, in orderto study their behaviour. ... 24] M. Sato, H. Tsukimoto, Rule extraction
  3. Ode to an ODE Krzysztof Choromanski ∗Robotics at Google ...

    https://mlg.eng.cam.ac.uk/adrian/NeurIPS20-ODEtoODE.pdf
    16 May 2024: MIT Press, 2016. [24] Aditya Grover, Eric Wang, Aaron Zweig, and Stefano Ermon. ... In Proceedings of the 33nd International Conference on Machine Learning,ICML 2016, New York City, NY, USA, June 19-24, 2016, pages 2034–2042, 2016.
  4. C:/Users/Adrian/Documents/GitHub/betheClean/docs/nb-UAI.dvi

    https://mlg.eng.cam.ac.uk/adrian/nb-UAI.pdf
    16 May 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
  5. The Geometry of Random Features Krzysztof Choromanski∗1 Mark…

    https://mlg.eng.cam.ac.uk/adrian/geometry.pdf
    16 May 2024: The Geometry of Random Features. Krzysztof Choromanski1 Mark Rowland2 Tamas Sarlos1 Vikas Sindhwani1 Richard E. Turner2 Adrian Weller231Google Brain, NY 2University of Cambridge, UK 3The Alan Turing Institute, UK. Abstract. We present an in-depth
  6. Blind Justice: Fairness with Encrypted Sensitive Attributes

    https://mlg.eng.cam.ac.uk/adrian/ICML18-BlindJustice.pdf
    16 May 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.
  7. An Introduction to LP Relaxations for MAP Inference

    https://mlg.eng.cam.ac.uk/adrian/2018-MLSALT4-AW2-LP.pdf
    16 May 2024: x3. x4. x5. x6. s. balanced almost balanced(attractive up to flipping) 24 / 41.
  8. Human Perceptions of Fairness in Algorithmic Decision Making: A Case…

    https://mlg.eng.cam.ac.uk/adrian/WWW18-HumanPerceptions.pdf
    16 May 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.
  9. Evaluating and Aggregating Feature-based Model Explanations

    https://mlg.eng.cam.ac.uk/adrian/IJCAI20_EvaluatingAndAggregating.pdf
    16 May 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.
  10. 16 May 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
  11. Gauged Mini-Bucket Elimination for Approximate Inference Sungsoo Ahn…

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

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.