scientific article; zbMATH DE number 7049732
From MaRDI portal
Publication:4633022
zbMath1483.68312arXiv1511.01419MaRDI QIDQ4633022
Adrian Weller, Ben London, Ofer Meshi, David Sontag
Publication date: 2 May 2019
Full work available at URL: https://arxiv.org/abs/1511.01419
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Nonparametric estimation (62G05) Learning and adaptive systems in artificial intelligence (68T05) Linear programming (90C05)
Cites Work
- On cuts and matchings in planar graphs
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The partial constraint satisfaction problem: Facets and lifting theorems
- Finding MAPs for belief networks is NP-hard
- Search-based structured prediction
- On the hardness of approximate reasoning
- PAC-Bayesian Inequalities for Martingales
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Approximation algorithms for classification problems with pairwise relationships
- MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
- Graphical Models, Exponential Families, and Variational Inference
- Asymptotic evaluation of certain markov process expectations for large time, I
- A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem
- Bilu–Linial Stable Instances of Max Cut and Minimum Multiway Cut
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
