{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T11:12:24Z","timestamp":1730200344002,"version":"3.28.0"},"reference-count":44,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,12,17]]},"DOI":"10.1109\/bigdata55660.2022.10020385","type":"proceedings-article","created":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T19:35:23Z","timestamp":1674761723000},"page":"115-120","source":"Crossref","is-referenced-by-count":2,"title":["Adaptive and Dynamic Multi-Resolution Hashing for Pairwise Summations"],"prefix":"10.1109","author":[{"given":"Lianke","family":"Qin","sequence":"first","affiliation":[{"name":"University of California, Santa Barbara,Department of Computer Science,Santa Barbara,CA"}]},{"given":"Aravind","family":"Reddy","sequence":"additional","affiliation":[{"name":"Northwestern University,Department of Computer Science,Evanston,IL"}]},{"given":"Zhao","family":"Song","sequence":"additional","affiliation":[{"name":"Adobe Research Adobe,San Jose,CA"}]},{"given":"Zhaozhuo","family":"Xu","sequence":"additional","affiliation":[{"name":"Rice University,Department of Computer Science,Houston,TX"}]},{"given":"Danyang","family":"Zhuo","sequence":"additional","affiliation":[{"name":"Duke University,Department of Computer Science,Durham,NC"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-377-6.50069-4"},{"key":"ref2","first-page":"1694","article-title":"uniform convergence rates for kernel density estimation","author":"Jiang","year":"2017","journal-title":"ICML"},{"key":"ref3","article-title":"A new unbiased and efficient class of lsh-based samplers and estimators for partition function computation in log-linear models","author":"Spring","year":"2017","journal-title":"arXiv preprint arXiv:1703.05160"},{"key":"ref4","article-title":"Space and time efficient kernel density estimation in high dimensions","volume":"32","author":"Backurs","year":"2019","journal-title":"NIPS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00051"},{"key":"ref6","first-page":"15088","article-title":"A fair classifier using kernel density estimation","volume":"33","author":"Cho","year":"2020","journal-title":"NIPS"},{"key":"ref7","first-page":"291","article-title":"Slide: In defense of smart algorithms over hardware acceleration for large-scale deep learning systems","volume-title":"Proceedings of Machine Learning and Systems","volume":"2","author":"Chen"},{"key":"ref8","article-title":"Mongoose: A learnable lsh framework for efficient neural network training","author":"Chen","year":"2020","journal-title":"ICLR"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176348768"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.stamet.2005.04.001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/02331880500439782"},{"key":"ref12","first-page":"3108","article-title":"Deann: Speeding up kernel-density estimation using approximate nearest neighbor search","author":"Karppa","year":"2022","journal-title":"AISTATS"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/13658810802475491"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2018.1549052"},{"key":"ref15","first-page":"442","article-title":"Flows for simultaneous manifold learning and density estimation","volume":"33","author":"Brehmer","year":"2020","journal-title":"NIPS"},{"key":"ref16","first-page":"4202","article-title":"One-pass diversified sampling with application to terabyte-scale genomic sequence streams","volume-title":"International Conference on Machine Learning","author":"Coleman"},{"issue":"1","key":"ref17","first-page":"2529","article-title":"Robust kernel density estimation","volume":"13","author":"Kim","year":"2012","journal-title":"JMLR"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.63"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1198\/004017005000000391"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.aap.2008.12.014"},{"key":"ref21","first-page":"11 178","article-title":"On adaptive distance estimation","volume":"33","author":"Cherapanamjeri","year":"2020","journal-title":"NIPS"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00076"},{"key":"ref23","article-title":"Breaking the linear iteration cost barrier for some well-known conditional gradient methods using maxip data-structures","author":"Shrivastava","year":"2021","journal-title":"NeurIPS"},{"key":"ref24","article-title":"Sublinear least-squares value iteration via locality sensitive hashing","author":"Shrivastava","year":"2021","journal-title":"arXiv preprint arXiv:2105.08285"},{"key":"ref25","article-title":"Training multi-layer over-parametrized neural network in subquadratic time","author":"Song","year":"2021","journal-title":"arXiv preprint arXiv:2112.07628"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00118"},{"key":"ref27","article-title":"Speeding up sparsification using inner product search data structures","author":"Song","year":"2022","journal-title":"arXiv preprint arXiv:2204.03209"},{"key":"ref28","article-title":"Sketching meets differential privacy: Fast algorithm for dynamic kronecker projection maintenance","author":"Song","year":"2022","journal-title":"arXiv preprint arXiv:2210.11542"},{"key":"ref29","article-title":"Rethinking softmax cross-entropy loss for adversarial robustness","author":"Pang","year":"2019","journal-title":"ICLR"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316303"},{"key":"ref31","article-title":"Solving empirical risk minimization in the current matrix multiplication time","author":"Lee","year":"2019","journal-title":"COLT"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00089"},{"key":"ref33","article-title":"Oblivious sketching-based central path method for solving linear programming problems","author":"Song","year":"2021","journal-title":"ICML"},{"key":"ref34","article-title":"Does preprocessing help training over-parameterized neural networks?","volume":"34","author":"Song","year":"2021","journal-title":"NIPS"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451056"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451058"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00029"},{"key":"ref38","volume-title":"Learning with kernels","volume":"4","author":"Smola","year":"1998"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.99"},{"key":"ref40","article-title":"Rehashing kernel evaluation in high dimensions","author":"Siminelakis","year":"2019","journal-title":"ICML"},{"key":"ref41","article-title":"Explaining and harnessing adversarial examples","author":"Goodfellow","year":"2014","journal-title":"arXiv preprint arXiv:1412.6572"},{"key":"ref42","article-title":"Transferability in machine learning: from phenomena to black-box attacks using adversarial samples","author":"Papernot","year":"2016","journal-title":"arXiv preprint arXiv:1605.07277"},{"article-title":"Delving into transferable adversarial examples and black-box attacks","volume-title":"ICLR 2017, Toulon, France, April 24-26, 2017, Conference Track Proceedings","author":"Liu","key":"ref43"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2886017"}],"event":{"name":"2022 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2022,12,17]]},"location":"Osaka, Japan","end":{"date-parts":[[2022,12,20]]}},"container-title":["2022 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10020192\/10020156\/10020385.pdf?arnumber=10020385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T06:46:53Z","timestamp":1707806813000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10020385\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,17]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/bigdata55660.2022.10020385","relation":{},"subject":[],"published":{"date-parts":[[2022,12,17]]}}}