scientific article; zbMATH DE number 7255066
From MaRDI portal
Publication:4969074
zbMath1498.68225arXiv1901.02324MaRDI QIDQ4969074
André F. T. Martins, Mathieu Blondel, Vlad Niculae
Publication date: 5 October 2020
Full work available at URL: https://arxiv.org/abs/1901.02324
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
Tutorial on Amortized Optimization ⋮ Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times
Uses Software
Cites Work
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Fast projection onto the simplex and the \(l_1\) ball
- Bandit online optimization over the permutahedron
- The complexity of computing the permanent
- An O(n) algorithm for quadratic knapsack problems
- Information geometry and its applications
- On the limited memory BFGS method for large scale optimization
- On surrogate loss functions and \(f\)-divergences
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- I-divergence geometry of probability distributions and minimization problems
- Conditional gradient algorithms with open loop step size rules
- Sharp uniform convexity and smoothness inequalities for trace norms
- Convex analysis and nonlinear optimization. Theory and examples
- Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory
- On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms
- Possible generalization of Boltzmann-Gibbs statistics.
- Multiclass classification, information, divergence and surrogate risk
- Learning using privileged information: SVM+ and weighted SVM
- Concerning nonnegative matrices and doubly stochastic matrices
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- Information and Exponential Families
- Smoothing and First Order Methods: A Unified Framework
- Online Linear Optimization over Permutations
- 10.1162/15324430260185628
- Online Prediction under Submodular Constraints
- Generalization of Shannon–Khinchin Axioms to Nonextensive Systems and the Uniqueness Theorem for the Nonextensive Entropy
- Graphical Models, Exponential Families, and Variational Inference
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- Finding the nearest point in A polytope
- Dynamic programming algorithm optimization for spoken word recognition
- Finding optimum branchings
- Numerical Optimization
- Sparse Reconstruction by Separable Approximation
- Online Learning of Nash Equilibria in Congestion Games
- Strictly Proper Scoring Rules, Prediction, and Estimation
- Information, Divergence and Risk for Binary Experiments
- A Primal-Dual Convergence Analysis of Boosting
- Robust Estimation of a Location Parameter
- Proximité et dualité dans un espace hilbertien
- Pseudo-Convex Functions
- Statistical Inference for Probabilistic Functions of Finite State Markov Chains
- The Theory of Max-Min, with Applications
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Uncertainty, Information, and Sequential Experiments
- Optimum branchings
- Convex Analysis
- Elicitation of Personal Probabilities and Expectations
- Convexity, Classification, and Risk Bounds
- Convex analysis and monotone operator theory in Hilbert spaces
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
