Search
Search Funnelback University
- Refined by:
- Date: Past year
31 -
40 of
97
search results for TALK:ZA31 24 / |u:mlg.eng.cam.ac.uk
where 0
match all words and 97
match some words.
Results that match 1 of 2 words
-
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. -
Structured Evolution with Compact Architectures for Scalable Policy…
https://mlg.eng.cam.ac.uk/adrian/structured_icml_full.pdf19 Jun 2024: Structured Evolution with Compact Architecturesfor Scalable Policy Optimization. Krzysztof Choromanski 1 Mark Rowland 2 Vikas Sindhwani 1 Richard E. Turner 2 Adrian Weller 2 3. AbstractWe present a new method of blackbox optimiza-tion via gradient -
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. -
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 -
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. -
Gaussian Process
https://mlg.eng.cam.ac.uk/teaching/4f13/1718/gaussian%20process.pdf19 Nov 2023: 64. 20. 24. 6. 6. 4. 2. 0. 2. 4. 6. -
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, -
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. -
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. -
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
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.