On the difficulty of approximately maximizing agreements.
From MaRDI portal
Publication:1401958
Recommendations
- A note on bargaining over a finite number of feasible agreements
- The maximum incentive solutions in bargaining problems
- Efficient solutions to bargaining problems with uncertain disagreement points
- The complexity of optimal mechanism design
- On the complexity of approximating a Nash equilibrium
- scientific article; zbMATH DE number 6783488
- scientific article; zbMATH DE number 4133866
- The complexity of finding Nash equilibria
- On the structure and complexity of worst-case equilibria
Cites work
- Computational limitations on learning from examples
- Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
- Cryptographic hardness of distribution-specific learning
- Cryptographic limitations on learning Boolean formulae and finite automata
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- scientific article; zbMATH DE number 1256748 (Why is no real title available?)
- scientific article; zbMATH DE number 1559516 (Why is no real title available?)
- Learnability and the Vapnik-Chervonenkis dimension
- Learning in the Presence of Malicious Errors
- Robust trainability of single neurons
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- Toward efficient agnostic learning
- Tracking drifting concepts by minimizing disagreements
Cited in
(31)- Margin-based first-order rule learning
- Hardness results for neural network approximation problems
- The computational complexity of densest region detection
- A theory of learning from different domains
- Goal scoring, coherent loss and applications to machine learning
- Applications of regularized least squares to pattern classification
- An experimental evaluation of simplicity in rule learning
- An improved branch-and-bound method for maximum monomial agreement
- Hierarchical design of fast minimum disagreement algorithms
- scientific article; zbMATH DE number 2089368 (Why is no real title available?)
- Algorithmic aspects of determining depth functions in a procedure for optimal hypothesis selection in data classification problems
- On agnostic learning of parities, monomials, and halfspaces
- scientific article; zbMATH DE number 1966608 (Why is no real title available?)
- scientific article; zbMATH DE number 2080452 (Why is no real title available?)
- Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
- Beyond trees: classification with sparse pairwise dependencies
- Hardness results for agnostically learning low-degree polynomial threshold functions
- Maximizing agreements with one-sided error with applications to heuristic learning
- Maximizing agreements with one-sided error with applications to heuristic learning
- A nonlinear kernel SVM Classifier via \(L_{0/1}\) soft-margin loss with classification performance
- Turning Grain Maps into Diagrams
- Lower bounds for agnostic learning via approximate rank
- A new column generation algorithm for logical analysis of data
- Statistical computational learning
- Adversarial consistency and the uniqueness of the adversarial Bayes classifier
- Rule generation for classification: scalability, interpretability, and fairness
- Optimality conditions and gradient descent Newton pursuit for 0/1-loss and sparsity constrained optimization
- Maximizing agreements and coagnostic learning
- Self-improved gaps almost everywhere for the agnostic approximation of monomials
- A Fisher consistent multiclass loss function with variable margin on positive examples
- Kernel methods in machine learning
This page was built for publication: On the difficulty of approximately maximizing agreements.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401958)
