A near-optimal algorithm for approximating the John Ellipsoid

被引：0

作者：

Cohen, Michael B. ^{[1
]}

Cousins, Ben ^{[2
]}

Lee, Yin Tat ^{[3
]}

Yang, Xin ^{[3
]}

机构：

[1] MIT, Cambridge, MA 02139 USA

[2] Columbia Univ, New York, NY 10027 USA

[3] Univ Washington, Seattle, WA 98195 USA

来源：

CONFERENCE ON LEARNING THEORY, VOL 99 | 2019年 / 99卷

关键词：

John Ellipsoid; fixed point method; optimal design; HIT-AND-RUN; VOLUME; COMPUTATION; COMPLEXITY; MODEL;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We develop a simple and efficient algorithm for approximating the John Ellipsoid of a symmetric polytope. Our algorithm is near optimal in the sense that our time complexity matches the current best verification algorithm. Experimental results suggest that our algorithm significantly outperforms existing algorithms. We also provide the MATLAB code for further research.

引用

页数：25

共 50 条

[41] A Near-Optimal Heuristic Algorithm for Advance Lightpath Reservation in WDM Networks
Chen, Alice
Lee, Steven S. W.
2008 34TH EUROPEAN CONFERENCE ON OPTICAL COMMUNICATION (ECOC), 2008,
[42] Statistical properties of a near-optimal measurement-based CAC algorithm
Crosby, S
Leslie, I
McGurk, B
Lewis, JT
Russell, R
Toomey, F
IEEE ATM '97 WORKSHOP, PROCEEDINGS, 1997, : 103 - 112
[43] Universal near-optimal feedbacks
Nobakhtian, S
Stern, RJ
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2000, 107 (01) : 89 - 122
[44] Distributed near-optimal matching
Deng, XT
COMBINATORICA, 1996, 16 (04) : 453 - 464
[45] THE NEAR-OPTIMAL INSTRUCTION SET
SMITH, T
IEEE MICRO, 1982, 2 (03) : 5 - 6
[46] HySST: An Asymptotically Near-Optimal Motion Planning Algorithm for Hybrid Systems*
Wang, Nan
Sanfelice, Ricardo G.
2023 62ND IEEE CONFERENCE ON DECISION AND CONTROL, CDC, 2023, : 2865 - 2870
[47] Design of Near-Optimal Trajectories for the Biped Robot Using MCIWO Algorithm
Mandava, Ravi Kumar
Vundavilli, Pandu R.
SOFT COMPUTING FOR PROBLEM SOLVING, SOCPROS 2017, VOL 1, 2019, 816 : 355 - 364
[48] A Near-Optimal Algorithm for Constraint Test Ordering in Automated Stowage Planning
Lee, Zhuo Qi
Fan, Rui
Hsu, Wen-Jing
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2018, 15 (03) : 1298 - 1308
[49] A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization
Dagreou, Mathieu
Moreau, Thomas
Vaiter, Samuel
Ablin, Pierre
INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 238, 2024, 238
[50] Automatic palletizing of concrete pavement blocks: An algorithm for near-optimal assembly
Shoval, S
Rosenfeld, Y
Navon, R
COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 2001, 16 (03) : 180 - 187

← 1 2 3 4 5 →