{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T01:51:58Z","timestamp":1772934718007,"version":"3.50.1"},"reference-count":39,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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":[[2025,12,8]]},"DOI":"10.1109\/bigdata66926.2025.11402371","type":"proceedings-article","created":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T20:57:57Z","timestamp":1772830677000},"page":"64-73","source":"Crossref","is-referenced-by-count":0,"title":["On Efficient Computation of Generalized Distance Oracles"],"prefix":"10.1109","author":[{"given":"Zhao","family":"Song","sequence":"first","affiliation":[{"name":"University of California, Berkeley,Berkeley,CA,USA"}]},{"given":"Jason","family":"Zhang","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology,Atlanta,GA,USA"}]},{"given":"Jiahao","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Washington,Seattle,WA,USA"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Sublinear leastsquares value iteration via locality sensitive hashing","author":"Shrivastava","year":"2021","journal-title":"arXiv preprint"},{"key":"ref2","article-title":"Slide: In defense of smart algorithms over hardware acceleration for large-scale deep learning systems","author":"Chen","year":"2020","journal-title":"MLSys"},{"key":"ref3","article-title":"Mongoose: A learnable lsh framework for efficient neural network training","author":"Chen","year":"2020","journal-title":"ICLR"},{"key":"ref4","article-title":"Breaking the linear iteration cost barrier for some well-known conditional gradient methods using maxip data-structures","author":"Xu","year":"2021","journal-title":"NeurIPS"},{"key":"ref5","article-title":"Speeding up sparsification with inner product search data structures","author":"Song","year":"2022","journal-title":"arXiv preprint"},{"key":"ref6","article-title":"Kernel methods for deep learning","author":"Cho","year":"2009","journal-title":"NeurIPS"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0420-4"},{"key":"ref8","article-title":"Practical datadependent metric compression with provable guarantees","author":"Indyk","year":"2017","journal-title":"NeurIPS"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/20m1330701"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.27"},{"key":"ref11","article-title":"An illuminating algorithm for the light bulb problem","volume-title":"2nd Symposium on Simplicity in Algorithms (SOSA)","author":"Alman","year":"2019"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/1099-128X(200005\/06)14:3<285::AID-CEM584>3.0.CO;2-1"},{"key":"ref13","volume-title":"Multi-way analysis with applications in the chemical sciences","author":"Bro","year":"2004"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btv208"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-015-0598-0"},{"key":"ref16","volume-title":"Three-mode principal component analysis: Theory and applications","volume":"2","author":"Kroonenberg","year":"1983"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.5555\/1379811.1379818"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.04.006"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488620"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.172"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897639"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055431"},{"key":"ref24","article-title":"Towards a zeroone law for column subset selection","author":"Song","year":"2019","journal-title":"NeurIPS"},{"key":"ref25","article-title":"Average case column subset selection for entrywise \u21131-norm loss","author":"Song","year":"2019","journal-title":"NeurIPS"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.21"},{"key":"ref27","article-title":"Sketching for first order method: efficient algorithm for low-bandwidth channel and vulnerability","author":"Song","year":"2023","journal-title":"ICML"},{"key":"ref28","article-title":"Solving attention kernel regression problem via pre-conditioner","author":"Song","year":"2024","journal-title":"AISTATS"},{"key":"ref29","volume-title":"Matrix theory: optimization, concentration, and algorithms","author":"Song","year":"2019"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3424305"},{"key":"ref31","article-title":"Oblivious sketching-based central path method for linear programming","author":"Song","year":"2021","journal-title":"ICML"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451058"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.32"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00130"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.134"},{"key":"ref38","article-title":"More asymmetry yields faster matrix multiplication","author":"Alman","year":"2024","journal-title":"arXiv preprint"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/06065551"}],"event":{"name":"2025 IEEE International Conference on Big Data (BigData)","location":"Macau, China","start":{"date-parts":[[2025,12,8]]},"end":{"date-parts":[[2025,12,11]]}},"container-title":["2025 IEEE International Conference on Big Data (BigData)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11400704\/11400712\/11402371.pdf?arnumber=11402371","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T07:15:27Z","timestamp":1772867727000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11402371\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/bigdata66926.2025.11402371","relation":{},"subject":[],"published":{"date-parts":[[2025,12,8]]}}}