가야대학교 분성도서관

상단 글로벌/추가 메뉴

회원 로그인

주메뉴

: • 전체검색; • 단행본; • 정기간행물; • 학위논문; • 비도서; • 특정번호 검색; • 기사색인; • 학습연구지원; • 지정도서

: • 전자자원통합검색; • 해외 WEB DB; • E-Book; • E-Learning; • 국내 WEB DB; • 인터넷검색

: • 대출현황조회/연장; • 예약현황조회/취소; • 희망도서; • 내서재; • 나의서평; • 나의태그; • 나의위젯; • RSS; • SDI; • 개인정보관리

: • 공지사항; • FAQ; • Q&A 일반·학술; • 신착/인기 도서; • 학위논문온라인제출; • 외부인 이용안내; • 설문조사

: • 도서관 소개; • 연혁; • 현황; • 이용안내; • 찾아오시는 길

자료검색

Home
상세정보

상세정보

검색결과 돌아가기

부가기능

MARC보기

Avoiding Communication in First Order Methods for Optimization

상세 프로파일

상세정보
자료유형	E-Book
개인저자	Devarakonda, Aditya.
단체저자명	University of California, Berkeley. Electrical Engineering & Computer Sciences.
서명/저자사항	Avoiding Communication in First Order Methods for Optimization.
발행사항	[S.l.] : University of California, Berkeley., 2018
발행사항	Ann Arbor : ProQuest Dissertations & Theses, 2018
형태사항	125 p.
소장본 주기	School code: 0028.
ISBN	9780438325531
일반주기	Source: Dissertation Abstracts International, Volume: 80-01(E), Section: B. Adviser: James W. Demmel.
요약	Machine learning has gained renewed interest in recent years due to advances in computer hardware (processing power and high-capacity storage) and the availability of large amounts of data which can be used to develop accurate, robust models. Wh
요약	In addition to hardware improvements, algorithm redesign is also an important direction to further reduce running times. On modern computer architectures, the cost of moving data (communication) from main memory to caches in a single machine is
요약	Many problems in machine learning solve mathematical optimization problems which, in most non-linear and non-convex cases, requires iterative methods. This thesis is focused on deriving communication-avoiding variants of the block coordinate des
요약	This thesis adapts well-known techniques from existing work on communication-avoiding (CA) Krylov and s-step Krylov methods. CA-Krylov methods unroll vector recurrences and rearrange the sequence of computation in way that defers communication f
요약	We apply a similar recurrence unrolling technique to block coordinate descent in order to obtain communication-avoiding variants which solve the L2-regularized least-squares, L1-regularized least-squares, Support Vector Machines, and Kernel prob
요약	Our experimental results illustrate that our new, communication-avoiding methods can obtain speedups of up to 6.1x on a Cray XC30 supercomputer using MPI for parallel processing. For CA-kernel methods we show modeled speedups of 26x, 120x, and 1
요약	Finally, we also present an adaptive batch size technique which reduces the latency cost of training convolutional neural networks (CNN). With this technique we have achieved speedups of up to 6.25x when training CNNs on up to 4 NVIDIA P100 GPUs
일반주제명	Computer science.
언어	영어
기본자료 저록	Dissertation Abstracts International80-01B(E). Dissertation Abstract International
대출바로가기	http://www.riss.kr/pdu/ddodLink.do?id=T14999755