{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:49Z","timestamp":1773377629773,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849541","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1452-1456","source":"Crossref","is-referenced-by-count":1,"title":["Learning Feature Nonlinearities with Regularized Binned Regression"],"prefix":"10.1109","author":[{"given":"Samet","family":"Oymak","sequence":"first","affiliation":[{"name":"University of California, Riverside"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehrdad","family":"Mahdavi","sequence":"additional","affiliation":[{"name":"Penn State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiasi","family":"Chen","sequence":"additional","affiliation":[{"name":"University of California, Riverside"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"685","article-title":"On iterative hard thresholding methods for high-dimensional m-estimation","author":"jain","year":"2014","journal-title":"NIPS"},{"key":"ref11","article-title":"A unified framework for high-dimensional analysis of m-estimators with decomposable regularizers","author":"negahban","year":"2009","journal-title":"NIPS"},{"key":"ref12","article-title":"Learning feature nonlinearities with non-convex regularized binned regression","author":"oymak","year":"2017"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2773497"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau005"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-012-9135-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90282-0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"ref19","article-title":"Human resources analytics","author":"benistant","year":"2016"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1023\/A:1016304305535","article-title":"Discretization: An enabling technique","volume":"6","author":"liu","year":"2002","journal-title":"Data Mining and Knowledge Discovery"},{"key":"ref3","first-page":"1201","article-title":"Spam: Sparse additive models","author":"ravikumar","year":"2007","journal-title":"NIPS"},{"key":"ref6","author":"breiman","year":"1984","journal-title":"Classification and Regression Trees"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-377-6.50032-3"},{"key":"ref8","article-title":"Current population survey: Version 4.0 [dataset]","author":"flood","year":"2015","journal-title":"Integrated Public Use Microdata Series"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS692"},{"key":"ref2","volume":"43","author":"hastie","year":"1990","journal-title":"Generalized Additive Models"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1111\/insr.12167"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375680"},{"key":"ref20","article-title":"Adult data set","author":"becker","year":"1996","journal-title":"UCI Machine Learning Repository"},{"key":"ref22","article-title":"Minimax optimal rates of estimation in high dimensional additive models: Universal phase transition","author":"yuan","year":"2015"},{"key":"ref21","first-page":"389","article-title":"Minimax-optimal rates for sparse additive models over kernel classes via convex programming","volume":"13","author":"raskutti","year":"2012","journal-title":"JMLR"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00490.x"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849541.pdf?arnumber=8849541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:40Z","timestamp":1773347680000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849541\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849541","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}