Optimal Black-Box Reductions Between Optimization Objectives
원문 초록
The diverse world of machine learning applications has given rise to a plethora of algorithms and optimization methods, finely tuned to the specific regression or classification task at hand. We reduce the complexity of algorithm design for machine learning by reductions: we develop reductions that take a method developed for one setting and apply it to the entire spectrum of smoothness and strong-convexity in applications. Furthermore, unlike existing results, our new reductions are OPTIMAL and more PRACTICAL. We show how these new reductions give rise to new and faster running times on training linear classifiers for various families of loss functions, and conclude with experiments showing their successes also in practice.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Performing Image Classification for 10 Different Monkey Species using CNN
Extraction of Heart Rate from PPG Signal: A Machine Learning Approach using Decision Tree Regression Algorithm
Statistical characterization and classification of colon microarray gene expression data using multiple machine learning paradigms
Enhanced network anomaly detection based on deep neural networks
Using Data Mining to Predict Hospital Admissions From the Emergency Department
ExploreKit: Automatic Feature Generation and Selection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.