15 papers:
- ICML-2015-OsadchyHK #classification
- K-hyperplane Hinge-Minimax Classifier (MO, TH, DK), pp. 1558–1566.
- ICML-2015-Suzuki #convergence
- Convergence rate of Bayesian tensor estimator and its minimax optimality (TS), pp. 1273–1282.
- ICML-c1-2014-LuoS #learning #online #towards
- Towards Minimax Online Learning with Unknown Time Horizon (HL, RES), pp. 226–234.
- ICML-c2-2014-ZhouLPM
- Aggregating Ordinal Labels from Crowds by Minimax Conditional Entropy (DZ, QL, JCP, CM), pp. 262–270.
- MLDM-2014-UtkinZC #classification #data-driven #database #robust
- A Robust One-Class Classification Model with Interval-Valued Data Based on Belief Functions and Minimax Strategy (LVU, YAZ, AIC), pp. 107–118.
- STOC-2012-AbernethyFW
- Minimax option pricing meets black-scholes in the limit (JA, RMF, AW), pp. 1029–1040.
- ICML-2011-RobbianoC #learning #plugin #ranking
- Minimax Learning Rates for Bipartite Ranking and Plug-in Rules (SR, SC), pp. 441–448.
- PODS-2010-GupteS #privacy
- Universally optimal privacy mechanisms for minimax agents (MG, MS), pp. 135–146.
- ICDAR-2009-HeH09a #classification #estimation #online #using
- Affine Distortion Compensation for an Isolated Online Handwritten Chinese Character Using Combined Orientation Estimation and HMM-Based Minimax Classification (TH, QH), pp. 1226–1230.
- ICML-2007-BryanMSS
- Efficiently computing minimax expected-size confidence regions (BB, HBM, CMS, JGS), pp. 97–104.
- ICML-2007-KimC #algorithm #geometry #message passing
- Neighbor search with global geometry: a minimax message passing algorithm (KHK, SC), pp. 401–408.
- HPCA-2002-UnsalKKM #energy #framework
- The Minimax Cache: An Energy-Efficient Framework for Media Processors (OSÜ, IK, CMK, CAM), pp. 131–140.
- STOC-2001-Tokuyama #multi #optimisation #parametricity #problem
- Minimax parametric optimization problems and multi-dimensional parametric searching (TT), pp. 75–83.
- STOC-1986-LeightonS #algorithm #analysis #bound #grid
- Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms (FTL, PWS), pp. 91–103.
- STOC-1981-PatersonRS #bound
- Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract) (MP, WLR, LS), pp. 293–299.