{"id":"https://openalex.org/W2886419155","doi":"https://doi.org/10.1109/isit.2018.8437543","title":"Universal Batch Learning with Log-Loss","display_name":"Universal Batch Learning with Log-Loss","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2886419155","doi":"https://doi.org/10.1109/isit.2018.8437543","mag":"2886419155"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437543","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437543","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005484384","display_name":"Yaniv Fogel","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Yaniv Fogel","raw_affiliation_strings":["School of Electrical Engineering, Tel Aviv University"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Tel Aviv University","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066905280","display_name":"Meir Feder","orcid":"https://orcid.org/0000-0002-1290-0482"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Meir Feder","raw_affiliation_strings":["School of Electrical Engineering, Tel Aviv University"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Tel Aviv University","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005484384"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":1.6288,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.87699984,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"21","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.8231136798858643},{"id":"https://openalex.org/keywords/probably-approximately-correct-learning","display_name":"Probably approximately correct learning","score":0.6627254486083984},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6412819623947144},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6391459107398987},{"id":"https://openalex.org/keywords/generalization-error","display_name":"Generalization error","score":0.5849193930625916},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5699342489242554},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"Sample complexity","score":0.5240683555603027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4879416823387146},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4820786118507385},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4692665934562683},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4420079290866852},{"id":"https://openalex.org/keywords/statistical-learning-theory","display_name":"Statistical learning theory","score":0.4336186349391937},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4017930030822754},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3790562152862549},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.333126425743103},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2504982352256775},{"id":"https://openalex.org/keywords/unsupervised-learning","display_name":"Unsupervised learning","score":0.16619178652763367},{"id":"https://openalex.org/keywords/support-vector-machine","display_name":"Support vector machine","score":0.09895619750022888}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.8231136798858643},{"id":"https://openalex.org/C176248197","wikidata":"https://www.wikidata.org/wiki/Q458526","display_name":"Probably approximately correct learning","level":4,"score":0.6627254486083984},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6412819623947144},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6391459107398987},{"id":"https://openalex.org/C117765406","wikidata":"https://www.wikidata.org/wiki/Q5362437","display_name":"Generalization error","level":3,"score":0.5849193930625916},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5699342489242554},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.5240683555603027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4879416823387146},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4820786118507385},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4692665934562683},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4420079290866852},{"id":"https://openalex.org/C2779915298","wikidata":"https://www.wikidata.org/wiki/Q7604400","display_name":"Statistical learning theory","level":3,"score":0.4336186349391937},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4017930030822754},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3790562152862549},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.333126425743103},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2504982352256775},{"id":"https://openalex.org/C8038995","wikidata":"https://www.wikidata.org/wiki/Q1152135","display_name":"Unsupervised learning","level":2,"score":0.16619178652763367},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.09895619750022888},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2018.8437543","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437543","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W840677367","https://openalex.org/W1999120268","https://openalex.org/W2029538739","https://openalex.org/W2057393527","https://openalex.org/W2098397165","https://openalex.org/W2111296615","https://openalex.org/W2148574462","https://openalex.org/W2149298154","https://openalex.org/W2183235533","https://openalex.org/W2294584261","https://openalex.org/W2578992305","https://openalex.org/W2742781314","https://openalex.org/W6623482642"],"related_works":["https://openalex.org/W2005482365","https://openalex.org/W4224251733","https://openalex.org/W2016852016","https://openalex.org/W2090559885","https://openalex.org/W2967655751","https://openalex.org/W4240914861","https://openalex.org/W2354287326","https://openalex.org/W2171660797","https://openalex.org/W71398751","https://openalex.org/W2979772985"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,41,81],"consider":[4],"the":[5,18,21,35,45,59,62,74,77,87,97,112],"problem":[6],"of":[7,32,61,101],"batch":[8],"learning":[9,48,68,109],"with":[10,44],"log-loss,":[11],"in":[12,76,107],"a":[13,30,50,71,83],"stochastic":[14],"setting":[15],"where":[16,94],"given":[17],"data":[19],"features,":[20],"outcome":[22],"is":[23,70,96,104],"generated":[24],"by":[25],"an":[26,55],"unknown":[27],"distribution":[28],"from":[29],"class":[31],"models.":[33],"Utilizing":[34],"minimax":[36,46],"theorem":[37,53],"and":[38,54],"information-theoretical":[39],"tools,":[40],"came":[42],"up":[43],"universal":[47,67],"solution,":[49],"redundancy":[51],"capacity":[52],"upper":[56],"bound":[57,85],"on":[58,86],"performance":[60],"optimal":[63],"solution.":[64],"The":[65],"resulting":[66],"solution":[69],"mixture":[72],"over":[73],"models":[75],"considered":[78],"class.":[79],"Furthermore,":[80],"get":[82],"better":[84],"generalization":[88],"error":[89],"that":[90],"decays":[91],"as":[92],"O(logN/N),":[93],"N":[95],"sample":[98],"size,":[99],"instead":[100],"O(\u221alogN/N)":[102],"which":[103],"commonly":[105],"attained":[106],"statistical":[108],"theory":[110],"for":[111],"empirical":[113],"risk":[114],"minimizer.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
