[{"language":[{"iso":"eng"}],"title":"Adversarial robustness via noise injection in smoothed models","volume":53,"date_created":"2024-10-08T12:47:53Z","article_processing_charge":"No","day":"09","abstract":[{"lang":"eng","text":"Deep neural networks are known to be vulnerable to malicious perturbations. Current methods for improving adversarial robustness make use of either implicit or explicit regularization, with the latter is usually based on adversarial training. Randomized smoothing, the averaging of the classifier outputs over a random distribution centered in the sample, has been shown to guarantee a classifier’s performance subject to bounded perturbations of the input. In this work, we study the application of randomized smoothing to improve performance on unperturbed data and increase robustness to adversarial attacks. We propose to combine smoothing along with adversarial training and randomization approaches, and find that doing so significantly improves the resilience compared to the baseline. We examine our method’s performance on common whitebox (FGSM, PGD) and black-box (transferable attack and NAttack) attacks on CIFAR-10 and CIFAR-100, and determine that for a low number of iterations, smoothing provides a significant performance boost that persists even for perturbations with a high attack norm, . For example, under a PGD-10 attack on CIFAR-10 using Wide-ResNet28-4, we achieve 60.3% accuracy for infinity norm ∞ = 8/255 and 13.1% accuracy for ∞ = 35/255 – outperforming previous art by 3% and 6%, respectively. We achieve nearly twice the accuracy on ∞ = 35/255 and even more so for perturbations with higher infinity norm. A reference implementation of the proposed method is provided. "}],"publication_status":"published","scopus_import":"1","extern":"1","date_updated":"2024-10-09T11:04:54Z","month":"08","date_published":"2022-08-09T00:00:00Z","article_type":"original","publisher":"Springer Nature","quality_controlled":"1","author":[{"last_name":"Nemcovsky","first_name":"Yaniv","full_name":"Nemcovsky, Yaniv"},{"full_name":"Zheltonozhskii, Evgenii","first_name":"Evgenii","last_name":"Zheltonozhskii"},{"full_name":"Baskin, Chaim","first_name":"Chaim","last_name":"Baskin"},{"full_name":"Chmiel, Brian","first_name":"Brian","last_name":"Chmiel"},{"last_name":"Bronstein","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","first_name":"Alexander"},{"last_name":"Mendelson","full_name":"Mendelson, Avi","first_name":"Avi"}],"status":"public","page":"9483-9498","issue":"8","year":"2022","_id":"18211","doi":"10.1007/s10489-022-03423-5","publication_identifier":{"issn":["0924-669X"],"eissn":["1573-7497"]},"type":"journal_article","publication":"Applied Intelligence","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","citation":{"ista":"Nemcovsky Y, Zheltonozhskii E, Baskin C, Chmiel B, Bronstein AM, Mendelson A. 2022. Adversarial robustness via noise injection in smoothed models. Applied Intelligence. 53(8), 9483–9498.","chicago":"Nemcovsky, Yaniv, Evgenii Zheltonozhskii, Chaim Baskin, Brian Chmiel, Alex M. Bronstein, and Avi Mendelson. “Adversarial Robustness via Noise Injection in Smoothed Models.” <i>Applied Intelligence</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s10489-022-03423-5\">https://doi.org/10.1007/s10489-022-03423-5</a>.","short":"Y. Nemcovsky, E. Zheltonozhskii, C. Baskin, B. Chmiel, A.M. Bronstein, A. Mendelson, Applied Intelligence 53 (2022) 9483–9498.","mla":"Nemcovsky, Yaniv, et al. “Adversarial Robustness via Noise Injection in Smoothed Models.” <i>Applied Intelligence</i>, vol. 53, no. 8, Springer Nature, 2022, pp. 9483–98, doi:<a href=\"https://doi.org/10.1007/s10489-022-03423-5\">10.1007/s10489-022-03423-5</a>.","ieee":"Y. Nemcovsky, E. Zheltonozhskii, C. Baskin, B. Chmiel, A. M. Bronstein, and A. Mendelson, “Adversarial robustness via noise injection in smoothed models,” <i>Applied Intelligence</i>, vol. 53, no. 8. Springer Nature, pp. 9483–9498, 2022.","apa":"Nemcovsky, Y., Zheltonozhskii, E., Baskin, C., Chmiel, B., Bronstein, A. M., &#38; Mendelson, A. (2022). Adversarial robustness via noise injection in smoothed models. <i>Applied Intelligence</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10489-022-03423-5\">https://doi.org/10.1007/s10489-022-03423-5</a>","ama":"Nemcovsky Y, Zheltonozhskii E, Baskin C, Chmiel B, Bronstein AM, Mendelson A. Adversarial robustness via noise injection in smoothed models. <i>Applied Intelligence</i>. 2022;53(8):9483-9498. doi:<a href=\"https://doi.org/10.1007/s10489-022-03423-5\">10.1007/s10489-022-03423-5</a>"},"intvolume":"        53"},{"status":"public","year":"2022","publication_identifier":{"issn":["2045-2322"]},"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","OA_type":"gold","oa":1,"article_processing_charge":"Yes","article_number":"21968","date_updated":"2024-10-14T09:46:06Z","publication_status":"published","article_type":"original","date_published":"2022-12-20T00:00:00Z","month":"12","publisher":"Springer Nature","quality_controlled":"1","author":[{"first_name":"Linor","full_name":"Ackerman-Schraier, Linor","last_name":"Ackerman-Schraier"},{"last_name":"Rosenberg","full_name":"Rosenberg, Aviv A.","first_name":"Aviv A."},{"full_name":"Marx, Ailie","first_name":"Ailie","last_name":"Marx"},{"last_name":"Bronstein","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander"}],"_id":"18220","doi":"10.1038/s41598-022-25874-z","publication":"Scientific Reports","type":"journal_article","external_id":{"pmid":["36539476"]},"citation":{"ista":"Ackerman-Schraier L, Rosenberg AA, Marx A, Bronstein AM. 2022. Machine learning approaches demonstrate that protein structures carry information about their genetic coding. Scientific Reports. 12, 21968.","short":"L. Ackerman-Schraier, A.A. Rosenberg, A. Marx, A.M. Bronstein, Scientific Reports 12 (2022).","chicago":"Ackerman-Schraier, Linor, Aviv A. Rosenberg, Ailie Marx, and Alex M. Bronstein. “Machine Learning Approaches Demonstrate That Protein Structures Carry Information about Their Genetic Coding.” <i>Scientific Reports</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41598-022-25874-z\">https://doi.org/10.1038/s41598-022-25874-z</a>.","ieee":"L. Ackerman-Schraier, A. A. Rosenberg, A. Marx, and A. M. Bronstein, “Machine learning approaches demonstrate that protein structures carry information about their genetic coding,” <i>Scientific Reports</i>, vol. 12. Springer Nature, 2022.","mla":"Ackerman-Schraier, Linor, et al. “Machine Learning Approaches Demonstrate That Protein Structures Carry Information about Their Genetic Coding.” <i>Scientific Reports</i>, vol. 12, 21968, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s41598-022-25874-z\">10.1038/s41598-022-25874-z</a>.","ama":"Ackerman-Schraier L, Rosenberg AA, Marx A, Bronstein AM. Machine learning approaches demonstrate that protein structures carry information about their genetic coding. <i>Scientific Reports</i>. 2022;12. doi:<a href=\"https://doi.org/10.1038/s41598-022-25874-z\">10.1038/s41598-022-25874-z</a>","apa":"Ackerman-Schraier, L., Rosenberg, A. A., Marx, A., &#38; Bronstein, A. M. (2022). Machine learning approaches demonstrate that protein structures carry information about their genetic coding. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-022-25874-z\">https://doi.org/10.1038/s41598-022-25874-z</a>"},"intvolume":"        12","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1038/s41598-022-25874-z","open_access":"1"}],"DOAJ_listed":"1","title":"Machine learning approaches demonstrate that protein structures carry information about their genetic coding","volume":12,"date_created":"2024-10-08T12:52:29Z","abstract":[{"lang":"eng","text":"Synonymous codons translate into the same amino acid. Although the identity of synonymous codons is often considered inconsequential to the final protein structure, there is mounting evidence for an association between the two. Our study examined this association using regression and classification models, finding that codon sequences predict protein backbone dihedral angles with a lower error than amino acid sequences, and that models trained with true dihedral angles have better classification of synonymous codons given structural information than models trained with random dihedral angles. Using this classification approach, we investigated local codon–codon dependencies and tested whether synonymous codon identity can be predicted more accurately from codon context than amino acid context alone, and most specifically which codon context position carries the most predictive power."}],"day":"20","extern":"1","scopus_import":"1","pmid":1},{"status":"public","year":"2022","publication_identifier":{"issn":["2041-1723"]},"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","OA_type":"gold","oa":1,"article_processing_charge":"Yes","article_number":"2815","date_updated":"2024-10-14T09:49:02Z","publication_status":"published","month":"05","article_type":"original","date_published":"2022-05-20T00:00:00Z","publisher":"Springer Nature","quality_controlled":"1","author":[{"full_name":"Rosenberg, Aviv A.","first_name":"Aviv A.","last_name":"Rosenberg"},{"last_name":"Marx","first_name":"Ailie","full_name":"Marx, Ailie"},{"orcid":"0000-0001-9699-8730","last_name":"Bronstein","full_name":"Bronstein, Alexander","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"}],"_id":"18221","doi":"10.1038/s41467-022-30390-9","type":"journal_article","publication":"Nature Communications","external_id":{"pmid":["35595777"]},"citation":{"ista":"Rosenberg AA, Marx A, Bronstein AM. 2022. Codon-specific Ramachandran plots show amino acid backbone conformation depends on identity of the translated codon. Nature Communications. 13, 2815.","chicago":"Rosenberg, Aviv A., Ailie Marx, and Alex M. Bronstein. “Codon-Specific Ramachandran Plots Show Amino Acid Backbone Conformation Depends on Identity of the Translated Codon.” <i>Nature Communications</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41467-022-30390-9\">https://doi.org/10.1038/s41467-022-30390-9</a>.","short":"A.A. Rosenberg, A. Marx, A.M. Bronstein, Nature Communications 13 (2022).","ieee":"A. A. Rosenberg, A. Marx, and A. M. Bronstein, “Codon-specific Ramachandran plots show amino acid backbone conformation depends on identity of the translated codon,” <i>Nature Communications</i>, vol. 13. Springer Nature, 2022.","mla":"Rosenberg, Aviv A., et al. “Codon-Specific Ramachandran Plots Show Amino Acid Backbone Conformation Depends on Identity of the Translated Codon.” <i>Nature Communications</i>, vol. 13, 2815, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s41467-022-30390-9\">10.1038/s41467-022-30390-9</a>.","apa":"Rosenberg, A. A., Marx, A., &#38; Bronstein, A. M. (2022). Codon-specific Ramachandran plots show amino acid backbone conformation depends on identity of the translated codon. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-022-30390-9\">https://doi.org/10.1038/s41467-022-30390-9</a>","ama":"Rosenberg AA, Marx A, Bronstein AM. Codon-specific Ramachandran plots show amino acid backbone conformation depends on identity of the translated codon. <i>Nature Communications</i>. 2022;13. doi:<a href=\"https://doi.org/10.1038/s41467-022-30390-9\">10.1038/s41467-022-30390-9</a>"},"intvolume":"        13","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1038/s41467-022-30390-9","open_access":"1"}],"DOAJ_listed":"1","title":"Codon-specific Ramachandran plots show amino acid backbone conformation depends on identity of the translated codon","volume":13,"date_created":"2024-10-08T12:53:01Z","day":"20","abstract":[{"text":"Synonymous codons translate into chemically identical amino acids. Once considered inconsequential to the formation of the protein product, there is evidence to suggest that codon usage affects co-translational protein folding and the final structure of the expressed protein. Here we develop a method for computing and comparing codon-specific Ramachandran plots and demonstrate that the backbone dihedral angle distributions of some synonymous codons are distinguishable with statistical significance for some secondary structures. This shows that there exists a dependence between codon identity and backbone torsion of the translated amino acid. Although these findings cannot pinpoint the causal direction of this dependence, we discuss the vast biological implications should coding be shown to directly shape protein conformation and demonstrate the usefulness of this method as a tool for probing associations between codon usage and protein structure. Finally, we urge for the inclusion of exact genetic information into structural databases.","lang":"eng"}],"scopus_import":"1","extern":"1","pmid":1},{"type":"journal_article","publication":"Human Reproduction","citation":{"mla":"Fordham, Daniel E., et al. “Embryologist Agreement When Assessing Blastocyst Implantation Probability: Is Data-Driven Prediction the Solution to Embryo Assessment Subjectivity?” <i>Human Reproduction</i>, vol. 37, no. 10, Oxford University Press, 2022, pp. 2275–90, doi:<a href=\"https://doi.org/10.1093/humrep/deac171\">10.1093/humrep/deac171</a>.","ieee":"D. E. Fordham <i>et al.</i>, “Embryologist agreement when assessing blastocyst implantation probability: Is data-driven prediction the solution to embryo assessment subjectivity?,” <i>Human Reproduction</i>, vol. 37, no. 10. Oxford University Press, pp. 2275–2290, 2022.","apa":"Fordham, D. E., Rosentraub, D., Polsky, A. L., Aviram, T., Wolf, Y., Perl, O., … Munné, S. (2022). Embryologist agreement when assessing blastocyst implantation probability: Is data-driven prediction the solution to embryo assessment subjectivity? <i>Human Reproduction</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/humrep/deac171\">https://doi.org/10.1093/humrep/deac171</a>","ama":"Fordham DE, Rosentraub D, Polsky AL, et al. Embryologist agreement when assessing blastocyst implantation probability: Is data-driven prediction the solution to embryo assessment subjectivity? <i>Human Reproduction</i>. 2022;37(10):2275-2290. doi:<a href=\"https://doi.org/10.1093/humrep/deac171\">10.1093/humrep/deac171</a>","ista":"Fordham DE, Rosentraub D, Polsky AL, Aviram T, Wolf Y, Perl O, Devir A, Rosentraub S, Silver DH, Gold Zamir Y, Bronstein AM, Lara Lara M, Ben Nagi J, Alvarez A, Munné S. 2022. Embryologist agreement when assessing blastocyst implantation probability: Is data-driven prediction the solution to embryo assessment subjectivity? Human Reproduction. 37(10), 2275–2290.","chicago":"Fordham, Daniel E, Dror Rosentraub, Avital L Polsky, Talia Aviram, Yotam Wolf, Oriel Perl, Asnat Devir, et al. “Embryologist Agreement When Assessing Blastocyst Implantation Probability: Is Data-Driven Prediction the Solution to Embryo Assessment Subjectivity?” <i>Human Reproduction</i>. Oxford University Press, 2022. <a href=\"https://doi.org/10.1093/humrep/deac171\">https://doi.org/10.1093/humrep/deac171</a>.","short":"D.E. Fordham, D. Rosentraub, A.L. Polsky, T. Aviram, Y. Wolf, O. Perl, A. Devir, S. Rosentraub, D.H. Silver, Y. Gold Zamir, A.M. Bronstein, M. Lara Lara, J. Ben Nagi, A. Alvarez, S. Munné, Human Reproduction 37 (2022) 2275–2290."},"intvolume":"        37","quality_controlled":"1","page":"2275-2290","author":[{"last_name":"Fordham","first_name":"Daniel E","full_name":"Fordham, Daniel E"},{"last_name":"Rosentraub","first_name":"Dror","full_name":"Rosentraub, Dror"},{"full_name":"Polsky, Avital L","first_name":"Avital L","last_name":"Polsky"},{"last_name":"Aviram","full_name":"Aviram, Talia","first_name":"Talia"},{"last_name":"Wolf","first_name":"Yotam","full_name":"Wolf, Yotam"},{"first_name":"Oriel","full_name":"Perl, Oriel","last_name":"Perl"},{"first_name":"Asnat","full_name":"Devir, Asnat","last_name":"Devir"},{"full_name":"Rosentraub, Shahar","first_name":"Shahar","last_name":"Rosentraub"},{"full_name":"Silver, David H","first_name":"David H","last_name":"Silver"},{"full_name":"Gold Zamir, Yael","first_name":"Yael","last_name":"Gold Zamir"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730"},{"last_name":"Lara Lara","first_name":"Miguel","full_name":"Lara Lara, Miguel"},{"last_name":"Ben Nagi","full_name":"Ben Nagi, Jara","first_name":"Jara"},{"last_name":"Alvarez","full_name":"Alvarez, Adrian","first_name":"Adrian"},{"first_name":"Santiago","full_name":"Munné, Santiago","last_name":"Munné"}],"doi":"10.1093/humrep/deac171","_id":"18222","scopus_import":"1","extern":"1","title":"Embryologist agreement when assessing blastocyst implantation probability: Is data-driven prediction the solution to embryo assessment subjectivity?","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/humrep/deac171"}],"language":[{"iso":"eng"}],"volume":37,"day":"01","abstract":[{"lang":"eng","text":"STUDY QUESTION: What is the accuracy and agreement of embryologists when assessing the implantation probability of blastocysts using time-lapse imaging (TLI), and can it be improved with a data-driven algorithm?\r\n\r\nSUMMARY ANSWER: The overall interobserver agreement of a large panel of embryologists was moderate and prediction accuracy was modest, while the purpose-built artificial intelligence model generally resulted in higher performance metrics.\r\n\r\nWHAT IS KNOWN ALREADY: Previous studies have demonstrated significant interobserver variability amongst embryologists when assessing embryo quality. However, data concerning embryologists’ ability to predict implantation probability using TLI is still lacking. Emerging technologies based on data-driven tools have shown great promise for improving embryo selection and predicting clinical outcomes.\r\n\r\nSTUDY DESIGN, SIZE, DURATION: TLI video files of 136 embryos with known implantation data were retrospectively collected from two clinical sites between 2018 and 2019 for the performance assessment of 36 embryologists and comparison with a deep neural network (DNN).\r\n\r\nPARTICIPANTS/MATERIALS, SETTING, METHODS: We recruited 39 embryologists from 13 different countries. All participants were blinded to clinical outcomes. A total of 136 TLI videos of embryos that reached the blastocyst stage were used for this experiment. Each embryo’s likelihood of successfully implanting was assessed by 36 embryologists, providing implantation probability grades (IPGs) from 1 to 5, where 1 indicates a very low likelihood of implantation and 5 indicates a very high likelihood. Subsequently, three embryologists with over 5 years of experience provided Gardner scores. All 136 blastocysts were categorized into three quality groups based on their Gardner scores. Embryologist predictions were then converted into predictions of implantation (IPG ≥ 3) and no implantation (IPG ≤ 2). Embryologists’ performance and agreement were assessed using Fleiss kappa coefficient. A 10-fold cross-validation DNN was developed to provide IPGs for TLI video files. The model’s performance was compared to that of the embryologists.\r\n\r\nMAIN RESULTS AND THE ROLE OF CHANCE: Logistic regression was employed for the following confounding variables: country of residence, academic level, embryo scoring system, log years of experience and experience using TLI. None were found to have a statistically significant impact on embryologist performance at α = 0.05. The average implantation prediction accuracy for the embryologists was 51.9% for all embryos (N = 136). The average accuracy of the embryologists when assessing top quality and poor quality embryos (according to the Gardner score categorizations) was 57.5% and 57.4%, respectively, and 44.6% for fair quality embryos. Overall interobserver agreement was moderate (κ = 0.56, N = 136). The best agreement was achieved in the poor + top quality group (κ = 0.65, N = 77), while the agreement in the fair quality group was lower (κ = 0.25, N = 59). The DNN showed an overall accuracy rate of 62.5%, with accuracies of 62.2%, 61% and 65.6% for the poor, fair and top quality groups, respectively. The AUC for the DNN was higher than that of the embryologists overall (0.70 DNN vs 0.61 embryologists) as well as in all of the Gardner groups (DNN vs embryologists—Poor: 0.69 vs 0.62; Fair: 0.67 vs 0.53; Top: 0.77 vs 0.54).\r\n\r\nLIMITATIONS, REASONS FOR CAUTION: Blastocyst assessment was performed using video files acquired from time-lapse incubators, where each video contained data from a single focal plane. Clinical data regarding the underlying cause of infertility and endometrial thickness before the transfer was not available, yet may explain implantation failure and lower accuracy of IPGs. Implantation was defined as the presence of a gestational sac, whereas the detection of fetal heartbeat is a more robust marker of embryo viability. The raw data were anonymized to the extent that it was not possible to quantify the number of unique patients and cycles included in the study, potentially masking the effect of bias from a limited patient pool. Furthermore, the lack of demographic data makes it difficult to draw conclusions on how representative the dataset was of the wider population. Finally, embryologists were required to assess the implantation potential, not embryo quality. Although this is not the traditional approach to embryo evaluation, morphology/morphokinetics as a means of assessing embryo quality is believed to be strongly correlated with viability and, for some methods, implantation potential.\r\n\r\nWIDER IMPLICATIONS OF THE FINDINGS: Embryo selection is a key element in IVF success and continues to be a challenge. Improving the predictive ability could assist in optimizing implantation success rates and other clinical outcomes and could minimize the financial and emotional burden on the patient. This study demonstrates moderate agreement rates between embryologists, likely due to the subjective nature of embryo assessment. In particular, we found that average embryologist accuracy and agreement were significantly lower for fair quality embryos when compared with that for top and poor quality embryos. Using data-driven algorithms as an assistive tool may help IVF professionals increase success rates and promote much needed standardization in the IVF clinic. Our results indicate a need for further research regarding technological advancement in this field."}],"date_created":"2024-10-08T12:53:20Z","OA_place":"publisher","publication_identifier":{"issn":["0268-1161"],"eissn":["1460-2350"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","OA_type":"free access","status":"public","year":"2022","issue":"10","date_published":"2022-10-01T00:00:00Z","article_type":"original","month":"10","publication_status":"published","date_updated":"2024-10-14T09:54:40Z","publisher":"Oxford University Press","oa":1,"article_processing_charge":"No"},{"doi":"10.1007/978-3-031-05616-1_3","editor":[{"last_name":"Sauna","first_name":"Zuben E.","full_name":"Sauna, Zuben E."},{"full_name":"Kimchi-Sarfaty, Chava","first_name":"Chava","last_name":"Kimchi-Sarfaty"}],"_id":"18223","quality_controlled":"1","page":"37-47","status":"public","year":"2022","author":[{"last_name":"Rosenberg","first_name":"Aviv A.","full_name":"Rosenberg, Aviv A."},{"last_name":"Bronstein","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","first_name":"Alexander"},{"last_name":"Marx","full_name":"Marx, Ailie","first_name":"Ailie"}],"citation":{"short":"A.A. Rosenberg, A.M. Bronstein, A. Marx, in:, Z.E. Sauna, C. Kimchi-Sarfaty (Eds.), Single Nucleotide Polymorphisms, Springer Nature, Cham, 2022, pp. 37–47.","chicago":"Rosenberg, Aviv A., Alex M. Bronstein, and Ailie Marx. “Recording Silence – Accurate Annotation of the Genetic Sequence Is Required to Better Understand How Synonymous Coding Affects Protein Structure and Disease.” In <i>Single Nucleotide Polymorphisms</i>, edited by Zuben E. Sauna and Chava Kimchi-Sarfaty, 37–47. Cham: Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-05616-1_3\">https://doi.org/10.1007/978-3-031-05616-1_3</a>.","ista":"Rosenberg AA, Bronstein AM, Marx A. 2022.Recording Silence – Accurate Annotation of the Genetic Sequence Is Required to Better Understand How Synonymous Coding Affects Protein Structure and Disease. In: Single Nucleotide Polymorphisms. , 37–47.","ama":"Rosenberg AA, Bronstein AM, Marx A. Recording Silence – Accurate Annotation of the Genetic Sequence Is Required to Better Understand How Synonymous Coding Affects Protein Structure and Disease. In: Sauna ZE, Kimchi-Sarfaty C, eds. <i>Single Nucleotide Polymorphisms</i>. Cham: Springer Nature; 2022:37-47. doi:<a href=\"https://doi.org/10.1007/978-3-031-05616-1_3\">10.1007/978-3-031-05616-1_3</a>","apa":"Rosenberg, A. A., Bronstein, A. M., &#38; Marx, A. (2022). Recording Silence – Accurate Annotation of the Genetic Sequence Is Required to Better Understand How Synonymous Coding Affects Protein Structure and Disease. In Z. E. Sauna &#38; C. Kimchi-Sarfaty (Eds.), <i>Single Nucleotide Polymorphisms</i> (pp. 37–47). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-05616-1_3\">https://doi.org/10.1007/978-3-031-05616-1_3</a>","mla":"Rosenberg, Aviv A., et al. “Recording Silence – Accurate Annotation of the Genetic Sequence Is Required to Better Understand How Synonymous Coding Affects Protein Structure and Disease.” <i>Single Nucleotide Polymorphisms</i>, edited by Zuben E. Sauna and Chava Kimchi-Sarfaty, Springer Nature, 2022, pp. 37–47, doi:<a href=\"https://doi.org/10.1007/978-3-031-05616-1_3\">10.1007/978-3-031-05616-1_3</a>.","ieee":"A. A. Rosenberg, A. M. Bronstein, and A. Marx, “Recording Silence – Accurate Annotation of the Genetic Sequence Is Required to Better Understand How Synonymous Coding Affects Protein Structure and Disease,” in <i>Single Nucleotide Polymorphisms</i>, Z. E. Sauna and C. Kimchi-Sarfaty, Eds. Cham: Springer Nature, 2022, pp. 37–47."},"oa_version":"None","OA_type":"closed access","publication_identifier":{"isbn":["9783031056147"],"eisbn":["9783031056161"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"book_chapter","place":"Cham","publication":"Single Nucleotide Polymorphisms","article_processing_charge":"No","abstract":[{"text":"The term silent mutation is commonly used to describe (1) a change in the DNA sequence that does not result in an observable effect on the organism’s phenotype; and (2) a synonymous mutation where the nucleotide change leaves the translated amino acid sequence unchanged. When Christian Anfinsen showed that a folded and active protein could be denatured to lose structure and activity and then subsequently renatured to regain the same structure and activity it appeared that the native, thermodynamically stable, structure of a protein depends only on the amino acid sequence and solution conditions (Anfinsen and Haber 1961). This experiment suggested that, once translated, proteins carry no memory of the genetic sequence and led to one of the most erroneous assumptions in modern science; synonymous codons were long considered silent, a mutation of the type that has no effect on an organism’s phenotype.","lang":"eng"}],"day":"10","date_created":"2024-10-08T12:53:44Z","title":"Recording Silence – Accurate Annotation of the Genetic Sequence Is Required to Better Understand How Synonymous Coding Affects Protein Structure and Disease","language":[{"iso":"eng"}],"publisher":"Springer Nature","date_published":"2022-08-10T00:00:00Z","month":"08","scopus_import":"1","extern":"1","date_updated":"2024-10-14T09:58:21Z","publication_status":"published"},{"oa":1,"article_processing_charge":"No","article_type":"original","date_published":"2022-08-01T00:00:00Z","month":"08","publication_status":"published","date_updated":"2024-10-14T10:58:20Z","publisher":"Elsevier","status":"public","year":"2022","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","publication_identifier":{"issn":["0167-8655"]},"oa_version":"Preprint","volume":160,"title":"Baby steps towards few-shot learning with multiple semantics","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1906.01905"}],"abstract":[{"text":"Learning from one or few visual examples is one of the key capabilities of humans since early infancy, but is still a significant challenge for modern AI systems. While considerable progress has been achieved in few-shot learning from a few image examples, much less attention has been given to the verbal descriptions that are usually provided to infants when they are presented with a new object. In this paper, we focus on the role of additional semantics that can significantly facilitate few-shot visual learning. Building upon recent advances in few-shot learning with additional semantic information, we demonstrate that further improvements are possible by combining multiple and richer semantics (category labels, attributes, and natural language descriptions). Using these ideas, we offer the community new results on the popular miniImageNet and CUB few-shot benchmarks, comparing favorably to the previous state-of-the-art results for both visual only and visual plus semantics-based approaches. We also performed an ablation study investigating the components and design choices of our approach. Code available on github.com/EliSchwartz/mutiple-semantics.","lang":"eng"}],"day":"01","date_created":"2024-10-08T12:54:03Z","scopus_import":"1","extern":"1","page":"142-147","author":[{"full_name":"Schwartz, Eli","first_name":"Eli","last_name":"Schwartz"},{"first_name":"Leonid","full_name":"Karlinsky, Leonid","last_name":"Karlinsky"},{"full_name":"Feris, Rogerio","first_name":"Rogerio","last_name":"Feris"},{"full_name":"Giryes, Raja","first_name":"Raja","last_name":"Giryes"},{"last_name":"Bronstein","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","first_name":"Alexander"}],"quality_controlled":"1","doi":"10.1016/j.patrec.2022.06.012","_id":"18224","type":"journal_article","publication":"Pattern Recognition Letters","arxiv":1,"intvolume":"       160","citation":{"ista":"Schwartz E, Karlinsky L, Feris R, Giryes R, Bronstein AM. 2022. Baby steps towards few-shot learning with multiple semantics. Pattern Recognition Letters. 160, 142–147.","short":"E. Schwartz, L. Karlinsky, R. Feris, R. Giryes, A.M. Bronstein, Pattern Recognition Letters 160 (2022) 142–147.","chicago":"Schwartz, Eli, Leonid Karlinsky, Rogerio Feris, Raja Giryes, and Alex M. Bronstein. “Baby Steps towards Few-Shot Learning with Multiple Semantics.” <i>Pattern Recognition Letters</i>. Elsevier, 2022. <a href=\"https://doi.org/10.1016/j.patrec.2022.06.012\">https://doi.org/10.1016/j.patrec.2022.06.012</a>.","mla":"Schwartz, Eli, et al. “Baby Steps towards Few-Shot Learning with Multiple Semantics.” <i>Pattern Recognition Letters</i>, vol. 160, Elsevier, 2022, pp. 142–47, doi:<a href=\"https://doi.org/10.1016/j.patrec.2022.06.012\">10.1016/j.patrec.2022.06.012</a>.","ieee":"E. Schwartz, L. Karlinsky, R. Feris, R. Giryes, and A. M. Bronstein, “Baby steps towards few-shot learning with multiple semantics,” <i>Pattern Recognition Letters</i>, vol. 160. Elsevier, pp. 142–147, 2022.","ama":"Schwartz E, Karlinsky L, Feris R, Giryes R, Bronstein AM. Baby steps towards few-shot learning with multiple semantics. <i>Pattern Recognition Letters</i>. 2022;160:142-147. doi:<a href=\"https://doi.org/10.1016/j.patrec.2022.06.012\">10.1016/j.patrec.2022.06.012</a>","apa":"Schwartz, E., Karlinsky, L., Feris, R., Giryes, R., &#38; Bronstein, A. M. (2022). Baby steps towards few-shot learning with multiple semantics. <i>Pattern Recognition Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.patrec.2022.06.012\">https://doi.org/10.1016/j.patrec.2022.06.012</a>"},"external_id":{"arxiv":["1906.01905"]}},{"status":"public","year":"2022","oa_version":"Published Version","publication_identifier":{"issn":["0262-8856"]},"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","article_number":"104461","oa":1,"publisher":"Elsevier","date_updated":"2024-10-14T11:03:26Z","publication_status":"published","article_type":"original","date_published":"2022-07-01T00:00:00Z","month":"07","_id":"18225","doi":"10.1016/j.imavis.2022.104461","quality_controlled":"1","author":[{"last_name":"Pai","first_name":"Gautam","full_name":"Pai, Gautam"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730"},{"last_name":"Talmon","full_name":"Talmon, Ronen","first_name":"Ronen"},{"last_name":"Kimmel","full_name":"Kimmel, Ron","first_name":"Ron"}],"citation":{"apa":"Pai, G., Bronstein, A. M., Talmon, R., &#38; Kimmel, R. (2022). Deep isometric maps. <i>Image and Vision Computing</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.imavis.2022.104461\">https://doi.org/10.1016/j.imavis.2022.104461</a>","ama":"Pai G, Bronstein AM, Talmon R, Kimmel R. Deep isometric maps. <i>Image and Vision Computing</i>. 2022;123. doi:<a href=\"https://doi.org/10.1016/j.imavis.2022.104461\">10.1016/j.imavis.2022.104461</a>","mla":"Pai, Gautam, et al. “Deep Isometric Maps.” <i>Image and Vision Computing</i>, vol. 123, 104461, Elsevier, 2022, doi:<a href=\"https://doi.org/10.1016/j.imavis.2022.104461\">10.1016/j.imavis.2022.104461</a>.","ieee":"G. Pai, A. M. Bronstein, R. Talmon, and R. Kimmel, “Deep isometric maps,” <i>Image and Vision Computing</i>, vol. 123. Elsevier, 2022.","chicago":"Pai, Gautam, Alex M. Bronstein, Ronen Talmon, and Ron Kimmel. “Deep Isometric Maps.” <i>Image and Vision Computing</i>. Elsevier, 2022. <a href=\"https://doi.org/10.1016/j.imavis.2022.104461\">https://doi.org/10.1016/j.imavis.2022.104461</a>.","short":"G. Pai, A.M. Bronstein, R. Talmon, R. Kimmel, Image and Vision Computing 123 (2022).","ista":"Pai G, Bronstein AM, Talmon R, Kimmel R. 2022. Deep isometric maps. Image and Vision Computing. 123, 104461."},"intvolume":"       123","publication":"Image and Vision Computing","type":"journal_article","date_created":"2024-10-08T12:54:22Z","day":"01","abstract":[{"text":"Isometric feature mapping is an established time-honored algorithm in manifold learning and non-linear dimensionality reduction. Its prominence can be attributed to the output of a coherent global low-dimensional representation of data by preserving intrinsic distances. In order to enable an efficient and more applicable isometric feature mapping, a diverse set of sophisticated advancements have been proposed to the original algorithm to incorporate important factors like sparsity of computation, conformality, topological constraints and spectral geometry. However, a significant shortcoming of most approaches is the dependence on large-scale dense-spectral decompositions and the inability to generalize to points far away from the sampling of the manifold.\r\nIn this paper, we explore an unsupervised deep learning approach for computing distance-preserving maps for non-linear dimensionality reduction. We demonstrate that our framework is general enough to incorporate all previous advancements and show a significantly improved local and non-local generalization of the isometric mapping. Our approach involves training with only a few landmark points and avoids the need for population of dense matrices as well as computing their spectral decomposition.","lang":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1016/j.imavis.2022.104461","open_access":"1"}],"language":[{"iso":"eng"}],"title":"Deep isometric maps","volume":123,"scopus_import":"1","extern":"1"},{"OA_type":"hybrid","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2334-2536"]},"OA_place":"publisher","status":"public","year":"2022","issue":"6","publisher":"Optica Publishing Group","date_updated":"2024-10-14T11:07:29Z","publication_status":"published","date_published":"2022-06-06T00:00:00Z","month":"06","article_type":"original","article_processing_charge":"No","oa":1,"intvolume":"         9","citation":{"ista":"Rozenberg E, Karnieli A, Yesharim O, Foley-Comer J, Trajtenberg-Mills S, Freedman D, Bronstein AM, Arie A. 2022. Inverse design of spontaneous parametric downconversion for generation of high-dimensional qudits. Optica. 9(6), 602–615.","short":"E. Rozenberg, A. Karnieli, O. Yesharim, J. Foley-Comer, S. Trajtenberg-Mills, D. Freedman, A.M. Bronstein, A. Arie, Optica 9 (2022) 602–615.","chicago":"Rozenberg, Eyal, Aviv Karnieli, Ofir Yesharim, Joshua Foley-Comer, Sivan Trajtenberg-Mills, Daniel Freedman, Alex M. Bronstein, and Ady Arie. “Inverse Design of Spontaneous Parametric Downconversion for Generation of High-Dimensional Qudits.” <i>Optica</i>. Optica Publishing Group, 2022. <a href=\"https://doi.org/10.1364/optica.451115\">https://doi.org/10.1364/optica.451115</a>.","mla":"Rozenberg, Eyal, et al. “Inverse Design of Spontaneous Parametric Downconversion for Generation of High-Dimensional Qudits.” <i>Optica</i>, vol. 9, no. 6, Optica Publishing Group, 2022, pp. 602–15, doi:<a href=\"https://doi.org/10.1364/optica.451115\">10.1364/optica.451115</a>.","ieee":"E. Rozenberg <i>et al.</i>, “Inverse design of spontaneous parametric downconversion for generation of high-dimensional qudits,” <i>Optica</i>, vol. 9, no. 6. Optica Publishing Group, pp. 602–615, 2022.","ama":"Rozenberg E, Karnieli A, Yesharim O, et al. Inverse design of spontaneous parametric downconversion for generation of high-dimensional qudits. <i>Optica</i>. 2022;9(6):602-615. doi:<a href=\"https://doi.org/10.1364/optica.451115\">10.1364/optica.451115</a>","apa":"Rozenberg, E., Karnieli, A., Yesharim, O., Foley-Comer, J., Trajtenberg-Mills, S., Freedman, D., … Arie, A. (2022). Inverse design of spontaneous parametric downconversion for generation of high-dimensional qudits. <i>Optica</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/optica.451115\">https://doi.org/10.1364/optica.451115</a>"},"type":"journal_article","publication":"Optica","_id":"18226","doi":"10.1364/optica.451115","page":"602-615","author":[{"last_name":"Rozenberg","full_name":"Rozenberg, Eyal","first_name":"Eyal"},{"last_name":"Karnieli","full_name":"Karnieli, Aviv","first_name":"Aviv"},{"last_name":"Yesharim","first_name":"Ofir","full_name":"Yesharim, Ofir"},{"last_name":"Foley-Comer","full_name":"Foley-Comer, Joshua","first_name":"Joshua"},{"last_name":"Trajtenberg-Mills","full_name":"Trajtenberg-Mills, Sivan","first_name":"Sivan"},{"last_name":"Freedman","first_name":"Daniel","full_name":"Freedman, Daniel"},{"first_name":"Alexander","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","last_name":"Bronstein"},{"last_name":"Arie","full_name":"Arie, Ady","first_name":"Ady"}],"quality_controlled":"1","scopus_import":"1","extern":"1","date_created":"2024-10-08T12:54:43Z","day":"06","abstract":[{"lang":"eng","text":"Spontaneous parametric downconversion (SPDC) in quantum optics is an invaluable resource for the realization of high-dimensional qudits with spatial modes of light. One of the main open challenges is how to directly generate a desirable qudit state in the SPDC process. This problem can be addressed through advanced computational learning methods; however, due to difficulties in modeling the SPDC process by a fully differentiable algorithm, progress has been limited. Here, we overcome these limitations and introduce a physically constrained and differentiable model, validated against experimental results for shaped pump beams and structured crystals, capable of learning the relevant interaction parameters in the process. We avoid any restrictions induced by the stochastic nature of our physical model and integrate the dynamic equations governing the evolution under the SPDC Hamiltonian. We solve the inverse problem of designing a nonlinear quantum optical system that achieves the desired quantum state of downconverted photon pairs. The desired states are defined using either the second-order correlations between different spatial modes or by specifying the required density matrix. By learning nonlinear photonic crystal structures as well as different pump shapes, we successfully show how to generate maximally entangled states. Furthermore, we simulate all-optical coherent control over the generated quantum state by actively changing the profile of the pump beam. Our work can be useful for applications such as novel designs of high-dimensional quantum key distribution and quantum information processing protocols. In addition, our method can be readily applied for controlling other degrees of freedom of light in the SPDC process, such as spectral and temporal properties, and may even be used in condensed-matter systems having a similar interaction Hamiltonian."}],"volume":9,"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1364/OPTICA.451115","open_access":"1"}],"title":"Inverse design of spontaneous parametric downconversion for generation of high-dimensional qudits"},{"day":"01","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Existing cross-modal hashing methods ignore the informative multimodal joint information and cannot fully exploit the semantic labels. In this paper, we propose a deep fused two-step cross-modal hashing (DFTH) framework with multiple semantic supervision. In the first step, DFTH learns unified hash codes for instances by a fusion network. Semantic label and similarity reconstruction have been introduced to acquire binary codes that are informative, discriminative and semantic similarity preserving. In the second step, two modality-specific hash networks are learned under the supervision of common hash codes reconstruction, label reconstruction, and intra-modal and inter-modal semantic similarity reconstruction. The modality-specific hash networks can generate semantic preserving binary codes for out-of-sample queries. To deal with the vanishing gradients of binarization, continuous differentiable tanh is introduced to approximate the discrete sign function, making the networks able to back-propagate by automatic gradient computation. Extensive experiments on MIRFlickr25K and NUS-WIDE show the superiority of DFTH over state-of-the-art methods."}],"date_created":"2024-10-08T12:55:04Z","volume":81,"title":"Deep fused two-step cross-modal hashing with multiple semantic supervision","language":[{"iso":"eng"}],"publisher":"Springer Nature","date_published":"2022-05-01T00:00:00Z","month":"05","article_type":"original","publication_status":"published","date_updated":"2024-10-14T11:10:00Z","extern":"1","scopus_import":"1","doi":"10.1007/s11042-022-12187-6","_id":"18227","author":[{"full_name":"Kang, Peipei","first_name":"Peipei","last_name":"Kang"},{"last_name":"Lin","full_name":"Lin, Zehang","first_name":"Zehang"},{"first_name":"Zhenguo","full_name":"Yang, Zhenguo","last_name":"Yang"},{"first_name":"Alexander","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","last_name":"Bronstein"},{"last_name":"Li","first_name":"Qing","full_name":"Li, Qing"},{"first_name":"Wenyin","full_name":"Liu, Wenyin","last_name":"Liu"}],"year":"2022","status":"public","page":"15653-15670","issue":"11","quality_controlled":"1","intvolume":"        81","citation":{"ista":"Kang P, Lin Z, Yang Z, Bronstein AM, Li Q, Liu W. 2022. Deep fused two-step cross-modal hashing with multiple semantic supervision. Multimedia Tools and Applications. 81(11), 15653–15670.","chicago":"Kang, Peipei, Zehang Lin, Zhenguo Yang, Alex M. Bronstein, Qing Li, and Wenyin Liu. “Deep Fused Two-Step Cross-Modal Hashing with Multiple Semantic Supervision.” <i>Multimedia Tools and Applications</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s11042-022-12187-6\">https://doi.org/10.1007/s11042-022-12187-6</a>.","short":"P. Kang, Z. Lin, Z. Yang, A.M. Bronstein, Q. Li, W. Liu, Multimedia Tools and Applications 81 (2022) 15653–15670.","ieee":"P. Kang, Z. Lin, Z. Yang, A. M. Bronstein, Q. Li, and W. Liu, “Deep fused two-step cross-modal hashing with multiple semantic supervision,” <i>Multimedia Tools and Applications</i>, vol. 81, no. 11. Springer Nature, pp. 15653–15670, 2022.","mla":"Kang, Peipei, et al. “Deep Fused Two-Step Cross-Modal Hashing with Multiple Semantic Supervision.” <i>Multimedia Tools and Applications</i>, vol. 81, no. 11, Springer Nature, 2022, pp. 15653–70, doi:<a href=\"https://doi.org/10.1007/s11042-022-12187-6\">10.1007/s11042-022-12187-6</a>.","apa":"Kang, P., Lin, Z., Yang, Z., Bronstein, A. M., Li, Q., &#38; Liu, W. (2022). Deep fused two-step cross-modal hashing with multiple semantic supervision. <i>Multimedia Tools and Applications</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11042-022-12187-6\">https://doi.org/10.1007/s11042-022-12187-6</a>","ama":"Kang P, Lin Z, Yang Z, Bronstein AM, Li Q, Liu W. Deep fused two-step cross-modal hashing with multiple semantic supervision. <i>Multimedia Tools and Applications</i>. 2022;81(11):15653-15670. doi:<a href=\"https://doi.org/10.1007/s11042-022-12187-6\">10.1007/s11042-022-12187-6</a>"},"oa_version":"None","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Multimedia Tools and Applications","publication_identifier":{"eissn":["1573-7721"],"issn":["1380-7501"]}},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031198205"],"eissn":["1611-3349"],"eisbn":["9783031198212"]},"alternative_title":["LNCS"],"oa_version":"None","status":"public","year":"2022","date_published":"2022-10-23T00:00:00Z","month":"10","publication_status":"published","date_updated":"2024-10-15T07:04:39Z","publisher":"Springer Nature","oa":1,"conference":{"end_date":"2022-10-27","location":"Tel Aviv, Israel","start_date":"2022-10-23","name":"ECCV: European Conference on Computer Vision"},"article_processing_charge":"No","publication":"17th European Conference on Computer Vision","type":"conference","arxiv":1,"intvolume":"     13691","citation":{"mla":"Amrani, Elad, et al. “Self-Supervised Classification Network.” <i>17th European Conference on Computer Vision</i>, vol. 13691, Springer Nature, 2022, pp. 116–32, doi:<a href=\"https://doi.org/10.1007/978-3-031-19821-2_7\">10.1007/978-3-031-19821-2_7</a>.","ieee":"E. Amrani, L. Karlinsky, and A. M. Bronstein, “Self-supervised classification network,” in <i>17th European Conference on Computer Vision</i>, Tel Aviv, Israel, 2022, vol. 13691, pp. 116–132.","ama":"Amrani E, Karlinsky L, Bronstein AM. Self-supervised classification network. In: <i>17th European Conference on Computer Vision</i>. Vol 13691. Springer Nature; 2022:116-132. doi:<a href=\"https://doi.org/10.1007/978-3-031-19821-2_7\">10.1007/978-3-031-19821-2_7</a>","apa":"Amrani, E., Karlinsky, L., &#38; Bronstein, A. M. (2022). Self-supervised classification network. In <i>17th European Conference on Computer Vision</i> (Vol. 13691, pp. 116–132). Tel Aviv, Israel: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-19821-2_7\">https://doi.org/10.1007/978-3-031-19821-2_7</a>","ista":"Amrani E, Karlinsky L, Bronstein AM. 2022. Self-supervised classification network. 17th European Conference on Computer Vision. ECCV: European Conference on Computer Vision, LNCS, vol. 13691, 116–132.","short":"E. Amrani, L. Karlinsky, A.M. Bronstein, in:, 17th European Conference on Computer Vision, Springer Nature, 2022, pp. 116–132.","chicago":"Amrani, Elad, Leonid Karlinsky, and Alex M. Bronstein. “Self-Supervised Classification Network.” In <i>17th European Conference on Computer Vision</i>, 13691:116–32. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-19821-2_7\">https://doi.org/10.1007/978-3-031-19821-2_7</a>."},"external_id":{"arxiv":["2103.10994"]},"author":[{"full_name":"Amrani, Elad","first_name":"Elad","last_name":"Amrani"},{"first_name":"Leonid","full_name":"Karlinsky, Leonid","last_name":"Karlinsky"},{"orcid":"0000-0001-9699-8730","last_name":"Bronstein","first_name":"Alexander","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"}],"page":"116-132","quality_controlled":"1","doi":"10.1007/978-3-031-19821-2_7","_id":"18229","extern":"1","scopus_import":"1","volume":13691,"title":"Self-supervised classification network","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2103.10994"}],"related_material":{"link":[{"url":"https://github.com/elad-amrani/self-classifier","relation":"software"}]},"day":"23","abstract":[{"text":"We present Self-Classifier – a novel self-supervised end-to-end classification learning approach. Self-Classifier learns labels and representations simultaneously in a single-stage end-to-end manner by optimizing for same-class prediction of two augmented views of the same sample. To guarantee non-degenerate solutions (i.e., solutions where all labels are assigned to the same class) we propose a mathematically motivated variant of the cross-entropy loss that has a uniform prior asserted on the predicted labels. In our theoretical analysis, we prove that degenerate solutions are not in the set of optimal solutions of our approach. Self-Classifier is simple to implement and scalable. Unlike other popular unsupervised classification and contrastive representation learning approaches, it does not require any form of pre-training, expectation-maximization, pseudo-labeling, external clustering, a second network, stop-gradient operation, or negative pairs. Despite its simplicity, our approach sets a new state of the art for unsupervised classification of ImageNet; and even achieves comparable to state-of-the-art results for unsupervised representation learning. Code is available at https://github.com/elad-amrani/self-classifier.","lang":"eng"}],"date_created":"2024-10-08T12:55:44Z"},{"oa_version":"None","citation":{"ista":"Talati N, Ye H, Vedula S, Chen K-Y, Chen Y, Liu D, Yuan Y, Blaauw D, Bronstein AM, Mudge T, Dreslinski R. 2022. Mint: An accelerator for mining temporal motifs. 55th IEEE/ACM International Symposium on Microarchitecture. MICRO: Symposium on Microarchitecture.","short":"N. Talati, H. Ye, S. Vedula, K.-Y. Chen, Y. Chen, D. Liu, Y. Yuan, D. Blaauw, A.M. Bronstein, T. Mudge, R. Dreslinski, in:, 55th IEEE/ACM International Symposium on Microarchitecture, Institute of Electrical and Electronics Engineers, 2022.","chicago":"Talati, Nishil, Haojie Ye, Sanketh Vedula, Kuan-Yu Chen, Yuhan Chen, Daniel Liu, Yichao Yuan, et al. “Mint: An Accelerator for Mining Temporal Motifs.” In <i>55th IEEE/ACM International Symposium on Microarchitecture</i>. Institute of Electrical and Electronics Engineers, 2022. <a href=\"https://doi.org/10.1109/micro56248.2022.00089\">https://doi.org/10.1109/micro56248.2022.00089</a>.","mla":"Talati, Nishil, et al. “Mint: An Accelerator for Mining Temporal Motifs.” <i>55th IEEE/ACM International Symposium on Microarchitecture</i>, Institute of Electrical and Electronics Engineers, 2022, doi:<a href=\"https://doi.org/10.1109/micro56248.2022.00089\">10.1109/micro56248.2022.00089</a>.","ieee":"N. Talati <i>et al.</i>, “Mint: An accelerator for mining temporal motifs,” in <i>55th IEEE/ACM International Symposium on Microarchitecture</i>, Chicago, IL, United States, 2022.","ama":"Talati N, Ye H, Vedula S, et al. Mint: An accelerator for mining temporal motifs. In: <i>55th IEEE/ACM International Symposium on Microarchitecture</i>. Institute of Electrical and Electronics Engineers; 2022. doi:<a href=\"https://doi.org/10.1109/micro56248.2022.00089\">10.1109/micro56248.2022.00089</a>","apa":"Talati, N., Ye, H., Vedula, S., Chen, K.-Y., Chen, Y., Liu, D., … Dreslinski, R. (2022). Mint: An accelerator for mining temporal motifs. In <i>55th IEEE/ACM International Symposium on Microarchitecture</i>. Chicago, IL, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/micro56248.2022.00089\">https://doi.org/10.1109/micro56248.2022.00089</a>"},"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"55th IEEE/ACM International Symposium on Microarchitecture","publication_identifier":{"eisbn":["9781665462723"]},"_id":"18230","doi":"10.1109/micro56248.2022.00089","author":[{"last_name":"Talati","full_name":"Talati, Nishil","first_name":"Nishil"},{"first_name":"Haojie","full_name":"Ye, Haojie","last_name":"Ye"},{"last_name":"Vedula","full_name":"Vedula, Sanketh","first_name":"Sanketh"},{"first_name":"Kuan-Yu","full_name":"Chen, Kuan-Yu","last_name":"Chen"},{"last_name":"Chen","full_name":"Chen, Yuhan","first_name":"Yuhan"},{"last_name":"Liu","first_name":"Daniel","full_name":"Liu, Daniel"},{"last_name":"Yuan","full_name":"Yuan, Yichao","first_name":"Yichao"},{"last_name":"Blaauw","first_name":"David","full_name":"Blaauw, David"},{"full_name":"Bronstein, Alexander","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","last_name":"Bronstein"},{"last_name":"Mudge","full_name":"Mudge, Trevor","first_name":"Trevor"},{"full_name":"Dreslinski, Ronald","first_name":"Ronald","last_name":"Dreslinski"}],"year":"2022","status":"public","quality_controlled":"1","publisher":"Institute of Electrical and Electronics Engineers","publication_status":"published","extern":"1","scopus_import":"1","date_updated":"2024-10-15T07:14:02Z","date_published":"2022-10-01T00:00:00Z","month":"10","conference":{"start_date":"2022-10-01","name":"MICRO: Symposium on Microarchitecture","end_date":"2022-10-05","location":"Chicago, IL, United States"},"date_created":"2024-10-08T12:56:03Z","day":"01","article_processing_charge":"No","abstract":[{"lang":"eng","text":"A variety of complex systems, including social and communication networks, financial markets, biology, and neuroscience are modeled using temporal graphs that contain a set of nodes and directed timestamped edges. Temporal motifs in temporal graphs are generalized from subgraph patterns in static graphs in that they also account for edge ordering and time duration, in addition to the graph structure. Mining temporal motifs is a fundamental problem used in several application domains. However, existing software frameworks offer suboptimal performance due to high algorithmic complexity and irregular memory accesses of temporal motif mining.This paper presents Mint—a novel accelerator architecture and a programming model for mining temporal motifs efficiently. We first divide this workload into three fundamental tasks: search, book-keeping, and backtracking. Based on this, we propose a task-centric programming model that enables decoupled, asynchronous execution. This model unlocks massive opportunities for parallelism, and allows storing task context information on-chip. To best utilize the proposed programming model, we design a domain-specific hardware accelerator using its data path and memory subsystem design to cater to the unique workload characteristics of temporal motif mining. To further improve performance, we propose a novel optimization called search index memoization that significantly reduces memory traffic. We comprehensively compare the performance of Mint with state-of-the-art temporal motif mining software frameworks (both approximate and exact) running on both CPU and GPU, and show 9×−2576× benefit in performance."}],"language":[{"iso":"eng"}],"title":"Mint: An accelerator for mining temporal motifs"},{"title":"Contrast to divide: Self-supervised pre-training for learning with noisy labels","related_material":{"link":[{"url":"https://github.com/ContrastToDivide/C2D","relation":"software"}]},"language":[{"iso":"eng"}],"day":"15","abstract":[{"lang":"eng","text":"The success of learning with noisy labels (LNL) methods relies heavily on the success of a warm-up stage where standard supervised training is performed using the full (noisy) training set. In this paper, we identify a \"warm-up obstacle\": the inability of standard warm-up stages to train high quality feature extractors and avert memorization of noisy labels. We propose \"Contrast to Divide\" (C2D), a simple framework that solves this problem by pre-training the feature extractor in a self-supervised fashion. Using self-supervised pre-training boosts the performance of existing LNL approaches by drastically reducing the warm-up stage's susceptibility to noise level, shortening its duration, and improving extracted feature quality. C2D works out of the box with existing methods and demonstrates markedly improved performance, especially in the high noise regime, where we get a boost of more than 27% for CIFAR-100 with 90% noise over the previous state of the art. In real-life noise settings, C2D trained on mini-WebVision outperforms previous works both in WebVision and ImageNet validation sets by 3% top-1 accuracy. We perform an in-depth analysis of the framework, including investigating the performance of different pre-training approaches and estimating the effective upper bound of the LNL performance with semi-supervised learning. Code for reproducing our experiments is available at https://github.com/ContrastToDivide/C2D."}],"date_created":"2024-10-08T12:56:20Z","extern":"1","scopus_import":"1","quality_controlled":"1","page":"387-397","author":[{"last_name":"Zheltonozhskii","full_name":"Zheltonozhskii, Evgenii","first_name":"Evgenii"},{"last_name":"Baskin","full_name":"Baskin, Chaim","first_name":"Chaim"},{"last_name":"Mendelson","full_name":"Mendelson, Avi","first_name":"Avi"},{"full_name":"Bronstein, Alexander","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","last_name":"Bronstein"},{"last_name":"Litany","first_name":"Or","full_name":"Litany, Or"}],"doi":"10.1109/wacv51458.2022.00046","_id":"18231","type":"conference","publication":"IEEE/CVF Winter Conference on Applications of Computer Vision","citation":{"ieee":"E. Zheltonozhskii, C. Baskin, A. Mendelson, A. M. Bronstein, and O. Litany, “Contrast to divide: Self-supervised pre-training for learning with noisy labels,” in <i>IEEE/CVF Winter Conference on Applications of Computer Vision</i>, Waikoloa, HI, United States, 2022, pp. 387–397.","mla":"Zheltonozhskii, Evgenii, et al. “Contrast to Divide: Self-Supervised Pre-Training for Learning with Noisy Labels.” <i>IEEE/CVF Winter Conference on Applications of Computer Vision</i>, Institute of Electrical and Electronics Engineers, 2022, pp. 387–97, doi:<a href=\"https://doi.org/10.1109/wacv51458.2022.00046\">10.1109/wacv51458.2022.00046</a>.","apa":"Zheltonozhskii, E., Baskin, C., Mendelson, A., Bronstein, A. M., &#38; Litany, O. (2022). Contrast to divide: Self-supervised pre-training for learning with noisy labels. In <i>IEEE/CVF Winter Conference on Applications of Computer Vision</i> (pp. 387–397). Waikoloa, HI, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/wacv51458.2022.00046\">https://doi.org/10.1109/wacv51458.2022.00046</a>","ama":"Zheltonozhskii E, Baskin C, Mendelson A, Bronstein AM, Litany O. Contrast to divide: Self-supervised pre-training for learning with noisy labels. In: <i>IEEE/CVF Winter Conference on Applications of Computer Vision</i>. Institute of Electrical and Electronics Engineers; 2022:387-397. doi:<a href=\"https://doi.org/10.1109/wacv51458.2022.00046\">10.1109/wacv51458.2022.00046</a>","ista":"Zheltonozhskii E, Baskin C, Mendelson A, Bronstein AM, Litany O. 2022. Contrast to divide: Self-supervised pre-training for learning with noisy labels. IEEE/CVF Winter Conference on Applications of Computer Vision. WACV: Winter Conference on Applications of Computer Vision, 387–397.","chicago":"Zheltonozhskii, Evgenii, Chaim Baskin, Avi Mendelson, Alex M. Bronstein, and Or Litany. “Contrast to Divide: Self-Supervised Pre-Training for Learning with Noisy Labels.” In <i>IEEE/CVF Winter Conference on Applications of Computer Vision</i>, 387–97. Institute of Electrical and Electronics Engineers, 2022. <a href=\"https://doi.org/10.1109/wacv51458.2022.00046\">https://doi.org/10.1109/wacv51458.2022.00046</a>.","short":"E. Zheltonozhskii, C. Baskin, A. Mendelson, A.M. Bronstein, O. Litany, in:, IEEE/CVF Winter Conference on Applications of Computer Vision, Institute of Electrical and Electronics Engineers, 2022, pp. 387–397."},"external_id":{"arxiv":["2103.13646"]},"arxiv":1,"article_processing_charge":"No","conference":{"start_date":"2022-01-03","name":"WACV: Winter Conference on Applications of Computer Vision","end_date":"2022-01-08","location":"Waikoloa, HI, United States"},"date_published":"2022-02-15T00:00:00Z","month":"02","date_updated":"2024-10-15T07:27:12Z","publication_status":"published","publisher":"Institute of Electrical and Electronics Engineers","year":"2022","status":"public","OA_place":"repository","publication_identifier":{"eisbn":["9781665409155"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","OA_type":"green"},{"language":[{"iso":"eng"}],"title":"Intra-class low-rank regularization for supervised and semi-supervised cross-modal retrieval","volume":52,"date_created":"2024-10-08T12:56:38Z","abstract":[{"lang":"eng","text":"Cross-modal retrieval aims to retrieve related items across different modalities, for example, using an image query to retrieve related text. The existing deep methods ignore both the intra-modal and inter-modal intra-class low-rank structures when fusing various modalities, which decreases the retrieval performance. In this paper, two deep models (denoted as ILCMR and Semi-ILCMR) based on intra-class low-rank regularization are proposed for supervised and semi-supervised cross-modal retrieval, respectively. Specifically, ILCMR integrates the image network and text network into a unified framework to learn a common feature space by imposing three regularization terms to fuse the cross-modal data. First, to align them in the label space, we utilize semantic consistency regularization to convert the data representations to probability distributions over the classes. Second, we introduce an intra-modal low-rank regularization, which encourages the intra-class samples that originate from the same space to be more relevant in the common feature space. Third, an inter-modal low-rank regularization is applied to reduce the cross-modal discrepancy. To enable the low-rank regularization to be optimized using automatic gradients during network back-propagation, we propose the rank-r approximation and specify the explicit gradients for theoretical completeness. In addition to the three regularization terms that rely on label information incorporated by ILCMR, we propose Semi-ILCMR in the semi-supervised regime, which introduces a low-rank constraint before projecting the general representations into the common feature space. Extensive experiments on four public cross-modal datasets demonstrate the superiority of ILCMR and Semi-ILCMR over other state-of-the-art methods."}],"article_processing_charge":"No","day":"01","date_updated":"2024-10-15T07:30:00Z","publication_status":"published","scopus_import":"1","extern":"1","date_published":"2022-01-01T00:00:00Z","month":"01","article_type":"original","publisher":"Springer Nature","quality_controlled":"1","year":"2022","page":"33-54","author":[{"last_name":"Kang","first_name":"Peipei","full_name":"Kang, Peipei"},{"first_name":"Zehang","full_name":"Lin, Zehang","last_name":"Lin"},{"first_name":"Zhenguo","full_name":"Yang, Zhenguo","last_name":"Yang"},{"first_name":"Xiaozhao","full_name":"Fang, Xiaozhao","last_name":"Fang"},{"orcid":"0000-0001-9699-8730","last_name":"Bronstein","full_name":"Bronstein, Alexander","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"first_name":"Qing","full_name":"Li, Qing","last_name":"Li"},{"full_name":"Liu, Wenyin","first_name":"Wenyin","last_name":"Liu"}],"status":"public","_id":"18232","doi":"10.1007/s10489-021-02308-3","publication_identifier":{"eissn":["1573-7497"],"issn":["0924-669X"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","publication":"Applied Intelligence","oa_version":"None","citation":{"apa":"Kang, P., Lin, Z., Yang, Z., Fang, X., Bronstein, A. M., Li, Q., &#38; Liu, W. (2022). Intra-class low-rank regularization for supervised and semi-supervised cross-modal retrieval. <i>Applied Intelligence</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10489-021-02308-3\">https://doi.org/10.1007/s10489-021-02308-3</a>","ama":"Kang P, Lin Z, Yang Z, et al. Intra-class low-rank regularization for supervised and semi-supervised cross-modal retrieval. <i>Applied Intelligence</i>. 2022;52:33-54. doi:<a href=\"https://doi.org/10.1007/s10489-021-02308-3\">10.1007/s10489-021-02308-3</a>","mla":"Kang, Peipei, et al. “Intra-Class Low-Rank Regularization for Supervised and Semi-Supervised Cross-Modal Retrieval.” <i>Applied Intelligence</i>, vol. 52, Springer Nature, 2022, pp. 33–54, doi:<a href=\"https://doi.org/10.1007/s10489-021-02308-3\">10.1007/s10489-021-02308-3</a>.","ieee":"P. Kang <i>et al.</i>, “Intra-class low-rank regularization for supervised and semi-supervised cross-modal retrieval,” <i>Applied Intelligence</i>, vol. 52. Springer Nature, pp. 33–54, 2022.","chicago":"Kang, Peipei, Zehang Lin, Zhenguo Yang, Xiaozhao Fang, Alex M. Bronstein, Qing Li, and Wenyin Liu. “Intra-Class Low-Rank Regularization for Supervised and Semi-Supervised Cross-Modal Retrieval.” <i>Applied Intelligence</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s10489-021-02308-3\">https://doi.org/10.1007/s10489-021-02308-3</a>.","short":"P. Kang, Z. Lin, Z. Yang, X. Fang, A.M. Bronstein, Q. Li, W. Liu, Applied Intelligence 52 (2022) 33–54.","ista":"Kang P, Lin Z, Yang Z, Fang X, Bronstein AM, Li Q, Liu W. 2022. Intra-class low-rank regularization for supervised and semi-supervised cross-modal retrieval. Applied Intelligence. 52, 33–54."},"intvolume":"        52"},{"type":"research_data","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"oa_version":"None","citation":{"ista":"Katsaros G, Jirovec D. 2022. Dynamics of Hole Singlet-Triplet Qubits with Large 𝑔-Factor Differences, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:18291\">10.15479/AT:ISTA:18291</a>.","short":"G. Katsaros, D. Jirovec, (2022).","chicago":"Katsaros, Georgios, and Daniel Jirovec. “Dynamics of Hole Singlet-Triplet Qubits with Large 𝑔-Factor Differences.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/AT:ISTA:18291\">https://doi.org/10.15479/AT:ISTA:18291</a>.","mla":"Katsaros, Georgios, and Daniel Jirovec. <i>Dynamics of Hole Singlet-Triplet Qubits with Large 𝑔-Factor Differences</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:18291\">10.15479/AT:ISTA:18291</a>.","ieee":"G. Katsaros and D. Jirovec, “Dynamics of Hole Singlet-Triplet Qubits with Large 𝑔-Factor Differences.” Institute of Science and Technology Austria, 2022.","ama":"Katsaros G, Jirovec D. Dynamics of Hole Singlet-Triplet Qubits with Large 𝑔-Factor Differences. 2022. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:18291\">10.15479/AT:ISTA:18291</a>","apa":"Katsaros, G., &#38; Jirovec, D. (2022). Dynamics of Hole Singlet-Triplet Qubits with Large 𝑔-Factor Differences. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:18291\">https://doi.org/10.15479/AT:ISTA:18291</a>"},"file":[{"file_id":"18292","relation":"main_file","file_name":"SOIPaper.zip","date_created":"2024-10-09T19:31:35Z","date_updated":"2024-10-09T19:31:35Z","success":1,"creator":"gkatsaro","access_level":"open_access","file_size":25566516,"content_type":"application/x-zip-compressed","checksum":"3128dffbd09267b93c2d0b1425fd3ba2"},{"relation":"main_file","date_created":"2024-10-14T18:11:45Z","file_name":"Readme.txt","file_id":"18442","success":1,"access_level":"open_access","content_type":"text/plain","file_size":6776,"checksum":"df077d2f4652afeb3bf100068e88aa48","creator":"gkatsaro","date_updated":"2024-10-14T18:11:45Z"}],"status":"public","author":[{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","full_name":"Katsaros, Georgios","last_name":"Katsaros","orcid":"0000-0001-8342-202X"},{"last_name":"Jirovec","orcid":"0000-0002-7197-4801","id":"4C473F58-F248-11E8-B48F-1D18A9856A87","full_name":"Jirovec, Daniel","first_name":"Daniel"}],"year":"2022","corr_author":"1","has_accepted_license":"1","_id":"18291","doi":"10.15479/AT:ISTA:18291","date_updated":"2025-04-15T07:15:24Z","date_published":"2022-03-01T00:00:00Z","month":"03","publisher":"Institute of Science and Technology Austria","file_date_updated":"2024-10-14T18:11:45Z","oa":1,"related_material":{"record":[{"status":"public","relation":"research_paper","id":"10920"}]},"title":"Dynamics of Hole Singlet-Triplet Qubits with Large 𝑔-Factor Differences","department":[{"_id":"GeKa"}],"date_created":"2024-10-09T19:35:03Z","day":"01","article_processing_charge":"No"},{"author":[{"last_name":"Glas","first_name":"Jakob","full_name":"Glas, Jakob","id":"d6423cba-dc74-11ea-a0a7-ee61689ff5fb"},{"full_name":"Hochfilzer, Leonhard","first_name":"Leonhard","last_name":"Hochfilzer"}],"year":"2022","status":"public","_id":"18293","doi":"10.48550/arXiv.2208.05422","corr_author":"1","OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"arXiv","type":"preprint","oa_version":"Preprint","external_id":{"arxiv":["2208.05422"]},"citation":{"ista":"Glas J, Hochfilzer L. On a question of Davenport and diagonal cubic forms over Fq(t). arXiv, 2208.05422.","short":"J. Glas, L. Hochfilzer, ArXiv (n.d.).","chicago":"Glas, Jakob, and Leonhard Hochfilzer. “On a Question of Davenport and Diagonal Cubic Forms over Fq(T).” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2208.05422\">https://doi.org/10.48550/arXiv.2208.05422</a>.","mla":"Glas, Jakob, and Leonhard Hochfilzer. “On a Question of Davenport and Diagonal Cubic Forms over Fq(T).” <i>ArXiv</i>, 2208.05422, doi:<a href=\"https://doi.org/10.48550/arXiv.2208.05422\">10.48550/arXiv.2208.05422</a>.","ieee":"J. Glas and L. Hochfilzer, “On a question of Davenport and diagonal cubic forms over Fq(t),” <i>arXiv</i>. .","ama":"Glas J, Hochfilzer L. On a question of Davenport and diagonal cubic forms over Fq(t). <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2208.05422\">10.48550/arXiv.2208.05422</a>","apa":"Glas, J., &#38; Hochfilzer, L. (n.d.). On a question of Davenport and diagonal cubic forms over Fq(t). <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2208.05422\">https://doi.org/10.48550/arXiv.2208.05422</a>"},"arxiv":1,"oa":1,"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"18705","relation":"later_version","status":"public"},{"status":"public","id":"18132","relation":"dissertation_contains"}]},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2208.05422","open_access":"1"}],"title":"On a question of Davenport and diagonal cubic forms over Fq(t)","date_created":"2024-10-10T12:46:41Z","abstract":[{"lang":"eng","text":"Given a non-singular diagonal cubic hypersurface X⊂Pn−1 over Fq(t) with char(Fq)≠3, we show that the number of rational points of height at most |P| is O(|P|3+ε) for n=6 and O(|P|2+ε) for n=4. In fact, if n=4 and char(Fq)>3 we prove that the number of rational points away from any rational line contained in X is bounded by O(|P|3/2+ε). From the result in 6 variables we deduce weak approximation for diagonal cubic hypersurfaces for n≥7 over Fq(t) when char(Fq)>3 and handle Waring's problem for cubes in 7 variables over Fq(t) when char(Fq)≠3. Our results answer a question of Davenport regarding the number of solutions of bounded height to x31+x32+x33=x34+x35+x36 with xi∈Fq[t]."}],"day":"10","article_processing_charge":"No","department":[{"_id":"TiBr"}],"article_number":"2208.05422","publication_status":"draft","date_updated":"2026-04-07T12:53:53Z","date_published":"2022-08-10T00:00:00Z","month":"08"},{"volume":8,"file_date_updated":"2020-07-14T12:48:03Z","language":[{"iso":"eng"}],"title":"When different norms lead to same billiard trajectories?","date_created":"2020-05-03T22:00:48Z","day":"01","abstract":[{"lang":"eng","text":"Extending a result of Milena Radnovic and Serge Tabachnikov, we establish conditionsfor two different non-symmetric norms to define the same billiard reflection law."}],"scopus_import":"1","author":[{"orcid":"0000-0002-2548-617X","last_name":"Akopyan","full_name":"Akopyan, Arseniy","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Karasev","first_name":"Roman","full_name":"Karasev, Roman"}],"page":"1309 - 1312","quality_controlled":"1","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020","grant_number":"788183"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"_id":"7791","doi":"10.1007/s40879-020-00405-0","type":"journal_article","publication":"European Journal of Mathematics","intvolume":"         8","arxiv":1,"external_id":{"arxiv":["1912.12685"]},"ddc":["510"],"citation":{"ista":"Akopyan A, Karasev R. 2022. When different norms lead to same billiard trajectories? European Journal of Mathematics. 8(4), 1309–1312.","short":"A. Akopyan, R. Karasev, European Journal of Mathematics 8 (2022) 1309–1312.","chicago":"Akopyan, Arseniy, and Roman Karasev. “When Different Norms Lead to Same Billiard Trajectories?” <i>European Journal of Mathematics</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s40879-020-00405-0\">https://doi.org/10.1007/s40879-020-00405-0</a>.","ieee":"A. Akopyan and R. Karasev, “When different norms lead to same billiard trajectories?,” <i>European Journal of Mathematics</i>, vol. 8, no. 4. Springer Nature, pp. 1309–1312, 2022.","mla":"Akopyan, Arseniy, and Roman Karasev. “When Different Norms Lead to Same Billiard Trajectories?” <i>European Journal of Mathematics</i>, vol. 8, no. 4, Springer Nature, 2022, pp. 1309–12, doi:<a href=\"https://doi.org/10.1007/s40879-020-00405-0\">10.1007/s40879-020-00405-0</a>.","ama":"Akopyan A, Karasev R. When different norms lead to same billiard trajectories? <i>European Journal of Mathematics</i>. 2022;8(4):1309-1312. doi:<a href=\"https://doi.org/10.1007/s40879-020-00405-0\">10.1007/s40879-020-00405-0</a>","apa":"Akopyan, A., &#38; Karasev, R. (2022). When different norms lead to same billiard trajectories? <i>European Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s40879-020-00405-0\">https://doi.org/10.1007/s40879-020-00405-0</a>"},"acknowledgement":"AA was supported by European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 78818 Alpha). RK was supported by the Federal professorship program Grant 1.456.2016/1.4 and the Russian Foundation for Basic Research Grants 18-01-00036 and 19-01-00169. Open access funding provided by Institute of Science and Technology (IST Austria). The authors thank Alexey Balitskiy, Milena Radnović, and Serge Tabachnikov for useful discussions.","oa":1,"department":[{"_id":"HeEd"}],"article_processing_charge":"Yes (via OA deal)","publication_status":"published","date_updated":"2025-04-14T07:48:36Z","article_type":"original","month":"12","date_published":"2022-12-01T00:00:00Z","ec_funded":1,"publisher":"Springer Nature","issue":"4","year":"2022","status":"public","has_accepted_license":"1","corr_author":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["2199-6768"],"issn":["2199-675X"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"oa_version":"Published Version","file":[{"creator":"dernst","file_size":263926,"content_type":"application/pdf","access_level":"open_access","checksum":"f53e71fd03744075adcd0b8fc1b8423d","date_updated":"2020-07-14T12:48:03Z","relation":"main_file","file_name":"2020_EuropMathematics_Akopyan.pdf","date_created":"2020-05-04T10:33:42Z","file_id":"7796"}]},{"language":[{"iso":"eng"}],"related_material":{"link":[{"relation":"earlier_version","url":"https://doi.org/10.4230/LIPIcs.ICALP.2020.7"}],"record":[{"relation":"earlier_version","id":"15077","status":"public"}]},"title":"Dynamic averaging load balancing on cycles","volume":84,"file_date_updated":"2021-12-27T10:36:40Z","date_created":"2020-08-24T06:24:04Z","abstract":[{"lang":"eng","text":"We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor. "}],"day":"01","scopus_import":"1","isi":1,"quality_controlled":"1","author":[{"orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nadiradze","orcid":"0000-0001-5634-0731","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","full_name":"Nadiradze, Giorgi","first_name":"Giorgi"},{"id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67","first_name":"Amirmojtaba","full_name":"Sabour, Amirmojtaba","last_name":"Sabour"}],"page":"1007-1029","_id":"8286","doi":"10.1007/s00453-021-00905-9","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","grant_number":"805223"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"publication":"Algorithmica","type":"journal_article","external_id":{"arxiv":["2003.09297"],"isi":["000734004600001"]},"ddc":["000"],"acknowledgement":"The authors sincerely thank Thomas Sauerwald and George Giakkoupis for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for feedback on earlier versions of this draft. We also thank the ICALP anonymous reviewers for their very useful comments. Open access funding provided by Institute of Science and Technology (IST Austria). Funding was provided by European Research Council (Grant No. PR1042ERC01).","citation":{"ista":"Alistarh D-A, Nadiradze G, Sabour A. 2022. Dynamic averaging load balancing on cycles. Algorithmica. 84(4), 1007–1029.","short":"D.-A. Alistarh, G. Nadiradze, A. Sabour, Algorithmica 84 (2022) 1007–1029.","chicago":"Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” <i>Algorithmica</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s00453-021-00905-9\">https://doi.org/10.1007/s00453-021-00905-9</a>.","mla":"Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” <i>Algorithmica</i>, vol. 84, no. 4, Springer Nature, 2022, pp. 1007–29, doi:<a href=\"https://doi.org/10.1007/s00453-021-00905-9\">10.1007/s00453-021-00905-9</a>.","ieee":"D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” <i>Algorithmica</i>, vol. 84, no. 4. Springer Nature, pp. 1007–1029, 2022.","ama":"Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. <i>Algorithmica</i>. 2022;84(4):1007-1029. doi:<a href=\"https://doi.org/10.1007/s00453-021-00905-9\">10.1007/s00453-021-00905-9</a>","apa":"Alistarh, D.-A., Nadiradze, G., &#38; Sabour, A. (2022). Dynamic averaging load balancing on cycles. <i>Algorithmica</i>. Virtual, Online; Germany: Springer Nature. <a href=\"https://doi.org/10.1007/s00453-021-00905-9\">https://doi.org/10.1007/s00453-021-00905-9</a>"},"intvolume":"        84","arxiv":1,"oa":1,"article_processing_charge":"Yes (via OA deal)","department":[{"_id":"DaAl"}],"conference":{"location":"Virtual, Online; Germany","end_date":"2020-07-11","name":"ICALP: Automata, Languages and Programming","start_date":"2020-07-08"},"date_updated":"2025-07-10T11:55:11Z","publication_status":"published","article_type":"original","month":"04","date_published":"2022-04-01T00:00:00Z","publisher":"Springer Nature","ec_funded":1,"status":"public","issue":"4","year":"2022","has_accepted_license":"1","publication_identifier":{"eissn":["1432-0541"],"issn":["0178-4617"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"date_updated":"2021-12-27T10:36:40Z","creator":"cchlebak","content_type":"application/pdf","access_level":"open_access","checksum":"21169b25b0c8e17b21e12af22bff9870","file_size":525950,"success":1,"file_id":"10577","file_name":"2021_Algorithmica_Alistarh.pdf","date_created":"2021-12-27T10:36:40Z","relation":"main_file"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"}},{"scopus_import":"1","abstract":[{"lang":"eng","text":"We prove some recent experimental observations of Dan Reznik concerning periodic billiard orbits in ellipses. For example, the sum of cosines of the angles of a periodic billiard polygon remains constant in the 1-parameter family of such polygons (that exist due to the Poncelet porism). In our proofs, we use geometric and complex analytic methods."}],"day":"01","date_created":"2020-09-20T22:01:38Z","volume":8,"title":"Billiards in ellipses revisited","main_file_link":[{"url":"https://arxiv.org/abs/2001.02934","open_access":"1"}],"language":[{"iso":"eng"}],"arxiv":1,"intvolume":"         8","acknowledgement":" This paper would not be written if not for Dan Reznik’s curiosity and persistence; we are very grateful to him. We also thank R. Garcia and J. Koiller for interesting discussions. It is a pleasure to thank the Mathematical Institute of the University of Heidelberg for its stimulating atmosphere. ST thanks M. Bialy for interesting discussions and the Tel Aviv\r\nUniversity for its invariable hospitality. AA was supported by European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). RS is supported by NSF Grant DMS-1807320. ST was supported by NSF grant DMS-1510055 and SFB/TRR 191.","citation":{"ieee":"A. Akopyan, R. Schwartz, and S. Tabachnikov, “Billiards in ellipses revisited,” <i>European Journal of Mathematics</i>, vol. 8, no. 4. Springer Nature, pp. 1313–1327, 2022.","mla":"Akopyan, Arseniy, et al. “Billiards in Ellipses Revisited.” <i>European Journal of Mathematics</i>, vol. 8, no. 4, Springer Nature, 2022, pp. 1313–27, doi:<a href=\"https://doi.org/10.1007/s40879-020-00426-9\">10.1007/s40879-020-00426-9</a>.","ama":"Akopyan A, Schwartz R, Tabachnikov S. Billiards in ellipses revisited. <i>European Journal of Mathematics</i>. 2022;8(4):1313-1327. doi:<a href=\"https://doi.org/10.1007/s40879-020-00426-9\">10.1007/s40879-020-00426-9</a>","apa":"Akopyan, A., Schwartz, R., &#38; Tabachnikov, S. (2022). Billiards in ellipses revisited. <i>European Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s40879-020-00426-9\">https://doi.org/10.1007/s40879-020-00426-9</a>","ista":"Akopyan A, Schwartz R, Tabachnikov S. 2022. Billiards in ellipses revisited. European Journal of Mathematics. 8(4), 1313–1327.","short":"A. Akopyan, R. Schwartz, S. Tabachnikov, European Journal of Mathematics 8 (2022) 1313–1327.","chicago":"Akopyan, Arseniy, Richard Schwartz, and Serge Tabachnikov. “Billiards in Ellipses Revisited.” <i>European Journal of Mathematics</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s40879-020-00426-9\">https://doi.org/10.1007/s40879-020-00426-9</a>."},"external_id":{"arxiv":["2001.02934"]},"publication":"European Journal of Mathematics","type":"journal_article","project":[{"call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/s40879-020-00426-9","_id":"8538","author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy","full_name":"Akopyan, Arseniy","last_name":"Akopyan","orcid":"0000-0002-2548-617X"},{"full_name":"Schwartz, Richard","first_name":"Richard","last_name":"Schwartz"},{"last_name":"Tabachnikov","first_name":"Serge","full_name":"Tabachnikov, Serge"}],"page":"1313-1327","quality_controlled":"1","ec_funded":1,"publisher":"Springer Nature","month":"12","date_published":"2022-12-01T00:00:00Z","article_type":"original","date_updated":"2025-04-14T07:48:34Z","publication_status":"published","department":[{"_id":"HeEd"}],"article_processing_charge":"No","oa":1,"oa_version":"Preprint","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["2199-6768"],"issn":["2199-675X"]},"year":"2022","status":"public","issue":"4"},{"oa_version":"Preprint","publication_identifier":{"eissn":["1944-7833"],"issn":["1937-0652"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","corr_author":"1","issue":"10","status":"public","year":"2022","publisher":"Mathematical Sciences Publishers","article_type":"original","date_published":"2022-12-01T00:00:00Z","month":"12","date_updated":"2025-04-14T09:25:44Z","publication_status":"published","article_processing_charge":"No","department":[{"_id":"TiBr"}],"oa":1,"acknowledgement":"The authors are very grateful to Will Sawin for useful remarks about this topic. While working on this paper the first two authors were supported by EPSRC grant EP/P026710/1, and the first and last authors by FWF grant P 32428-N35.","citation":{"chicago":"Browning, Timothy D, Tal Horesh, and Florian Alexander Wilsch. “Equidistribution and Freeness on Grassmannians.” <i>Algebra &#38; Number Theory</i>. Mathematical Sciences Publishers, 2022. <a href=\"https://doi.org/10.2140/ant.2022.16.2385\">https://doi.org/10.2140/ant.2022.16.2385</a>.","short":"T.D. Browning, T. Horesh, F.A. Wilsch, Algebra &#38; Number Theory 16 (2022) 2385–2407.","ista":"Browning TD, Horesh T, Wilsch FA. 2022. Equidistribution and freeness on Grassmannians. Algebra &#38; Number Theory. 16(10), 2385–2407.","apa":"Browning, T. D., Horesh, T., &#38; Wilsch, F. A. (2022). Equidistribution and freeness on Grassmannians. <i>Algebra &#38; Number Theory</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/ant.2022.16.2385\">https://doi.org/10.2140/ant.2022.16.2385</a>","ama":"Browning TD, Horesh T, Wilsch FA. Equidistribution and freeness on Grassmannians. <i>Algebra &#38; Number Theory</i>. 2022;16(10):2385-2407. doi:<a href=\"https://doi.org/10.2140/ant.2022.16.2385\">10.2140/ant.2022.16.2385</a>","ieee":"T. D. Browning, T. Horesh, and F. A. Wilsch, “Equidistribution and freeness on Grassmannians,” <i>Algebra &#38; Number Theory</i>, vol. 16, no. 10. Mathematical Sciences Publishers, pp. 2385–2407, 2022.","mla":"Browning, Timothy D., et al. “Equidistribution and Freeness on Grassmannians.” <i>Algebra &#38; Number Theory</i>, vol. 16, no. 10, Mathematical Sciences Publishers, 2022, pp. 2385–407, doi:<a href=\"https://doi.org/10.2140/ant.2022.16.2385\">10.2140/ant.2022.16.2385</a>."},"external_id":{"isi":["000961514100004"],"arxiv":["2102.11552"]},"arxiv":1,"intvolume":"        16","type":"journal_article","publication":"Algebra & Number Theory","doi":"10.2140/ant.2022.16.2385","_id":"9199","project":[{"grant_number":"EP-P026710-2","name":"Between rational and integral points","_id":"26A8D266-B435-11E9-9278-68D0E5697425"},{"_id":"26AEDAB2-B435-11E9-9278-68D0E5697425","name":"New frontiers of the Manin conjecture","call_identifier":"FWF","grant_number":"P32428"}],"quality_controlled":"1","page":"2385-2407","author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Browning, Timothy D","first_name":"Timothy D","last_name":"Browning","orcid":"0000-0002-8314-0177"},{"id":"C8B7BF48-8D81-11E9-BCA9-F536E6697425","full_name":"Horesh, Tal","first_name":"Tal","last_name":"Horesh"},{"first_name":"Florian Alexander","full_name":"Wilsch, Florian Alexander","id":"560601DA-8D36-11E9-A136-7AC1E5697425","orcid":"0000-0001-7302-8256","last_name":"Wilsch"}],"scopus_import":"1","isi":1,"day":"01","abstract":[{"lang":"eng","text":"We associate a certain tensor product lattice to any primitive integer lattice and ask about its typical shape. These lattices are related to the tangent bundle of Grassmannians and their study is motivated by Peyre's programme on \"freeness\" for rational points of bounded height on Fano\r\nvarieties."}],"date_created":"2021-02-25T09:56:57Z","title":"Equidistribution and freeness on Grassmannians","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2102.11552"}],"language":[{"iso":"eng"}],"volume":16},{"type":"journal_article","publication":"Mathematics of Operations Research","acknowledgement":"Partially supported by Austrian Science Fund (FWF) NFN Grant No RiSE/SHiNE S11407, by CONICYT Chile through grant PII 20150140, and by ECOS-CONICYT through grant C15E03.\r\n","citation":{"short":"K. Chatterjee, R.J. Saona Urmeneta, B. Ziliotto, Mathematics of Operations Research 47 (2022) 100–119.","chicago":"Chatterjee, Krishnendu, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” <i>Mathematics of Operations Research</i>. Institute for Operations Research and the Management Sciences, 2022. <a href=\"https://doi.org/10.1287/moor.2020.1116\">https://doi.org/10.1287/moor.2020.1116</a>.","ista":"Chatterjee K, Saona Urmeneta RJ, Ziliotto B. 2022. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 47(1), 100–119.","ama":"Chatterjee K, Saona Urmeneta RJ, Ziliotto B. Finite-memory strategies in POMDPs with long-run average objectives. <i>Mathematics of Operations Research</i>. 2022;47(1):100-119. doi:<a href=\"https://doi.org/10.1287/moor.2020.1116\">10.1287/moor.2020.1116</a>","apa":"Chatterjee, K., Saona Urmeneta, R. J., &#38; Ziliotto, B. (2022). Finite-memory strategies in POMDPs with long-run average objectives. <i>Mathematics of Operations Research</i>. Institute for Operations Research and the Management Sciences. <a href=\"https://doi.org/10.1287/moor.2020.1116\">https://doi.org/10.1287/moor.2020.1116</a>","mla":"Chatterjee, Krishnendu, et al. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” <i>Mathematics of Operations Research</i>, vol. 47, no. 1, Institute for Operations Research and the Management Sciences, 2022, pp. 100–19, doi:<a href=\"https://doi.org/10.1287/moor.2020.1116\">10.1287/moor.2020.1116</a>.","ieee":"K. Chatterjee, R. J. Saona Urmeneta, and B. Ziliotto, “Finite-memory strategies in POMDPs with long-run average objectives,” <i>Mathematics of Operations Research</i>, vol. 47, no. 1. Institute for Operations Research and the Management Sciences, pp. 100–119, 2022."},"external_id":{"isi":["000731918100001"],"arxiv":["1904.13360"]},"arxiv":1,"intvolume":"        47","quality_controlled":"1","page":"100-119","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Saona Urmeneta","orcid":"0000-0001-5103-038X","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","full_name":"Saona Urmeneta, Raimundo J","first_name":"Raimundo J"},{"full_name":"Ziliotto, Bruno","first_name":"Bruno","last_name":"Ziliotto"}],"doi":"10.1287/moor.2020.1116","_id":"9311","project":[{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","isi":1,"title":"Finite-memory strategies in POMDPs with long-run average objectives","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.13360"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"20234","relation":"dissertation_contains","status":"public"}]},"keyword":["Management Science and Operations Research","General Mathematics","Computer Science Applications"],"volume":47,"day":"01","abstract":[{"text":"Partially observable Markov decision processes (POMDPs) are standard models for dynamic systems with probabilistic and nondeterministic behaviour in uncertain environments. We prove that in POMDPs with long-run average objective, the decision maker has approximately optimal strategies with finite memory. This implies notably that approximating the long-run value is recursively enumerable, as well as a weak continuity property of the value with respect to the transition function. ","lang":"eng"}],"date_created":"2021-04-08T09:33:31Z","publication_identifier":{"issn":["0364-765X"],"eissn":["1526-5471"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Preprint","status":"public","year":"2022","issue":"1","date_published":"2022-02-01T00:00:00Z","article_type":"original","month":"02","publication_status":"published","date_updated":"2026-04-07T12:31:21Z","publisher":"Institute for Operations Research and the Management Sciences","oa":1,"article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"KrCh"}]}]