Add files using upload-large-folder tool

data/sampled_jsons/2405.19550_Section_6.2_MATH_Pythia-1B_poor_performance_exploration.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Integrated II Answers and Solutions | Mathleaks", "date": "", "ddg_snippet": "Mathleaks offers help with learning-focused solutions for textbooks in Integrated Mathematics II, 9th and 10th grade. They include theory, hints, answers and cover textbooks from publishers such as Houghton Mifflin, McGraw Hill, CPM, Big Ideas, and Pearson.", "subpage_snippet": "", "source": "mathleaks.com", "link": "https://mathleaks.com/courses/integrated-ii", "content": "Mathleaks offers help with learning-focused solutions for textbooks in Integrated Mathematics II, 9th and 10th grade. They include theory, hints, answers and cover textbooks from publishers such as Houghton Mifflin, McGraw Hill, CPM, Big Ideas, and Pearson."}
+{"idx": 1, "title": "Factors associated with high school learners' poor performance: a ...", "date": "", "ddg_snippet": "This study, using anon-experimental, exploratory and descriptive method, established learners' and educators' views about factors that contribute to poor performance in mathematics and physical ...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/228619581_Factors_associated_with_high_school_learners'_poor_performance_a_spotlight_on_mathematics_and_physical_science", "content": "This study, using anon-experimental, exploratory and descriptive method, established learners' and educators' views about factors that contribute to poor performance in mathematics and physical ..."}
+{"idx": 2, "title": "Maths IA - 300 Maths Exploration Topics - IB Maths Resources from ...", "date": "", "ddg_snippet": "Maths IA - 300 Maths Exploration Topics: Scroll down this page to find over 300 examples of maths IA exploration topics and ideas for IB mathematics students doing their internal assessment (IA) coursework. Topics include Algebra and Number (proof), Geometry, Calculus, Statistics and Probability, Physics, and links with other subjects.", "subpage_snippet": "", "source": "ibmathsresources.com", "link": "https://ibmathsresources.com/maths-ia-maths-exploration-topics/", "content": "Maths IA - 300 Maths Exploration Topics: Scroll down this page to find over 300 examples of maths IA exploration topics and ideas for IB mathematics students doing their internal assessment (IA) coursework. Topics include Algebra and Number (proof), Geometry, Calculus, Statistics and Probability, Physics, and links with other subjects."}
+{"idx": 3, "title": "Big Ideas Math Algebra 2 Answers Chapter 6 ... - CCSS Math Answers", "date": "", "ddg_snippet": "The Big Ideas Math Book Algebra 2 Ch 6 Exponential and Logarithmic Functions include Questions from Exercises 6.1 to 6.7, Review Tests, Chapter Tests, Cumulative Assessments, etc. Enhance your subject knowledge taking the help of the Big Ideas Math Algebra 2 Answers Chapter 6 Exponential and Logarithmic Functions prepared by subject experts.", "subpage_snippet": "", "source": "ccssmathanswers.com", "link": "https://ccssmathanswers.com/big-ideas-math-algebra-2-answers-chapter-6/", "content": "The Big Ideas Math Book Algebra 2 Ch 6 Exponential and Logarithmic Functions include Questions from Exercises 6.1 to 6.7, Review Tests, Chapter Tests, Cumulative Assessments, etc. Enhance your subject knowledge taking the help of the Big Ideas Math Algebra 2 Answers Chapter 6 Exponential and Logarithmic Functions prepared by subject experts."}
+{"idx": 4, "title": "PDF Factors Contributing to Poor Learner Performance in Mathematics: a Case ...", "date": "", "ddg_snippet": "Introduction Poor learner performance in mathematics has been a global concern that has prompted developing countries to participate in initiatives to bring positive change in their communities (Sinyosi, 2015). Mathematics excellence can bring positive change in developing countries to develop their education systems for shaping the future and prospects of young people; to develop ...", "subpage_snippet": "", "source": "files.eric.ed.gov", "link": "https://files.eric.ed.gov/fulltext/EJ1301930.pdf", "content": "Introduction Poor learner performance in mathematics has been a global concern that has prompted developing countries to participate in initiatives to bring positive change in their communities (Sinyosi, 2015). Mathematics excellence can bring positive change in developing countries to develop their education systems for shaping the future and prospects of young people; to develop ..."}
+{"idx": 5, "title": "Causes of Poor Performance in Mathematics from the", "date": "", "ddg_snippet": "ultimately causes as one of the most important factors for poor performance in mathematics [11]. By developing and raising level of student's interest and involvement means how much time, energy and effort they devote towards achieving high goals in mathematics as learning process is fast and instinctual on one hand while on the other hand ...", "subpage_snippet": "", "source": "asrjetsjournal.org", "link": "https://asrjetsjournal.org/index.php/American_Scientific_Journal/article/download/1212/654/2858", "content": "ultimately causes as one of the most important factors for poor performance in mathematics [11]. By developing and raising level of student's interest and involvement means how much time, energy and effort they devote towards achieving high goals in mathematics as learning process is fast and instinctual on one hand while on the other hand ..."}
+{"idx": 6, "title": "(Pdf) Factors Contributing to Poor Learner Performance in Mathematics ...", "date": "", "ddg_snippet": "Introduction Poor learner performance in mathematics has been a global concern that has prompted developing countries to participate in initiatives to bring positive change in their communities", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/352394333_FACTORS_CONTRIBUTING_TO_POOR_LEARNER_PERFORMANCE_IN_MATHEMATICS_A_CASE_OF_SELECTED_SCHOOLS_IN_MPUMALANGA_PROVINCE_SOUTH_AFRICA", "content": "Introduction Poor learner performance in mathematics has been a global concern that has prompted developing countries to participate in initiatives to bring positive change in their communities"}
+{"idx": 7, "title": "Stress-Testing Capability Elicitation With Password-Locked Models", "date": "", "ddg_snippet": "For code generation (right), when using a Deepseek 7B (Bi et al., 2024) model fine-tuned to imitate poor answers generated by Pythia-1B (Biderman et al., 2023), both supervised fine-tuning (SFT) on few demonstrations and reinforcement learning (RL) recover most of the coding capabilities of Deepseek 7B.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2405.19550", "content": "For code generation (right), when using a Deepseek 7B (Bi et al., 2024) model fine-tuned to imitate poor answers generated by Pythia-1B (Biderman et al., 2023), both supervised fine-tuning (SFT) on few demonstrations and reinforcement learning (RL) recover most of the coding capabilities of Deepseek 7B."}
+{"idx": 8, "title": "Samarth0710/neurips-2024-peer-reviews-test-10 - Hugging Face", "date": "", "ddg_snippet": "Samarth0710/neurips-2024-peer-reviews-test-10 · Datasets at Hugging Facetrain · 4.24k rows", "subpage_snippet": "", "source": "huggingface.co", "link": "https://huggingface.co/datasets/Samarth0710/neurips-2024-peer-reviews-test-10/viewer", "content": "Samarth0710/neurips-2024-peer-reviews-test-10 · Datasets at Hugging Facetrain · 4.24k rows"}
+{"idx": 9, "title": "PDF Microsoft Word - HS_Alg2_PWATP_01_ChAssess.docx", "date": "", "ddg_snippet": "4. log 2 720 8. ln 4 3y 2 11. 3 ln 6 x + ln 4 y y 3 x − 13. log 6 6 − log 6 2 + 2 log 6 In Exercises 14-17, use the change-of-base formula to evaluate the logarithm. 14. log 3 17 15. log 9 294", "subpage_snippet": "", "source": "static.bigideasmath.com", "link": "https://static.bigideasmath.com/protected/content/pwtp/aga22/aga22_algebra2_pwtp_06.pdf", "content": "4. log 2 720 8. ln 4 3y 2 11. 3 ln 6 x + ln 4 y y 3 x − 13. log 6 6 − log 6 2 + 2 log 6 In Exercises 14-17, use the change-of-base formula to evaluate the logarithm. 14. log 3 17 15. log 9 294"}

data/sampled_jsons/34016_EntityErasure-_Erasing_Entity_Cleanly_via_Amodal_Entity_Segmentation_and_Completion_filetypepd.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Bulk Delete Entity Framework - Entity Frame Extensions", "date": "", "ddg_snippet": "Execute HIGH performance delete operations in Entity Framework. Extend EF6 and EF Core with Bulk Delete Easy to Customize · Easy to Use · Awesome Customer Support · Over 3000 Customers", "subpage_snippet": "", "source": "www.bing.com", "link": "https://www.bing.com/aclick?ld=e8N0jM_t4RO1qz38rb3IA9PzVUCUyQ73BP5yZxVANx8XTxgtoygpp6stJhGqouRe1zhINcoUo1_fHeho5JCAvO55diHDkhLiqfI33YxBzOl3ykNKvsK0aDqSFTYTnEMBmhDWlSjzo69cSAwNM2YlGAbwJAgBrh25USoE87x9aeL92nZ-qvr3Rl_QuSvfxwdIDyr9b0mA&u=aHR0cHMlM2ElMmYlMmZlbnRpdHlmcmFtZXdvcmstZXh0ZW5zaW9ucy5uZXQlMmZidWxrLWRlbGV0ZSUzZm1zY2xraWQlM2RiYTk0OWQ5NTZjMDMxOWZhMzM3NGY1NWE2YWRmYzNhNCUyNnV0bV9zb3VyY2UlM2RiaW5nJTI2dXRtX21lZGl1bSUzZGNwYyUyNnV0bV9jYW1wYWlnbiUzZEVGRSUyNTIwLSUyNTIwVDElMjZ1dG1fdGVybSUzZGVudGl0eSUyNTIwZnJhbWV3b3JrJTI1MjBkZWxldGUlMjZ1dG1fY29udGVudCUzZEJ1bGtEZWxldGU&rlid=ba949d956c0319fa3374f55a6adfc3a4", "content": "Execute HIGH performance delete operations in Entity Framework. Extend EF6 and EF Core with Bulk Delete Easy to Customize · Easy to Use · Awesome Customer Support · Over 3000 Customers"}
+{"idx": 1, "title": "GitHub - zyxunh/ entity _ erasure", "date": "", "ddg_snippet": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion [CVPR2025].", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/zyxunh/entity_erasure", "content": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion [CVPR2025]."}
+{"idx": 2, "title": "EntityErasure : Erasing Entity Cleanly via Amodal Entity ...", "date": "", "ddg_snippet": "Amodal Entity Completion . Classifer-free Guidance.The proposed entity attention injects entity in-formation with amodal entity segmentation guidance.", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/papers/Zhu_EntityErasure_Erasing_Entity_Cleanly_via_Amodal_Entity_Segmentation_and_Completion_CVPR_2025_paper.pdf", "content": "Amodal Entity Completion . Classifer-free Guidance.The proposed entity attention injects entity in-formation with amodal entity segmentation guidance."}
+{"idx": 3, "title": "EntityErasure : Erasing Entity Cleanly via Amodal Entity ...", "date": "", "ddg_snippet": "Abstract. This paper presents EntityErasure , a novel diffusion-based method that can effectively erase entity without inducing unwanted sundries. To this end, we propose to address this problem by dividing it into amodal entity segmentation and completion ...", "subpage_snippet": "", "source": "zyxunh.github.io", "link": "https://zyxunh.github.io/EntityErasure-ProjectPage/", "content": "Abstract. This paper presents EntityErasure , a novel diffusion-based method that can effectively erase entity without inducing unwanted sundries. To this end, we propose to address this problem by dividing it into amodal entity segmentation and completion ..."}
+{"idx": 4, "title": "unhzyx/ entity _ erasure at main", "date": "", "ddg_snippet": "main. entity _ erasure . Ctrl+K.Upload amodal _ segmentation _model.bin with huggingface_hub. 0056599 verified 3 minutes ago.", "subpage_snippet": "", "source": "huggingface.co", "link": "https://huggingface.co/unhzyx/entity_erasure/tree/main", "content": "main. entity _ erasure . Ctrl+K.Upload amodal _ segmentation _model.bin with huggingface_hub. 0056599 verified 3 minutes ago."}
+{"idx": 5, "title": "[ PDF ] [EPUB] The Way of The Iceman: How The Wim Hof Method...", "date": "", "ddg_snippet": "Get Full eBook File name \"The_Way_of_The_Iceman__How_The_Wim_Hof_Met_-_Wim_Hof. pdf .epub\" Format Complete Free. Genres: \"Biography, Health, Nonfiction, Personal Development, Self Help\".", "subpage_snippet": "", "source": "oceanofpdf.com", "link": "https://oceanofpdf.com/authors/wim-hof/pdf-epub-the-way-of-the-iceman-how-the-wim-hof-method-creates-radiant-longterm-health-using-the-science-and-secrets-of-breath-control-cold-training-and-commitment-download/", "content": "Get Full eBook File name \"The_Way_of_The_Iceman__How_The_Wim_Hof_Met_-_Wim_Hof. pdf .epub\" Format Complete Free. Genres: \"Biography, Health, Nonfiction, Personal Development, Self Help\"."}
+{"idx": 6, "title": "Soft Deleting Entities Cleanly Using Entity Framework... | CodeGuru", "date": "", "ddg_snippet": "Entity Framework (EF) does not have this feature built in. However, we can use the building blocks available in EF 6 to achieve this. Entity Framework 6 has introduced two new features: ‘Interceptors’ and ‘Custom Code Conventions’.", "subpage_snippet": "", "source": "www.codeguru.com", "link": "https://www.codeguru.com/csharp/soft-deleting-entities-cleanly-using-entity-framework-6-interceptors/", "content": "Entity Framework (EF) does not have this feature built in. However, we can use the building blocks available in EF 6 to achieve this. Entity Framework 6 has introduced two new features: ‘Interceptors’ and ‘Custom Code Conventions’."}
+{"idx": 7, "title": "DEMO | PDF .ai | The best ChatPDF app", "date": "", "ddg_snippet": "We built the ultimate ChatPDF app that allows you to chat with any PDF : ask questions, get summaries, find anything you need!", "subpage_snippet": "", "source": "pdf.ai", "link": "https://pdf.ai/demo", "content": "We built the ultimate ChatPDF app that allows you to chat with any PDF : ask questions, get summaries, find anything you need!"}
+{"idx": 8, "title": "Publications", "date": "", "ddg_snippet": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion Yixing Zhu, Qing Zhang, Yitong Wang, Yongwei Nie, Wei-Shi Zheng IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2025.", "subpage_snippet": "", "source": "www.zhangqing-home.net", "link": "https://www.zhangqing-home.net/full_publications.html", "content": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion Yixing Zhu, Qing Zhang, Yitong Wang, Yongwei Nie, Wei-Shi Zheng IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2025."}
+{"idx": 9, "title": "Youtube to MP3 Converter (Ad-free)", "date": "", "ddg_snippet": "Buy me a coffee. Donate via crypto. YouTube to MP4.", "subpage_snippet": "", "source": "ezconv.com", "link": "https://ezconv.com/", "content": "Buy me a coffee. Donate via crypto. YouTube to MP4."}

data/sampled_jsons/51x0dfsD8A_Algorithm_2_k-HOC_O(n^4)_OR_O(n^3)_OR_O(n^2)_OR_O(n_log_n).jsonl

@@ -0,0 +1,8 @@
+{"idx": 0, "title": "How to Fix ‘The Signature Uses an Unsupported Algorithm. The ... [2112.05682] Self-attention Does Not Need $O (n^2)$ Memory What Is SHA-256? | Boot.dev big o - Big O Question about an algorithm with (n^2 + n) / 2 ... Big O Cheat Sheet – Time Complexity Chart - freeCodeCamp.org Fast Fourier Transformation for polynomial multiplication big o - Big-O complexity for n + n-1 + n-2 - Stack Overflow", "date": "", "ddg_snippet": "Save Up to 80% On Top SSL Brands Low Prices. 24/7 Support. SSL Experts. Dec 10, 2021 · We present a very simple algorithm for attention that requires O (1) memory with respect to sequence length and an extension to self-attention that requires O ( log n ) memory. This is in contrast with the frequently stated belief that self-attention requires O (n2) memory. While the time complexity is still O (n2), device memory rather than compute capability is often the limiting factor on modern ... If you’re not familiar with SHA-256 , try this online generator. Enter any message and click the “hash” button. See full list on blog.boot.dev SHA-256 is a standard hash function, so the real question is, “what’s a hash function”? A cryptographic hash function generates a “fingerprint” of an input string. For example, if we were to hash the entire text of JRR Tolkien’s “The Lord of The Rings” series using the SHA 256 algorithm , we would get a 256-bit output unique to that book’s text. If ... See full list on blog.boot.dev SHA-256 is useful in so manycircumstances! It’s a fast and secure hash function, here are some of the most common ways that it’s used: 1. To create website authentication schemes, using JWTs, HMACs and MACs 2 . To create digital signatures 3 . To secure blockchainslike Bitcoin and Ethereum 4 . In anti-viruses, to compare the fingerprints of files and ... See full list on blog.boot.dev SHA- 2 is known for its security (it hasn’t broken down like SHA-1) and its speed. In cases where keys are not generated, such as proof-of-work Bitcoin mining, a fast hash algorithm like SHA- 2 often has the upper hand. SHA-256 is formally defined in the National Institute of Standards and Technology’s FIPS 180- 4 . Along with standardization and forma... See full list on blog.boot.dev Let’s go through an example of the SHA-256 hashing algorithm step-by-step, by hand. If you can stay awake through this whole walkthrough, you’ll understand all of its nuts and bolts. See full list on blog.boot.dev After the compression loop, but still, within the chunkloop, we modify the hash values by adding their respective variables to them, a-h. As usual, all addition is modulo 2 ^32. See full list on blog.boot.dev Last but not least, slap them all together, a simple string concatenationwill do. Done! We’ve been through every step (sans some iterations) of SHA-256 in excruciating detail :) I’m glad you’ve made it this far! Going step-by-step through the SHA-256 algorithm isn’t exactly a walk in the park. Learning the fundamentals that underpin web security ca... See full list on blog.boot.dev If you want to see all the steps we just did above in pseudocode form, then here it is, straight from WikiPedia: See full list on blog.boot.dev SHA- 2 is an algorithm , or a generalized idea of how to hash data. SHA- 2 has several variants, all of which use the same algorithm but use different constants. SHA-256, for example, sets additional constants that define the behavior of the SHA- 2 algorithm , one of these constants is the output size, 256. The 256 and 512 in SHA-256 and SHA-512 refer t... See full list on blog.boot.dev SHA- 2 is a successor to the SHA-1 hash and remains one of the strongest hash functions in use today. SHA-256, as opposed to SHA-1, hasn’t been compromised. For this reason, there’s really no reason to use SHA-1 these days, it isn’t safe. The flexibility of output size (224, 256, 512, etc) also allows SHA- 2 to pair well with popular KDFs and ciphers... See full list on blog.boot.dev Apr 20, 2015 · So we call the first two algorithms O(n^2 ), and we call the second O(n). It nicely divides the world up into classes of algorithms. This is what big-O is all about. It's like dividing vehicles up into cars and trucks and busses etc... Oct 5, 2022 · In Big O, there are six major types of complexities (time and space): Constant: O (1) Linear time: O (n) Logarithmic time: O (n log n) Quadratic time: O (n^2 ) Exponential time: O (2^n) Factorial time: O (n!) Before we look at examples for each time complexity, let's understand the Big O time complexity chart. Big O Complexity Chart Mar 15, 2023 · This idea still solves the problem in O (n 2 n2 ) time complexity. We can use any points we want as evaluation points, but by choosing the evaluation points carefully, we can convert between representations in only O (n log n) time. May 30, 2017 · Strictly speaking, shouldn’t you drop the constant and leave only the dominant term? Hence (n^2-n)/2 would end up having a complexity of n^2 or O(n^2 ). In other words saying that the complexity will be (n^2-n)/2 is incorrect.", "subpage_snippet": "", "source": "www.thesslstore.com", "link": "https://www.thesslstore.com/resources/how-to-fix-the-signature-uses-an-unsupported-algorithm-the-digital-signature-is-not-valid/", "content": "Save Up to 80% On Top SSL Brands Low Prices. 24/7 Support. SSL Experts. Dec 10, 2021 · We present a very simple algorithm for attention that requires O (1) memory with respect to sequence length and an extension to self-attention that requires O ( log n ) memory. This is in contrast with the frequently stated belief that self-attention requires O (n2) memory. While the time complexity is still O (n2), device memory rather than compute capability is often the limiting factor on modern ... If you’re not familiar with SHA-256 , try this online generator. Enter any message and click the “hash” button. See full list on blog.boot.dev SHA-256 is a standard hash function, so the real question is, “what’s a hash function”? A cryptographic hash function generates a “fingerprint” of an input string. For example, if we were to hash the entire text of JRR Tolkien’s “The Lord of The Rings” series using the SHA 256 algorithm , we would get a 256-bit output unique to that book’s text. If ... See full list on blog.boot.dev SHA-256 is useful in so manycircumstances! It’s a fast and secure hash function, here are some of the most common ways that it’s used: 1. To create website authentication schemes, using JWTs, HMACs and MACs 2 . To create digital signatures 3 . To secure blockchainslike Bitcoin and Ethereum 4 . In anti-viruses, to compare the fingerprints of files and ... See full list on blog.boot.dev SHA- 2 is known for its security (it hasn’t broken down like SHA-1) and its speed. In cases where keys are not generated, such as proof-of-work Bitcoin mining, a fast hash algorithm like SHA- 2 often has the upper hand. SHA-256 is formally defined in the National Institute of Standards and Technology’s FIPS 180- 4 . Along with standardization and forma... See full list on blog.boot.dev Let’s go through an example of the SHA-256 hashing algorithm step-by-step, by hand. If you can stay awake through this whole walkthrough, you’ll understand all of its nuts and bolts. See full list on blog.boot.dev After the compression loop, but still, within the chunkloop, we modify the hash values by adding their respective variables to them, a-h. As usual, all addition is modulo 2 ^32. See full list on blog.boot.dev Last but not least, slap them all together, a simple string concatenationwill do. Done! We’ve been through every step (sans some iterations) of SHA-256 in excruciating detail :) I’m glad you’ve made it this far! Going step-by-step through the SHA-256 algorithm isn’t exactly a walk in the park. Learning the fundamentals that underpin web security ca... See full list on blog.boot.dev If you want to see all the steps we just did above in pseudocode form, then here it is, straight from WikiPedia: See full list on blog.boot.dev SHA- 2 is an algorithm , or a generalized idea of how to hash data. SHA- 2 has several variants, all of which use the same algorithm but use different constants. SHA-256, for example, sets additional constants that define the behavior of the SHA- 2 algorithm , one of these constants is the output size, 256. The 256 and 512 in SHA-256 and SHA-512 refer t... See full list on blog.boot.dev SHA- 2 is a successor to the SHA-1 hash and remains one of the strongest hash functions in use today. SHA-256, as opposed to SHA-1, hasn’t been compromised. For this reason, there’s really no reason to use SHA-1 these days, it isn’t safe. The flexibility of output size (224, 256, 512, etc) also allows SHA- 2 to pair well with popular KDFs and ciphers... See full list on blog.boot.dev Apr 20, 2015 · So we call the first two algorithms O(n^2 ), and we call the second O(n). It nicely divides the world up into classes of algorithms. This is what big-O is all about. It's like dividing vehicles up into cars and trucks and busses etc... Oct 5, 2022 · In Big O, there are six major types of complexities (time and space): Constant: O (1) Linear time: O (n) Logarithmic time: O (n log n) Quadratic time: O (n^2 ) Exponential time: O (2^n) Factorial time: O (n!) Before we look at examples for each time complexity, let's understand the Big O time complexity chart. Big O Complexity Chart Mar 15, 2023 · This idea still solves the problem in O (n 2 n2 ) time complexity. We can use any points we want as evaluation points, but by choosing the evaluation points carefully, we can convert between representations in only O (n log n) time. May 30, 2017 · Strictly speaking, shouldn’t you drop the constant and leave only the dominant term? Hence (n^2-n)/2 would end up having a complexity of n^2 or O(n^2 ). In other words saying that the complexity will be (n^2-n)/2 is incorrect."}
+{"idx": 1, "title": "What Is SHA-256? | Boot.dev big o - Big O Question about an algorithm with (n^2 + n) / 2 ... Big O Cheat Sheet – Time Complexity Chart - freeCodeCamp.org Fast Fourier Transformation for polynomial multiplication big o - Big-O complexity for n + n-1 + n-2 - Stack Overflow", "date": "", "ddg_snippet": "If you’re not familiar with SHA-256 , try this online generator. Enter any message and click the “hash” button. See full list on blog.boot.dev SHA-256 is a standard hash function, so the real question is, “what’s a hash function”? A cryptographic hash function generates a “fingerprint” of an input string. For example, if we were to hash the entire text of JRR Tolkien’s “The Lord of The Rings” series using the SHA 256 algorithm , we would get a 256-bit output unique to that book’s text. If ... See full list on blog.boot.dev SHA-256 is useful in so manycircumstances! It’s a fast and secure hash function, here are some of the most common ways that it’s used: 1. To create website authentication schemes, using JWTs, HMACs and MACs 2 . To create digital signatures 3 . To secure blockchainslike Bitcoin and Ethereum 4 . In anti-viruses, to compare the fingerprints of files and ... See full list on blog.boot.dev SHA- 2 is known for its security (it hasn’t broken down like SHA-1) and its speed. In cases where keys are not generated, such as proof-of-work Bitcoin mining, a fast hash algorithm like SHA- 2 often has the upper hand. SHA-256 is formally defined in the National Institute of Standards and Technology’s FIPS 180- 4 . Along with standardization and forma... See full list on blog.boot.dev Let’s go through an example of the SHA-256 hashing algorithm step-by-step, by hand. If you can stay awake through this whole walkthrough, you’ll understand all of its nuts and bolts. See full list on blog.boot.dev After the compression loop, but still, within the chunkloop, we modify the hash values by adding their respective variables to them, a-h. As usual, all addition is modulo 2 ^32. See full list on blog.boot.dev Last but not least, slap them all together, a simple string concatenationwill do. Done! We’ve been through every step (sans some iterations) of SHA-256 in excruciating detail :) I’m glad you’ve made it this far! Going step-by-step through the SHA-256 algorithm isn’t exactly a walk in the park. Learning the fundamentals that underpin web security ca... See full list on blog.boot.dev If you want to see all the steps we just did above in pseudocode form, then here it is, straight from WikiPedia: See full list on blog.boot.dev SHA- 2 is an algorithm , or a generalized idea of how to hash data. SHA- 2 has several variants, all of which use the same algorithm but use different constants. SHA-256, for example, sets additional constants that define the behavior of the SHA- 2 algorithm , one of these constants is the output size, 256. The 256 and 512 in SHA-256 and SHA-512 refer t... See full list on blog.boot.dev SHA- 2 is a successor to the SHA-1 hash and remains one of the strongest hash functions in use today. SHA-256, as opposed to SHA-1, hasn’t been compromised. For this reason, there’s really no reason to use SHA-1 these days, it isn’t safe. The flexibility of output size (224, 256, 512, etc) also allows SHA- 2 to pair well with popular KDFs and ciphers... See full list on blog.boot.dev Apr 20, 2015 · So we call the first two algorithms O(n^2 ), and we call the second O(n). It nicely divides the world up into classes of algorithms. This is what big-O is all about. It's like dividing vehicles up into cars and trucks and busses etc... Oct 5, 2022 · In Big O, there are six major types of complexities (time and space): Constant: O (1) Linear time: O (n) Logarithmic time: O (n log n) Quadratic time: O (n^2 ) Exponential time: O (2^n) Factorial time: O (n!) Before we look at examples for each time complexity, let's understand the Big O time complexity chart. Big O Complexity Chart Mar 15, 2023 · This idea still solves the problem in O (n 2 n2 ) time complexity. We can use any points we want as evaluation points, but by choosing the evaluation points carefully, we can convert between representations in only O (n log n) time. May 30, 2017 · Strictly speaking, shouldn’t you drop the constant and leave only the dominant term? Hence (n^2-n)/2 would end up having a complexity of n^2 or O(n^2 ). In other words saying that the complexity will be (n^2-n)/2 is incorrect.", "subpage_snippet": "", "source": "blog.boot.dev", "link": "https://blog.boot.dev/cryptography/how-sha-2-works-step-by-step-sha-256/", "content": "If you’re not familiar with SHA-256 , try this online generator. Enter any message and click the “hash” button. See full list on blog.boot.dev SHA-256 is a standard hash function, so the real question is, “what’s a hash function”? A cryptographic hash function generates a “fingerprint” of an input string. For example, if we were to hash the entire text of JRR Tolkien’s “The Lord of The Rings” series using the SHA 256 algorithm , we would get a 256-bit output unique to that book’s text. If ... See full list on blog.boot.dev SHA-256 is useful in so manycircumstances! It’s a fast and secure hash function, here are some of the most common ways that it’s used: 1. To create website authentication schemes, using JWTs, HMACs and MACs 2 . To create digital signatures 3 . To secure blockchainslike Bitcoin and Ethereum 4 . In anti-viruses, to compare the fingerprints of files and ... See full list on blog.boot.dev SHA- 2 is known for its security (it hasn’t broken down like SHA-1) and its speed. In cases where keys are not generated, such as proof-of-work Bitcoin mining, a fast hash algorithm like SHA- 2 often has the upper hand. SHA-256 is formally defined in the National Institute of Standards and Technology’s FIPS 180- 4 . Along with standardization and forma... See full list on blog.boot.dev Let’s go through an example of the SHA-256 hashing algorithm step-by-step, by hand. If you can stay awake through this whole walkthrough, you’ll understand all of its nuts and bolts. See full list on blog.boot.dev After the compression loop, but still, within the chunkloop, we modify the hash values by adding their respective variables to them, a-h. As usual, all addition is modulo 2 ^32. See full list on blog.boot.dev Last but not least, slap them all together, a simple string concatenationwill do. Done! We’ve been through every step (sans some iterations) of SHA-256 in excruciating detail :) I’m glad you’ve made it this far! Going step-by-step through the SHA-256 algorithm isn’t exactly a walk in the park. Learning the fundamentals that underpin web security ca... See full list on blog.boot.dev If you want to see all the steps we just did above in pseudocode form, then here it is, straight from WikiPedia: See full list on blog.boot.dev SHA- 2 is an algorithm , or a generalized idea of how to hash data. SHA- 2 has several variants, all of which use the same algorithm but use different constants. SHA-256, for example, sets additional constants that define the behavior of the SHA- 2 algorithm , one of these constants is the output size, 256. The 256 and 512 in SHA-256 and SHA-512 refer t... See full list on blog.boot.dev SHA- 2 is a successor to the SHA-1 hash and remains one of the strongest hash functions in use today. SHA-256, as opposed to SHA-1, hasn’t been compromised. For this reason, there’s really no reason to use SHA-1 these days, it isn’t safe. The flexibility of output size (224, 256, 512, etc) also allows SHA- 2 to pair well with popular KDFs and ciphers... See full list on blog.boot.dev Apr 20, 2015 · So we call the first two algorithms O(n^2 ), and we call the second O(n). It nicely divides the world up into classes of algorithms. This is what big-O is all about. It's like dividing vehicles up into cars and trucks and busses etc... Oct 5, 2022 · In Big O, there are six major types of complexities (time and space): Constant: O (1) Linear time: O (n) Logarithmic time: O (n log n) Quadratic time: O (n^2 ) Exponential time: O (2^n) Factorial time: O (n!) Before we look at examples for each time complexity, let's understand the Big O time complexity chart. Big O Complexity Chart Mar 15, 2023 · This idea still solves the problem in O (n 2 n2 ) time complexity. We can use any points we want as evaluation points, but by choosing the evaluation points carefully, we can convert between representations in only O (n log n) time. May 30, 2017 · Strictly speaking, shouldn’t you drop the constant and leave only the dominant term? Hence (n^2-n)/2 would end up having a complexity of n^2 or O(n^2 ). In other words saying that the complexity will be (n^2-n)/2 is incorrect."}
+{"idx": 2, "title": "big o - Big O Question about an algorithm with (n^2 + n) / 2 ...", "date": "", "ddg_snippet": "Apr 20, 2015 · So we call the first two algorithms O(n^2 ), and we call the second O(n). It nicely divides the world up into classes of algorithms. This is what big-O is all about. It's like dividing vehicles up into cars and trucks and busses etc...", "subpage_snippet": "", "source": "softwareengineering.stackexchange.com", "link": "https://softwareengineering.stackexchange.com/questions/279609/big-o-question-about-an-algorithm-with-n2-n-2-growth-rate", "content": "Apr 20, 2015 · So we call the first two algorithms O(n^2 ), and we call the second O(n). It nicely divides the world up into classes of algorithms. This is what big-O is all about. It's like dividing vehicles up into cars and trucks and busses etc..."}
+{"idx": 3, "title": "[2112.05682] Self-attention Does Not Need $O (n^2)$ Memory", "date": "", "ddg_snippet": "Dec 10, 2021 · We present a very simple algorithm for attention that requires O (1) memory with respect to sequence length and an extension to self-attention that requires O ( log n ) memory. This is in contrast with the frequently stated belief that self-attention requires O (n2) memory. While the time complexity is still O (n2), device memory rather than compute capability is often the limiting factor on modern ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2112.05682", "content": "Dec 10, 2021 · We present a very simple algorithm for attention that requires O (1) memory with respect to sequence length and an extension to self-attention that requires O ( log n ) memory. This is in contrast with the frequently stated belief that self-attention requires O (n2) memory. While the time complexity is still O (n2), device memory rather than compute capability is often the limiting factor on modern ..."}
+{"idx": 4, "title": "Big O Cheat Sheet – Time Complexity Chart - freeCodeCamp.org", "date": "", "ddg_snippet": "Oct 5, 2022 · In Big O, there are six major types of complexities (time and space): Constant: O (1) Linear time: O (n) Logarithmic time: O (n log n) Quadratic time: O (n^2 ) Exponential time: O (2^n) Factorial time: O (n!) Before we look at examples for each time complexity, let's understand the Big O time complexity chart. Big O Complexity Chart", "subpage_snippet": "", "source": "www.freecodecamp.org", "link": "https://www.freecodecamp.org/news/big-o-cheat-sheet-time-complexity-chart/", "content": "Oct 5, 2022 · In Big O, there are six major types of complexities (time and space): Constant: O (1) Linear time: O (n) Logarithmic time: O (n log n) Quadratic time: O (n^2 ) Exponential time: O (2^n) Factorial time: O (n!) Before we look at examples for each time complexity, let's understand the Big O time complexity chart. Big O Complexity Chart"}
+{"idx": 5, "title": "Fast Fourier Transformation for polynomial multiplication", "date": "", "ddg_snippet": "Mar 15, 2023 · This idea still solves the problem in O (n 2 n2 ) time complexity. We can use any points we want as evaluation points, but by choosing the evaluation points carefully, we can convert between representations in only O (n log n) time.", "subpage_snippet": "", "source": "www.geeksforgeeks.org", "link": "https://www.geeksforgeeks.org/dsa/fast-fourier-transformation-poynomial-multiplication/", "content": "Mar 15, 2023 · This idea still solves the problem in O (n 2 n2 ) time complexity. We can use any points we want as evaluation points, but by choosing the evaluation points carefully, we can convert between representations in only O (n log n) time."}
+{"idx": 6, "title": "Hierarchical Overlapping Clustering on Graphs: Cost ...", "date": "", "ddg_snippet": "by Y Pan — They pro- posed the algorithms that achieve O ( log n )-approximation factors for the four kinds of versions, where n is the number of vertices. The techniques ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=51x0dfsD8A", "content": "by Y Pan — They pro- posed the algorithms that achieve O ( log n )-approximation factors for the four kinds of versions, where n is the number of vertices. The techniques ..."}
+{"idx": 7, "title": "big o - Big-O complexity for n + n-1 + n-2 - Stack Overflow", "date": "", "ddg_snippet": "May 30, 2017 · Strictly speaking, shouldn’t you drop the constant and leave only the dominant term? Hence (n^2-n)/2 would end up having a complexity of n^2 or O(n^2 ). In other words saying that the complexity will be (n^2-n)/2 is incorrect.", "subpage_snippet": "", "source": "stackoverflow.com", "link": "https://stackoverflow.com/questions/44252596/big-o-complexity-for-n-n-1-n-2-n-3-1", "content": "May 30, 2017 · Strictly speaking, shouldn’t you drop the constant and leave only the dominant term? Hence (n^2-n)/2 would end up having a complexity of n^2 or O(n^2 ). In other words saying that the complexity will be (n^2-n)/2 is incorrect."}

data/sampled_jsons/ACIDDnTbSJ_Feint_Behaviors_and_Strategies_Section_4.2.2_scheduler_weights_lambda_short_lambda_long.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Feint Behaviors and Strategies : Formalization, Implementation and...", "date": "", "ddg_snippet": "Feint behaviors refer to a set of deceptive behaviors in a nuanced manner, which enable players to obtain temporal and spatial advantages over opponents in competitive games.", "subpage_snippet": "", "source": "papers.cool", "link": "https://papers.cool/venue/ACIDDnTbSJ@OpenReview", "content": "Feint behaviors refer to a set of deceptive behaviors in a nuanced manner, which enable players to obtain temporal and spatial advantages over opponents in competitive games."}
+{"idx": 1, "title": "xAI launches Grok-4-Fast: Unified Reasoning and... - MarkTechPost", "date": "", "ddg_snippet": "xAI introduced Grok-4-Fast, a cost-optimized successor to Grok-4 that merges “reasoning” and “non-reasoning” behaviors into a single set of weights controllable via system prompts.", "subpage_snippet": "", "source": "www.marktechpost.com", "link": "https://www.marktechpost.com/2025/09/20/xai-launches-grok-4-fast-unified-reasoning-and-non-reasoning-model-with-2m-token-context-and-trained-end-to-end-with-tool-use-reinforcement-learning-rl/", "content": "xAI introduced Grok-4-Fast, a cost-optimized successor to Grok-4 that merges “reasoning” and “non-reasoning” behaviors into a single set of weights controllable via system prompts."}
+{"idx": 2, "title": "Feint Behaviors and Strategies : Formalization, Implementation and...", "date": "", "ddg_snippet": "Full paper. ACIDDnTbSJ . This figure shows an example of unsuccessful Feint behavior due to its long duration. The timeline is divided into three key time points: tB1 (end of NPC B’s first defense behavior ), tA2 (estimated start of NPC A’s second beha...", "subpage_snippet": "", "source": "deep-diver.github.io", "link": "https://deep-diver.github.io/neurips2024/posters/aciddntbsj/", "content": "Full paper. ACIDDnTbSJ . This figure shows an example of unsuccessful Feint behavior due to its long duration. The timeline is divided into three key time points: tB1 (end of NPC B’s first defense behavior ), tA2 (estimated start of NPC A’s second beha..."}
+{"idx": 3, "title": "Lambda expressions (since C++11) - cppreference.com", "date": "", "ddg_snippet": "Metaprogramming library. General utilities library. Containers library. Iterators library. Ranges library. Algorithms library. Strings library. Text processing library. Numerics library. Date and time library. Input/output library. Filesystem library...", "subpage_snippet": "", "source": "en.cppreference.com", "link": "https://en.cppreference.com/w/cpp/language/lambda.html", "content": "Metaprogramming library. General utilities library. Containers library. Iterators library. Ranges library. Algorithms library. Strings library. Text processing library. Numerics library. Date and time library. Input/output library. Filesystem library..."}
+{"idx": 4, "title": "Google Scholar", "date": "", "ddg_snippet": "Google Scholar provides a simple way to broadly search for scholarly literature. Search across a wide variety of disciplines and sources: articles, theses, books, abstracts and court opinions.", "subpage_snippet": "", "source": "scholar.google.com", "link": "https://scholar.google.com/schhp?hl=en&as_sdt=0,5", "content": "Google Scholar provides a simple way to broadly search for scholarly literature. Search across a wide variety of disciplines and sources: articles, theses, books, abstracts and court opinions."}
+{"idx": 5, "title": "Lambda Anti-Pattern: Functions Calling Functions | Orchestra", "date": "", "ddg_snippet": "Learn about Anti-patterns in Lambda -based applications in AWS lambda and how Orchestra can help you integrate AWS Lambda with data pipelines: Lambda functions calling Lambda functions.", "subpage_snippet": "", "source": "www.getorchestra.io", "link": "https://www.getorchestra.io/guides/lambda-anti-pattern-functions-calling-functions", "content": "Learn about Anti-patterns in Lambda -based applications in AWS lambda and how Orchestra can help you integrate AWS Lambda with data pipelines: Lambda functions calling Lambda functions."}
+{"idx": 6, "title": "ГДЗ по английскому языку 6 класс (spotlight) Ваулина - рабочая...", "date": "", "ddg_snippet": "24 4c My favourite day 25 4d Writing (a short text about a person) 26 Grammar Practice 27. Module 5. 29.Pairwork activities 65. Student A 65 Student B 71. Revision Section 77.", "subpage_snippet": "", "source": "gdz.top", "link": "https://gdz.top/6-klass/english/vaulina-spotlight-rabochaja-tetrad", "content": "24 4c My favourite day 25 4d Writing (a short text about a person) 26 Grammar Practice 27. Module 5. 29.Pairwork activities 65. Student A 65 Student B 71. Revision Section 77."}
+{"idx": 7, "title": "NHL Schedule - 2025 Season - ESPN", "date": "", "ddg_snippet": "The complete 2025 NHL season schedule on ESPN. Includes game times, TV listings and ticket information for all NHL games.", "subpage_snippet": "", "source": "www.espn.com", "link": "https://www.espn.com/nhl/schedule", "content": "The complete 2025 NHL season schedule on ESPN. Includes game times, TV listings and ticket information for all NHL games."}
+{"idx": 8, "title": "Lambda в Python: синтаксис, аргументы и много примеров...", "date": "", "ddg_snippet": "Все, что нужно знать о lambda -функциях в Python. В этой статье вы узнаете о том, что такое лямбда-функции в Python.", "subpage_snippet": "", "source": "PythonRu.com", "link": "https://PythonRu.com/osnovy/vse-chto-nuzhno-znat-o-lambda-funkcijah-v-python", "content": "Все, что нужно знать о lambda -функциях в Python. В этой статье вы узнаете о том, что такое лямбда-функции в Python."}
+{"idx": 9, "title": "[LYRICS] Feint - Snake Eyes (ft. CoMa) - YouTube", "date": "", "ddg_snippet": "This is a lyrics video. I am not affiliated with any artists or labels.- - - ᴅᴏᴡɴʟᴏᴀᴅs - - -Download the song ↓Beatport: http://btprt.dj/RDu7HNDNB, so cl...", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=tx6v2lWRrZ4", "content": "This is a lyrics video. I am not affiliated with any artists or labels.- - - ᴅᴏᴡɴʟᴏᴀᴅs - - -Download the song ↓Beatport: http://btprt.dj/RDu7HNDNB, so cl..."}

data/sampled_jsons/A_Likelihood_Based_Approach_to_Distribution_Regression_Using_Conditional_Deep_Generative_Models.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Flow-based generative model - Wikipedia", "date": "", "ddg_snippet": "A flow- based generative model is a generative model used in machine learning that explicitly models a probability distribution by leveraging ...", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/Flow-based_generative_model", "content": "A flow- based generative model is a generative model used in machine learning that explicitly models a probability distribution by leveraging ..."}
+{"idx": 1, "title": "Graphical model - Wikipedia", "date": "", "ddg_snippet": "Generally, probabilistic graphical models use a graph- based representation as the foundation for encoding a distribution over a multi-dimensional ...", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/Graphical_model", "content": "Generally, probabilistic graphical models use a graph- based representation as the foundation for encoding a distribution over a multi-dimensional ..."}
+{"idx": 2, "title": "Generative model - Wikipedia", "date": "", "ddg_snippet": "... generative model \" is also used to describe models that generate instances of output variables in a way that has no clear relationship to probability ...", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/Generative_model", "content": "... generative model \" is also used to describe models that generate instances of output variables in a way that has no clear relationship to probability ..."}
+{"idx": 3, "title": "A LIKELIHOOD BASED APPROACH TO DISTRIBUTION REGRESSION USING ...", "date": "", "ddg_snippet": "solely on the intrinsic dimension and smoothness of the true conditional distribution . These findings provide an explanation of why conditional deep gen - erative models can circumvent the curse of dimensionality from the perspective of statistical foundations and demons", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=V6hhhXoTSq", "content": "solely on the intrinsic dimension and smoothness of the true conditional distribution . These findings provide an explanation of why conditional deep gen - erative models can circumvent the curse of dimensionality from the perspective of statistical foundations and demons"}
+{"idx": 4, "title": "A Likelihood Based Approach to Distribution Regression Using ...", "date": "", "ddg_snippet": "Oct 2, 2024 · In this work, we explore the theoretical properties of conditional deep generative models under the statistical framework of distribution regression where the response variable lies in...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/384630603_A_Likelihood_Based_Approach_to_Distribution_Regression_Using_Conditional_Deep_Generative_Models", "content": "Oct 2, 2024 · In this work, we explore the theoretical properties of conditional deep generative models under the statistical framework of distribution regression where the response variable lies in..."}
+{"idx": 5, "title": "ICML Poster A Likelihood Based Approach to Distribution ...", "date": "", "ddg_snippet": "In this work, we explore the theoretical properties of conditional deep generative models under the statistical framework of distribution regression where the response variable lies in a high-dimensional ambient space but concentrates around a potentially lower-dimensional manifold.", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/46645", "content": "In this work, we explore the theoretical properties of conditional deep generative models under the statistical framework of distribution regression where the response variable lies in a high-dimensional ambient space but concentrates around a potentially lower-dimensional manifold."}
+{"idx": 6, "title": "A Likelihood Based Approach to Distribution Regression Using ...", "date": "", "ddg_snippet": "Our approach simultaneously estimates a regression function and a conditional generator using a generative learning framework, where a conditional generator is a function that can generate samples from a conditional distribution .", "subpage_snippet": "", "source": "bohrium.dp.tech", "link": "https://bohrium.dp.tech/paper/arxiv/2410.02025", "content": "Our approach simultaneously estimates a regression function and a conditional generator using a generative learning framework, where a conditional generator is a function that can generate samples from a conditional distribution ."}
+{"idx": 7, "title": "A Likelihood Based Approach to Distribution Regression Using ...", "date": "", "ddg_snippet": "To the best of our knowledge, our study is the first attempt to explore the likelihood - based approach for distributional regression using a conditional deep generative model , considering full-dimensional noise and the potential presence of singular underlying support.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2410.02025v1", "content": "To the best of our knowledge, our study is the first attempt to explore the likelihood - based approach for distributional regression using a conditional deep generative model , considering full-dimensional noise and the potential presence of singular underlying support."}
+{"idx": 8, "title": "A Likelihood Approach to Nonparametric Estimation of a ...", "date": "", "ddg_snippet": "We investigate statistical properties of a likelihood approach to nonparametric estimation of a singular distribution using deep generative models . More speci cally, a deep generative model is used to model high-dimensional data that are assumed to concentrate around some low-dimensional structure.", "subpage_snippet": "", "source": "jmlr.org", "link": "https://jmlr.org/papers/volume24/21-1099/21-1099.pdf", "content": "We investigate statistical properties of a likelihood approach to nonparametric estimation of a singular distribution using deep generative models . More speci cally, a deep generative model is used to model high-dimensional data that are assumed to concentrate around some low-dimensional structure."}
+{"idx": 9, "title": "Newest 'normal-distribution' Questions - Cross Validated", "date": "", "ddg_snippet": "... distribution comes when we try ... I'm trying to calculate the 50% confidence interval of the true mean based on a sample of a gaussian distribution .", "subpage_snippet": "", "source": "stats.stackexchange.com", "link": "https://stats.stackexchange.com/questions/tagged/normal-distribution", "content": "... distribution comes when we try ... I'm trying to calculate the 50% confidence interval of the true mean based on a sample of a gaussian distribution ."}

data/sampled_jsons/A_Mathematical_Framework_for_Transformer_Circuits_abstract_Elhage_year_2021.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "A Mathematical Framework for Transformer Circuits", "date": "", "ddg_snippet": "Nelson Elhage ∗†, Neel Nanda ∗, Catherine Olsson ∗, Tom Henighan †, Nicholas Joseph †, Ben Mann †, Amanda Askell, Yuntao Bai, Anna Chen, Tom Conerly, Nova DasSarma, Dawn Drain, Deep Ganguli, Zac Hatfield-Dodds, Danny Hernandez, Andy Jones, Jackson Kernion, Liane Lovitt, Kamal Ndousse, Dario Amodei, Tom Brown, Jack Clark, Jared ...", "subpage_snippet": "", "source": "transformer-circuits.pub", "link": "https://transformer-circuits.pub/2021/framework/index.html", "content": "Nelson Elhage ∗†, Neel Nanda ∗, Catherine Olsson ∗, Tom Henighan †, Nicholas Joseph †, Ben Mann †, Amanda Askell, Yuntao Bai, Anna Chen, Tom Conerly, Nova DasSarma, Dawn Drain, Deep Ganguli, Zac Hatfield-Dodds, Danny Hernandez, Andy Jones, Jackson Kernion, Liane Lovitt, Kamal Ndousse, Dario Amodei, Tom Brown, Jack Clark, Jared ..."}
+{"idx": 1, "title": "framework-transformer-circuits.pdf", "date": "", "ddg_snippet": "A foundational article for understanding inner workings of transformer architecture. - Antrophic, A Mathematical Framework for Transformer Circuits . Page 5. 1 ...", "subpage_snippet": "", "source": "jungwooyang.com", "link": "https://jungwooyang.com/assets/files/framework-transformer-circuits.pdf", "content": "A foundational article for understanding inner workings of transformer architecture. - Antrophic, A Mathematical Framework for Transformer Circuits . Page 5. 1 ..."}
+{"idx": 2, "title": "A Mathematical Framework For Transformer Circuits", "date": "", "ddg_snippet": "The document discusses a mathematical framework for understanding transformer circuits, focusing on reverse engineering simple transformer models to uncover their internal operations. It highlights the importance of attention heads, particularly 'induction heads', in facilitating in-context learning and outlines key findings about the algorithms used by one and two-layer attention-only ...", "subpage_snippet": "", "source": "www.scribd.com", "link": "https://www.scribd.com/document/866284321/A-Mathematical-Framework-for-Transformer-Circuits", "content": "The document discusses a mathematical framework for understanding transformer circuits, focusing on reverse engineering simple transformer models to uncover their internal operations. It highlights the importance of attention heads, particularly 'induction heads', in facilitating in-context learning and outlines key findings about the algorithms used by one and two-layer attention-only ..."}
+{"idx": 3, "title": "A Mathematical Framework for Transformer Circuits - Oxen", "date": "", "ddg_snippet": "Mathematical Framework for Transformer Circuits The paper can be found here:", "subpage_snippet": "", "source": "www.oxen.ai", "link": "https://www.oxen.ai/blog/arxiv-dives-a-mathematical-framework-for-transformer-circuits", "content": "Mathematical Framework for Transformer Circuits The paper can be found here:"}
+{"idx": 4, "title": "A Mathematical Framework for Transformer Circuits - Tom Bewley", "date": "", "ddg_snippet": "A Mathematical Framework for Transformer Circuits 2 minute read 2021 #Content/Paper by Nelson Elhage , Neel Nanda, Catherine Olsson, Tom Henighan, Nicholas Joseph, Ben Mann, Amanda Askell, Yuntao Bai, Anna Chen, Tom Conerly, Nova DasSarma, Dawn Drain, Deep Ganguli, Zac Hatfield-Dodds, Danny Hernandez, Andy Jones, Jackson Kernion, Liane Lovitt, Kamal Ndousse, Dario Amodei, Tom Brown, Jack Clark ...", "subpage_snippet": "", "source": "tombewley.com", "link": "https://tombewley.com/notes/A+Mathematical+Framework+for+Transformer+Circuits", "content": "A Mathematical Framework for Transformer Circuits 2 minute read 2021 #Content/Paper by Nelson Elhage , Neel Nanda, Catherine Olsson, Tom Henighan, Nicholas Joseph, Ben Mann, Amanda Askell, Yuntao Bai, Anna Chen, Tom Conerly, Nova DasSarma, Dawn Drain, Deep Ganguli, Zac Hatfield-Dodds, Danny Hernandez, Andy Jones, Jackson Kernion, Liane Lovitt, Kamal Ndousse, Dario Amodei, Tom Brown, Jack Clark ..."}
+{"idx": 5, "title": "A Mathematical Framework for Transformer Circuits", "date": "", "ddg_snippet": "We don't attempt to apply to our insights to larger models in this first paper, but in a forthcoming paper, we will show that both our mathematical framework for understanding transformers, and the concept of induction heads, continues to be at least partially relevant for much larger and more realistic models - though we remain a very long way from being able to fully reverse engineer ...", "subpage_snippet": "", "source": "dgcnz.github.io", "link": "https://dgcnz.github.io/second-brain/100+Reference+notes/101+Literature/A+Mathematical+Framework+for+Transformer+Circuits/", "content": "We don't attempt to apply to our insights to larger models in this first paper, but in a forthcoming paper, we will show that both our mathematical framework for understanding transformers, and the concept of induction heads, continues to be at least partially relevant for much larger and more realistic models - though we remain a very long way from being able to fully reverse engineer ..."}
+{"idx": 6, "title": "Transformer Circuits: A Mathematical Framework - studylib.net", "date": "", "ddg_snippet": "Explore a mathematical framework for transformer circuits , focusing on attention mechanisms and in-context learning. AI, Machine Learning research.", "subpage_snippet": "", "source": "studylib.net", "link": "https://studylib.net/doc/27496897/transformer-circui...--1-", "content": "Explore a mathematical framework for transformer circuits , focusing on attention mechanisms and in-context learning. AI, Machine Learning research."}
+{"idx": 7, "title": "A Mathematical Framework for Transformer Circuits - Amanda Askell", "date": "", "ddg_snippet": "Recommended citation: Nelson Elhage , Neel Nanda, Catherine Olsson, Tom Henighan, Nicholas Joseph, Ben Mann, Amanda Askell, Yuntao Bai, Anna Chen, Tom Conerly, Nova DasSarma, Dawn Drain, Deep Ganguli, Zac Hatfield-Dodds, Danny Hernandez, Andy Jones, Jackson Kernion, Liane Lovitt, Kamal Ndousse, Dario Amodei, Tom Brown, Jack Clark, Jared Kaplan ...", "subpage_snippet": "", "source": "askell.io", "link": "https://askell.io/publication/transformer-circuits", "content": "Recommended citation: Nelson Elhage , Neel Nanda, Catherine Olsson, Tom Henighan, Nicholas Joseph, Ben Mann, Amanda Askell, Yuntao Bai, Anna Chen, Tom Conerly, Nova DasSarma, Dawn Drain, Deep Ganguli, Zac Hatfield-Dodds, Danny Hernandez, Andy Jones, Jackson Kernion, Liane Lovitt, Kamal Ndousse, Dario Amodei, Tom Brown, Jack Clark, Jared Kaplan ..."}
+{"idx": 8, "title": "A Walkthrough of A Mathematical Framework for Transformer Circuits", "date": "", "ddg_snippet": "A Mathematical Framework for Transformer Circuits is, in my opinion, the coolest paper I've ever had the privilege of working on. But it's also very long and dense and at times confusing, and this makes me sad!", "subpage_snippet": "", "source": "www.neelnanda.io", "link": "https://www.neelnanda.io/mechanistic-interpretability/a-walkthrough-of-a-mathematical-framework-for-transformer-circuits", "content": "A Mathematical Framework for Transformer Circuits is, in my opinion, the coolest paper I've ever had the privilege of working on. But it's also very long and dense and at times confusing, and this makes me sad!"}
+{"idx": 9, "title": "A Mathematical Framework for Transformer Circuits", "date": "", "ddg_snippet": "A Mathematical Framework for Transformer Circuits ; Anthropic Economic Index report: Uneven geographic and enterprise AI adoption. Sep 15, 2025.", "subpage_snippet": "", "source": "www.anthropic.com", "link": "https://www.anthropic.com/research/a-mathematical-framework-for-transformer-circuits", "content": "A Mathematical Framework for Transformer Circuits ; Anthropic Economic Index report: Uneven geographic and enterprise AI adoption. Sep 15, 2025."}

data/sampled_jsons/A_cost_function_for_similarity-based_hierarchical_clustering_Dasgupta_2016_abstract_year_2016.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "A cost function for similarity-based hierarchical clustering", "date": "", "ddg_snippet": "by S Dasgupta · 2015 · Cited by 275 — We introduce a simple cost function on hierarchies over a set of points, given pairwise similarities between those points.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/1510.05043", "content": "by S Dasgupta · 2015 · Cited by 275 — We introduce a simple cost function on hierarchies over a set of points, given pairwise similarities between those points."}
+{"idx": 1, "title": "A cost function for similarity-based hierarchical clustering", "date": "", "ddg_snippet": "We introduce a simple cost function on hierarchies over a set of points, given pairwise similarities between those points.", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/10.1145/2897518.2897527", "content": "We introduce a simple cost function on hierarchies over a set of points, given pairwise similarities between those points."}
+{"idx": 2, "title": "A cost function for similarity-based hierarchical clustering", "date": "", "ddg_snippet": "by S Dasgupta · 2016 · Cited by 275 — In this work we introduce a simple cost function for hierarchical clustering: a function that, given pairwise similarities between data points, assigns a score ... 18 pages", "subpage_snippet": "", "source": "cseweb.ucsd.edu", "link": "https://cseweb.ucsd.edu/~dasgupta/papers/hier-cost.pdf", "content": "by S Dasgupta · 2016 · Cited by 275 — In this work we introduce a simple cost function for hierarchical clustering: a function that, given pairwise similarities between data points, assigns a score ... 18 pages"}
+{"idx": 3, "title": "Hierarchical Overlapping Clustering on Graphs: Cost ...", "date": "", "ddg_snippet": "by Y Pan — Dasgupta, S. A cost function for similarity-based hierarchi- cal clustering . In Proceedings of the Forty-eighth Annual. ACM Symposium on Theory of Computing ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=51x0dfsD8A", "content": "by Y Pan — Dasgupta, S. A cost function for similarity-based hierarchi- cal clustering . In Proceedings of the Forty-eighth Annual. ACM Symposium on Theory of Computing ..."}
+{"idx": 4, "title": "A Revenue Function for Comparison-Based Hierarchical ...", "date": "", "ddg_snippet": "by A Mandal · 2022 · Cited by 3 — We show that this function is closely related to Dasgupta's cost for hierarchical clustering that uses pairwise similarities. On the theoretical ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2211.16459", "content": "by A Mandal · 2022 · Cited by 3 — We show that this function is closely related to Dasgupta's cost for hierarchical clustering that uses pairwise similarities. On the theoretical ..."}
+{"idx": 5, "title": "Foundations of Comparison-Based Hierarchical Clustering", "date": "", "ddg_snippet": "by D Ghoshdastidar · Cited by 41 — Dasgupta, S. (2016). A cost function for similarity-based hierarchical clustering . In Symposium on. Theory of Computing, pages 118–127. Emamjomeh-Zadeh, E ...", "subpage_snippet": "", "source": "papers.neurips.cc", "link": "http://papers.neurips.cc/paper/8964-foundations-of-comparison-based-hierarchical-clustering.pdf", "content": "by D Ghoshdastidar · Cited by 41 — Dasgupta, S. (2016). A cost function for similarity-based hierarchical clustering . In Symposium on. Theory of Computing, pages 118–127. Emamjomeh-Zadeh, E ..."}
+{"idx": 6, "title": "An Information-theoretic Perspective of Hierarchical ...", "date": "", "ddg_snippet": "by Y Pan · Cited by 10 — 2007. 395. [10] Sanjoy Dasgupta. A cost function for similarity-based hierarchical clustering . In Daniel Wichs. 396 and Yishay Mansour, editors, Proceedings ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=LPB2BFZvncQ", "content": "by Y Pan · Cited by 10 — 2007. 395. [10] Sanjoy Dasgupta. A cost function for similarity-based hierarchical clustering . In Daniel Wichs. 396 and Yishay Mansour, editors, Proceedings ..."}
+{"idx": 7, "title": "Hierarchical Clustering: New Bounds and Objective", "date": "", "ddg_snippet": "by M Rahgoshay · 2021 · Cited by 4 — He defined a cost function for a tree $T$ to be $ Cost(T) = \\sum_{i,j \\in [n]} \\big(w_{i,j} \\times |T_{i,j}| \\big )$ where $T_{i,j}$ is the subtree rooted at the ...", "subpage_snippet": "", "source": "ui.adsabs.harvard.edu", "link": "https://ui.adsabs.harvard.edu/abs/2021arXiv211106863R/abstract", "content": "by M Rahgoshay · 2021 · Cited by 4 — He defined a cost function for a tree $T$ to be $ Cost(T) = \\sum_{i,j \\in [n]} \\big(w_{i,j} \\times |T_{i,j}| \\big )$ where $T_{i,j}$ is the subtree rooted at the ..."}
+{"idx": 8, "title": "Hierarchical Clustering: Objective Functions and Algorithms", "date": "", "ddg_snippet": "[21] Sanjoy Dasgupta. A cost function for similarity-based hierarchical clustering . In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of ...", "subpage_snippet": "", "source": "dspace.mit.edu", "link": "https://dspace.mit.edu/bitstream/handle/1721.1/121430/main_openaccess.pdf;jsessionid=91FF840BBE185F0BEDA735618FE63D41?sequence=1", "content": "[21] Sanjoy Dasgupta. A cost function for similarity-based hierarchical clustering . In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of ..."}
+{"idx": 9, "title": "UCSB CS Theory Colloquium Series", "date": "", "ddg_snippet": "A cost function for similarity-based hierarchical clustering . STOC 2016. 2. Explainable k-means clustering. Common clustering algorithms return clusters ...", "subpage_snippet": "", "source": "sites.cs.ucsb.edu", "link": "https://sites.cs.ucsb.edu/~vigoda/theory/F21/Sanjoy.html", "content": "A cost function for similarity-based hierarchical clustering . STOC 2016. 2. Explainable k-means clustering. Common clustering algorithms return clusters ..."}

data/sampled_jsons/Algorithm_2_Tanh_Demon_adaptive_temperature_τ_calculation_standard_deviation_R_k_reward.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Standard deviation - Wikipedia", "date": "", "ddg_snippet": "A useful property of the standard deviation is that, unlike the variance, it is expressed in the same unit as the data. Standard deviation can also be used to calculate standard error for a finite sample, and to determine statistical significance.", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/Standard_deviation", "content": "A useful property of the standard deviation is that, unlike the variance, it is expressed in the same unit as the data. Standard deviation can also be used to calculate standard error for a finite sample, and to determine statistical significance."}
+{"idx": 1, "title": "Training-free Diffusion Model Alignment with Sampling Demons", "date": "", "ddg_snippet": "Algorithm 2 Tanh Demon with Adaptive Temperature . 1: Input: A list of ODE reward estimate.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2410.05760v1", "content": "Algorithm 2 Tanh Demon with Adaptive Temperature . 1: Input: A list of ODE reward estimate."}
+{"idx": 2, "title": "How To Calculate The Standard Deviation - YouTube", "date": "", "ddg_snippet": "This Statistics video tutorial explains how to calculate the standard deviation using 2 examples.", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=IaTFpp-uzp0", "content": "This Statistics video tutorial explains how to calculate the standard deviation using 2 examples."}
+{"idx": 3, "title": "Standard Deviation - Formula | How to Calculate Standard Deviation ?", "date": "", "ddg_snippet": "The calculations for standard deviation differ for different data. Distribution measures the deviation of data from its mean or average position. There are three methods to find the standard deviation .", "subpage_snippet": "", "source": "www.cuemath.com", "link": "https://www.cuemath.com/data/standard-deviation/", "content": "The calculations for standard deviation differ for different data. Distribution measures the deviation of data from its mean or average position. There are three methods to find the standard deviation ."}
+{"idx": 4, "title": "Standard Deviation Formulas", "date": "", "ddg_snippet": "Standard Deviation Formulas. Deviation means how far from the normal.To calculate the standard deviation of those numbers: 1. Work out the Mean (the simple average of the numbers). 2 . Then for each number: subtract the Mean and square the result.", "subpage_snippet": "", "source": "www.mathsisfun.com", "link": "https://www.mathsisfun.com/data/standard-deviation-formulas.html", "content": "Standard Deviation Formulas. Deviation means how far from the normal.To calculate the standard deviation of those numbers: 1. Work out the Mean (the simple average of the numbers). 2 . Then for each number: subtract the Mean and square the result."}
+{"idx": 5, "title": "Standard Deviation Formula and Uses, vs. Variance", "date": "", "ddg_snippet": "Calculating Standard Deviation . Standard deviation is calculated as follows: Calculate the mean of all data points: Add the data point values and divide by the number of data points.", "subpage_snippet": "", "source": "www.investopedia.com", "link": "https://www.investopedia.com/terms/s/standarddeviation.asp", "content": "Calculating Standard Deviation . Standard deviation is calculated as follows: Calculate the mean of all data points: Add the data point values and divide by the number of data points."}
+{"idx": 6, "title": "How to Calculate Standard Deviation ? - GeeksforGeeks", "date": "", "ddg_snippet": "Steps for Calculations of Standard Deviation . We can calculate the standard deviation using following steps: Step 1: Calculate the mean (average) of the data set.", "subpage_snippet": "", "source": "www.geeksforgeeks.org", "link": "https://www.geeksforgeeks.org/maths/how-to-calculate-standard-deviation/", "content": "Steps for Calculations of Standard Deviation . We can calculate the standard deviation using following steps: Step 1: Calculate the mean (average) of the data set."}
+{"idx": 7, "title": "Standard Deviation Calculator", "date": "", "ddg_snippet": "Use this calculator to easily calculate the standard deviation of a sample, or to estimate the population standard deviation based on a random sample from it. Standard deviation for binomial data.", "subpage_snippet": "", "source": "www.gigacalculator.com", "link": "https://www.gigacalculator.com/calculators/standard-deviation-calculator.php", "content": "Use this calculator to easily calculate the standard deviation of a sample, or to estimate the population standard deviation based on a random sample from it. Standard deviation for binomial data."}
+{"idx": 8, "title": "Standard deviation : calculating step by step (article) | Khan Academy", "date": "", "ddg_snippet": "Calculating standard deviation step by step. Standard deviation of a population.", "subpage_snippet": "", "source": "www.khanacademy.org", "link": "https://www.khanacademy.org/math/statistics-probability/summarizing-quantitative-data/variance-standard-deviation-population/a/calculating-standard-deviation-step-by-step", "content": "Calculating standard deviation step by step. Standard deviation of a population."}
+{"idx": 9, "title": "Calculate the standard deviation of the following data: 10, 20, 15...", "date": "", "ddg_snippet": "For calculating mean, we will divide the sum of given terms by the number of terms. After that, we will take derivatives from mean in the frequency distribution table and then square those deviations . Using all the columns we will find standard deviation of the data using formula.", "subpage_snippet": "", "source": "www.vedantu.com", "link": "https://www.vedantu.com/question-answer/calculate-the-standard-deviation-of-the-class-11-maths-cbse-5faf9c9a4855db14f9d07879", "content": "For calculating mean, we will divide the sum of given terms by the number of terms. After that, we will take derivatives from mean in the frequency distribution table and then square those deviations . Using all the columns we will find standard deviation of the data using formula."}

data/sampled_jsons/Beimel_Dynamic_Algorithms_Adaptive_Adversary_full_paper_returns_solution.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Dynamic Algorithms against an Adaptive Adversary: Generic ... DynamicAlgorithmsAgainstanAdaptiveAdversary ... [PDF] Dynamic algorithms against an adaptive adversary ... Dynamic Algorithms Against an Adaptive Adversary: Generic ... Rounding Dynamic Matchings Against an Adaptive Adversary Dynamic algorithms against an adaptive adversary: generic ... Dynamic Algorithms Against an Adaptive Adversary: Generic ...", "date": "", "ddg_snippet": "A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm . We obtain faster dynamic algorithms against an adap- tive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. Nov 9, 2021 · A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm . We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy ... A general reduction is given transforming a dynamic algorithm against an oblivious adversary to a dynamic algorithms robust against an adaptive adversary , which maintains several copies of the oblivious algorithm and uses differential privacy to protect their random bits. Given an input that undergoes a sequence of updates, a dynamic algorithm maintains a valid solution to some predefined ... Nov 7, 2021 · A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm . We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy ... This paper provides the first randomized dynamic matching algorithms which work against adaptive adversaries and outperform deterministic algorithms for this problem. Author (s) / Creator (s): Beimel , Amos; Kaplan, Haim; Mansour, Yishay; Nissim, Kobbi; Saranurak, Thatchaphol; Stemmer, Uri Date Published: 2022-06-01 Journal Name: STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Page Range / eLocation ID: 1671 to 1684 Format (s): Medium: X Sponsoring Org: National Science ... We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy, cryptography, and adaptive data analysis.", "subpage_snippet": "", "source": "par.nsf.gov", "link": "https://par.nsf.gov/servlets/purl/10440813", "content": "A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm . We obtain faster dynamic algorithms against an adap- tive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. Nov 9, 2021 · A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm . We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy ... A general reduction is given transforming a dynamic algorithm against an oblivious adversary to a dynamic algorithms robust against an adaptive adversary , which maintains several copies of the oblivious algorithm and uses differential privacy to protect their random bits. Given an input that undergoes a sequence of updates, a dynamic algorithm maintains a valid solution to some predefined ... Nov 7, 2021 · A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm . We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy ... This paper provides the first randomized dynamic matching algorithms which work against adaptive adversaries and outperform deterministic algorithms for this problem. Author (s) / Creator (s): Beimel , Amos; Kaplan, Haim; Mansour, Yishay; Nissim, Kobbi; Saranurak, Thatchaphol; Stemmer, Uri Date Published: 2022-06-01 Journal Name: STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Page Range / eLocation ID: 1671 to 1684 Format (s): Medium: X Sponsoring Org: National Science ... We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy, cryptography, and adaptive data analysis."}
+{"idx": 1, "title": "DynamicAlgorithmsAgainstanAdaptiveAdversary ...", "date": "", "ddg_snippet": "Nov 9, 2021 · A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm . We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2111.03980", "content": "Nov 9, 2021 · A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm . We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy ..."}
+{"idx": 2, "title": "[PDF] Dynamic algorithms against an adaptive adversary ...", "date": "", "ddg_snippet": "A general reduction is given transforming a dynamic algorithm against an oblivious adversary to a dynamic algorithms robust against an adaptive adversary , which maintains several copies of the oblivious algorithm and uses differential privacy to protect their random bits. Given an input that undergoes a sequence of updates, a dynamic algorithm maintains a valid solution to some predefined ...", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/Dynamic-algorithms-against-an-adaptive-adversary:-Beimel-Kaplan/aa9988bf55a092f8050b11818ca3647543263351", "content": "A general reduction is given transforming a dynamic algorithm against an oblivious adversary to a dynamic algorithms robust against an adaptive adversary , which maintains several copies of the oblivious algorithm and uses differential privacy to protect their random bits. Given an input that undergoes a sequence of updates, a dynamic algorithm maintains a valid solution to some predefined ..."}
+{"idx": 3, "title": "Dynamic Algorithms Against an Adaptive Adversary: Generic ... Rounding Dynamic Matchings Against an Adaptive Adversary Dynamic algorithms against an adaptive adversary: generic ... Dynamic Algorithms Against an Adaptive Adversary: Generic ...", "date": "", "ddg_snippet": "Nov 7, 2021 · A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm . We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy ... This paper provides the first randomized dynamic matching algorithms which work against adaptive adversaries and outperform deterministic algorithms for this problem. Author (s) / Creator (s): Beimel , Amos; Kaplan, Haim; Mansour, Yishay; Nissim, Kobbi; Saranurak, Thatchaphol; Stemmer, Uri Date Published: 2022-06-01 Journal Name: STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Page Range / eLocation ID: 1671 to 1684 Format (s): Medium: X Sponsoring Org: National Science ... We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy, cryptography, and adaptive data analysis.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2111.03980", "content": "Nov 7, 2021 · A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm . We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy ... This paper provides the first randomized dynamic matching algorithms which work against adaptive adversaries and outperform deterministic algorithms for this problem. Author (s) / Creator (s): Beimel , Amos; Kaplan, Haim; Mansour, Yishay; Nissim, Kobbi; Saranurak, Thatchaphol; Stemmer, Uri Date Published: 2022-06-01 Journal Name: STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Page Range / eLocation ID: 1671 to 1684 Format (s): Medium: X Sponsoring Org: National Science ... We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy, cryptography, and adaptive data analysis."}
+{"idx": 4, "title": "Rounding Dynamic Matchings Against an Adaptive Adversary", "date": "", "ddg_snippet": "This paper provides the first randomized dynamic matching algorithms which work against adaptive adversaries and outperform deterministic algorithms for this problem.", "subpage_snippet": "", "source": "www.cs.cmu.edu", "link": "https://www.cs.cmu.edu/~dwajc/pdfs/wajc19.pdf", "content": "This paper provides the first randomized dynamic matching algorithms which work against adaptive adversaries and outperform deterministic algorithms for this problem."}
+{"idx": 5, "title": "Dynamic algorithms against an adaptive adversary: generic ...", "date": "", "ddg_snippet": "Author (s) / Creator (s): Beimel , Amos; Kaplan, Haim; Mansour, Yishay; Nissim, Kobbi; Saranurak, Thatchaphol; Stemmer, Uri Date Published: 2022-06-01 Journal Name: STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Page Range / eLocation ID: 1671 to 1684 Format (s): Medium: X Sponsoring Org: National Science ...", "subpage_snippet": "", "source": "par.nsf.gov", "link": "https://par.nsf.gov/biblio/10440813-dynamic-algorithms-against-adaptive-adversary-generic-constructions-lower-bounds", "content": "Author (s) / Creator (s): Beimel , Amos; Kaplan, Haim; Mansour, Yishay; Nissim, Kobbi; Saranurak, Thatchaphol; Stemmer, Uri Date Published: 2022-06-01 Journal Name: STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing Page Range / eLocation ID: 1671 to 1684 Format (s): Medium: X Sponsoring Org: National Science ..."}
+{"idx": 6, "title": "Dynamic Algorithms Against an Adaptive Adversary: Generic ...", "date": "", "ddg_snippet": "We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy, cryptography, and adaptive data analysis.", "subpage_snippet": "", "source": "ar5iv.labs.arxiv.org", "link": "https://ar5iv.labs.arxiv.org/html/2111.03980", "content": "We obtain faster dynamic algorithms against an adaptive adversary and separation results between what is achievable in the oblivious vs. adaptive settings. To get these results we exploit techniques from differential privacy, cryptography, and adaptive data analysis."}
+{"idx": 7, "title": "[2111.03980v1] Dynamic Algorithms Against an Adaptive Adversary ...", "date": "", "ddg_snippet": "View a PDF of the paper titled Dynamic Algorithms Against an Adaptive Adversary : Generic Constructions and Lower Bounds, by Amos Beimel and 5 other authors.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2111.03980v1", "content": "View a PDF of the paper titled Dynamic Algorithms Against an Adaptive Adversary : Generic Constructions and Lower Bounds, by Amos Beimel and 5 other authors."}
+{"idx": 8, "title": "Dynamic algorithms against an adaptive adversary : generic...", "date": "", "ddg_snippet": "We present the first fully dynamic algorithm that maintains the shortest paths against an adaptive adversary in subquadratic update time. This is obtained via a combinatorial reduction that allows reconstructing the shortest paths with only a few distance estimates.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/361232054_Dynamic_algorithms_against_an_adaptive_adversary_generic_constructions_and_lower_bounds", "content": "We present the first fully dynamic algorithm that maintains the shortest paths against an adaptive adversary in subquadratic update time. This is obtained via a combinatorial reduction that allows reconstructing the shortest paths with only a few distance estimates."}
+{"idx": 9, "title": "STOC 2022 - Dynamic Algorithms Against an Adaptive Adversary ...", "date": "", "ddg_snippet": "Dynamic Algorithms Against an Adaptive Adversary : Generic Constructions and Lower Bounds Amos Beimel (Ben-Gurion University), Haim Kaplan (Tel Aviv University and Google research), Yishay Mansour (Tel Aviv University and Google research), Kobbi Nissim...", "subpage_snippet": "", "source": "rutube.ru", "link": "https://rutube.ru/video/289472930250da35af1e1357416079ac/", "content": "Dynamic Algorithms Against an Adaptive Adversary : Generic Constructions and Lower Bounds Amos Beimel (Ben-Gurion University), Haim Kaplan (Tel Aviv University and Google research), Yishay Mansour (Tel Aviv University and Google research), Kobbi Nissim..."}

data/sampled_jsons/Book_Crossing_dataset_parameters_alpha_x_min_X_2.38_8_10^5.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "BookCorpus - Wikipedia", "date": "", "ddg_snippet": "BookCorpus (also sometimes referred to as the Toronto Book Corpus) is a dataset consisting of the text of around 7,000 self-published books scraped from the indie ebook distribution website Smashwords. [1]", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/BookCorpus", "content": "BookCorpus (also sometimes referred to as the Toronto Book Corpus) is a dataset consisting of the text of around 7,000 self-published books scraped from the indie ebook distribution website Smashwords. [1]"}
+{"idx": 1, "title": "Book-Crossing-Dataset/Project Part I.docx at main - GitHub", "date": "", "ddg_snippet": "Recommendation system for Book - Crossing Dataset. Contribute to AlexKuoTW/ Book - Crossing -Dataset development by creating an account on GitHub .", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/AlexKuoTW/Book-Crossing-Dataset/blob/main/Project+Part+I.docx", "content": "Recommendation system for Book - Crossing Dataset. Contribute to AlexKuoTW/ Book - Crossing -Dataset development by creating an account on GitHub ."}
+{"idx": 2, "title": "An Introduction to the COCO Dataset - Roboflow Blog", "date": "", "ddg_snippet": "Oct 18, 2020 · The COCO dataset also provides a base dataset to train computer vision models in a supervised training method. Once the model is trained on the COCO dataset , it can be fine-tuned to learn other tasks, with a custom dataset .", "subpage_snippet": "", "source": "blog.roboflow.com", "link": "https://blog.roboflow.com/coco-dataset/", "content": "Oct 18, 2020 · The COCO dataset also provides a base dataset to train computer vision models in a supervised training method. Once the model is trained on the COCO dataset , it can be fine-tuned to learn other tasks, with a custom dataset ."}
+{"idx": 3, "title": "MaziyarPanahi/arxflix- dataset -dup-12290-alpaca · Datasets at...", "date": "", "ddg_snippet": "Inference over this number of examples times 10 models evaluated amounts to 2 million inference examples. Finetuning on the other hand, requires all parameters to be trained and training dataset sizes are considerably larger.", "subpage_snippet": "", "source": "huggingface.co", "link": "https://huggingface.co/datasets/MaziyarPanahi/arxflix-dataset-dup-12290-alpaca", "content": "Inference over this number of examples times 10 models evaluated amounts to 2 million inference examples. Finetuning on the other hand, requires all parameters to be trained and training dataset sizes are considerably larger."}
+{"idx": 4, "title": "1.1. Linear Models — scikit-learn 1.7.2 documentation", "date": "", "ddg_snippet": "1.1. 10 . Bayesian Regression#. Bayesian regression techniques can be used to include regularization parameters in the estimation procedure: the regularization parameter is not set in a hard sense but tuned to the data at hand.", "subpage_snippet": "", "source": "scikit-learn.org", "link": "https://scikit-learn.org/stable/modules/linear_model.html", "content": "1.1. 10 . Bayesian Regression#. Bayesian regression techniques can be used to include regularization parameters in the estimation procedure: the regularization parameter is not set in a hard sense but tuned to the data at hand."}
+{"idx": 5, "title": "Group sparse Bayesian learning for data -driven discovery of explicit...", "date": "", "ddg_snippet": "Moreover, it is unclear how to efficiently learn a parametric system from multiple data sets with different parameters . This paper presents a group sparse Bayesian learning approaches to uncover the explicit model forms of a parametric dynamical system with estimated uncertainties.", "subpage_snippet": "", "source": "www.aimsciences.org", "link": "https://www.aimsciences.org/article/doi/10.3934/naco.2022040", "content": "Moreover, it is unclear how to efficiently learn a parametric system from multiple data sets with different parameters . This paper presents a group sparse Bayesian learning approaches to uncover the explicit model forms of a parametric dynamical system with estimated uncertainties."}
+{"idx": 6, "title": "Калькулятор уравнений", "date": "", "ddg_snippet": "•lambda — lambda. •= — geq. •pi — pi. alpha — alpha .", "subpage_snippet": "", "source": "mathdf.com", "link": "https://mathdf.com/equ/ru/", "content": "•lambda — lambda. •= — geq. •pi — pi. alpha — alpha ."}
+{"idx": 7, "title": "Create multiple subplots using plt.subplots — Matplotlib...", "date": "", "ddg_snippet": "Matplotlib 3. 10 .6 documentation - Home. Plot types. User guide.When stacking in two directions, the returned axs is a 2D NumPy array. If you have to set parameters for each subplot it's handy to iterate over all subplots in a 2D grid using for ax in axs.flat", "subpage_snippet": "", "source": "matplotlib.org", "link": "https://matplotlib.org/stable/gallery/subplots_axes_and_figures/subplots_demo.html", "content": "Matplotlib 3. 10 .6 documentation - Home. Plot types. User guide.When stacking in two directions, the returned axs is a 2D NumPy array. If you have to set parameters for each subplot it's handy to iterate over all subplots in a 2D grid using for ax in axs.flat"}
+{"idx": 8, "title": "7 Scikit-learn Tricks for Optimized Cross-Validation", "date": "", "ddg_snippet": "Sep 8 , 2025 · This article reveals seven scikit-learn tricks for optimizing cross-validation, along with code examples of their implementation.", "subpage_snippet": "", "source": "machinelearningmastery.com", "link": "https://machinelearningmastery.com/7-scikit-learn-tricks-for-optimized-cross-validation/", "content": "Sep 8 , 2025 · This article reveals seven scikit-learn tricks for optimizing cross-validation, along with code examples of their implementation."}
+{"idx": 9, "title": "Top 7 Cross-Validation Techniques with Python Code", "date": "", "ddg_snippet": "", "subpage_snippet": "", "source": "www.analyticsvidhya.com", "link": "https://www.analyticsvidhya.com/blog/2021/11/top-cross-validation-techniques-with-python-code/", "content": ""}

data/sampled_jsons/CLIP_image_encoder_semantic_space_vs_VAE_latent_space_technical_differences_dimensionality.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "TokLIP: Marry Visual Tokens to CLIP for Multimodal", "date": "", "ddg_snippet": "The token encoder is initialized from a pre-trained bidirectional CLIP vision encoder and semanticizes the discrete visual codes under a data ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2505.05422v1", "content": "The token encoder is initialized from a pre-trained bidirectional CLIP vision encoder and semanticizes the discrete visual codes under a data ..."}
+{"idx": 1, "title": "Visual Lexicon: Rich Image Features in Language Space", "date": "", "ddg_snippet": "We propose ViLex , an image encoder that maps images into the vocabulary space , effectively preserving semantic information and intricate visual ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2412.06774v1", "content": "We propose ViLex , an image encoder that maps images into the vocabulary space , effectively preserving semantic information and intricate visual ..."}
+{"idx": 2, "title": "REPA-E: Unlocking VAE for End-to-End Tuning with Latent", "date": "", "ddg_snippet": "... tuning the VAE and latent diffusion model during training , automatically improves the latent space structure across different VAE architectures.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2504.10483v1", "content": "... tuning the VAE and latent diffusion model during training , automatically improves the latent space structure across different VAE architectures."}
+{"idx": 3, "title": "Master Fine-Grained Image Control: Discover Playground", "date": "", "ddg_snippet": "... encoders (such as T5 or CLIP ), PGv3 can better capture the complex semantics , logical relationships, and detailed descriptions in text, and convert ...", "subpage_snippet": "", "source": "kcgod.com", "link": "https://kcgod.com/Playground-v3-technical-report", "content": "... encoders (such as T5 or CLIP ), PGv3 can better capture the complex semantics , logical relationships, and detailed descriptions in text, and convert ..."}
+{"idx": 4, "title": "DisCo-Diff: Enhancing Continuous Diffusion Models with Discrete", "date": "", "ddg_snippet": "A careful hierarchical design can encourage different discrete latents to encode different image characteristics, such as shape vs .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2407.03300v1", "content": "A careful hierarchical design can encourage different discrete latents to encode different image characteristics, such as shape vs ."}
+{"idx": 5, "title": "Discrete Distribution Networks", "date": "", "ddg_snippet": "VAEs encode data into a simple distribution’s latent space through an Encoder , and the Decoder is trained to reconstruct the original data from this ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2401.00036v3", "content": "VAEs encode data into a simple distribution’s latent space through an Encoder , and the Decoder is trained to reconstruct the original data from this ..."}
+{"idx": 6, "title": "Diffusion Models", "date": "", "ddg_snippet": "Unlike VAE or flow models , diffusion models are learned with a fixed procedure and the latent variable has high dimensionality (same as the original ...", "subpage_snippet": "", "source": "huggingface.co", "link": "https://huggingface.co/blog/Esmail-AGumaan/diffusion-models", "content": "Unlike VAE or flow models , diffusion models are learned with a fixed procedure and the latent variable has high dimensionality (same as the original ..."}
+{"idx": 7, "title": "ComfyUI Beginner's Guide: Master Features with Free Online", "date": "", "ddg_snippet": "Latent Space Transformation: The feature vectors from the Text Encoder and a random noise image are transformed into a latent space .", "subpage_snippet": "", "source": "www.runcomfy.com", "link": "https://www.runcomfy.com/tutorials/comfyui-beginners-guide", "content": "Latent Space Transformation: The feature vectors from the Text Encoder and a random noise image are transformed into a latent space ."}
+{"idx": 8, "title": "Color-Diffusion: using diffusion models to colorize black and", "date": "", "ddg_snippet": "... the 3x64x64 pixel space image is smaller than the latents you would get from encoding a higher-res image with models like VQGAN or the stablediff VAE ...", "subpage_snippet": "", "source": "news.ycombinator.com", "link": "https://news.ycombinator.com/item?id=36991293", "content": "... the 3x64x64 pixel space image is smaller than the latents you would get from encoding a higher-res image with models like VQGAN or the stablediff VAE ..."}
+{"idx": 9, "title": "Ilya's 30 Papers to Carmack: VLAEs - by theahura", "date": "", "ddg_snippet": "... practitioners use models like variational autoencoders ( VAEs ) to do representation learning, because they naturally have a clear hierarchy of latent ...", "subpage_snippet": "", "source": "theahura.substack.com", "link": "https://theahura.substack.com/p/ilyas-30-papers-to-carmack-vlaes", "content": "... practitioners use models like variational autoencoders ( VAEs ) to do representation learning, because they naturally have a clear hierarchy of latent ..."}

data/sampled_jsons/CoPINN_weight_scheduler_linear_interpolation_easiest_hardest_samples_vie_vih_epoch_i_Ne_formula_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "CoPINN : Cognitive Physics-Informed Neural Networks", "date": "", "ddg_snippet": "Therefore, the learning objective of CoPINN can be formulated as followsFor a training phase with Ne epochs , we expect the weight of the easiest sample to be 1 in the first epoch and 0 in Ne epochs .", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=4vAa0A98xI", "content": "Therefore, the learning objective of CoPINN can be formulated as followsFor a training phase with Ne epochs , we expect the weight of the easiest sample to be 1 in the first epoch and 0 in Ne epochs ."}
+{"idx": 1, "title": "ICML Poster CoPINN : Physical Informed Neural Network", "date": "", "ddg_snippet": "To deal with this daunting problem, we propose a novel framework named Cognitive Physical Informed Neural Network ( CoPINN ) that imitates the human cognitive learning manner from easy to hard .", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/46458", "content": "To deal with this daunting problem, we propose a novel framework named Cognitive Physical Informed Neural Network ( CoPINN ) that imitates the human cognitive learning manner from easy to hard ."}
+{"idx": 2, "title": "machinelearningmastery.com/difference-between-a-batch-and-an- epoch", "date": "", "ddg_snippet": "The number of epochs can be set to an integer value between one and infinity.", "subpage_snippet": "", "source": "machinelearningmastery.com", "link": "https://machinelearningmastery.com/difference-between-a-batch-and-an-epoch/", "content": "The number of epochs can be set to an integer value between one and infinity."}
+{"idx": 3, "title": "Formula 55 | Ставки на спорт онлайн - Букмекерская контора ставок", "date": "", "ddg_snippet": "Австралия. Hard . Квалификация (3-й сет - супер тай-брейк).", "subpage_snippet": "", "source": "formula55.me", "link": "https://formula55.me/", "content": "Австралия. Hard . Квалификация (3-й сет - супер тай-брейк)."}
+{"idx": 4, "title": "PyTorch Loss Functions: The Ultimate Guide", "date": "", "ddg_snippet": "NLL does not only care about the prediction being correct but also about the model being certain about the prediction with a high score. The Pytorch NLL Loss is expressed as: where x is the input, y is the target, w is the weight , and N is the batch size. When could it be used?", "subpage_snippet": "", "source": "neptune.ai", "link": "https://neptune.ai/blog/pytorch-loss-functions", "content": "NLL does not only care about the prediction being correct but also about the model being certain about the prediction with a high score. The Pytorch NLL Loss is expressed as: where x is the input, y is the target, w is the weight , and N is the batch size. When could it be used?"}
+{"idx": 5, "title": "Video Generation with Wan2.1 - Chutes Documentation", "date": "", "ddg_snippet": "Video Interpolation . Create smooth transitions between keyframes: classInterpolationInput(BaseModel): start_prompt: str end_prompt: str interpolation _steps: int = Field(5, ge=3, le=10) resolution: Resolution = Resolution.WIDESCREEN @.", "subpage_snippet": "", "source": "chutes.ai", "link": "https://chutes.ai/docs/examples/video-generation", "content": "Video Interpolation . Create smooth transitions between keyframes: classInterpolationInput(BaseModel): start_prompt: str end_prompt: str interpolation _steps: int = Field(5, ge=3, le=10) resolution: Resolution = Resolution.WIDESCREEN @."}
+{"idx": 6, "title": "“ I Want To Enjoy Every Minute That I Can”: For... | British Vogue", "date": "", "ddg_snippet": "In just a few short years, one name has overtaken all others in Formula 1: Lando Norris. As the British driver turned Gen Z pin-up eyes the world championship, he tells Kate Lloyd about life in the fast lane.", "subpage_snippet": "", "source": "www.vogue.co.uk", "link": "https://www.vogue.co.uk/article/lando-norris-interview", "content": "In just a few short years, one name has overtaken all others in Formula 1: Lando Norris. As the British driver turned Gen Z pin-up eyes the world championship, he tells Kate Lloyd about life in the fast lane."}
+{"idx": 7, "title": "ONE : eCommerce", "date": "", "ddg_snippet": "...HTTPS ecomm.one- line .com/one-ecom/ schedule /vessel- schedule .", "subpage_snippet": "", "source": "ecomm.one-line.com", "link": "https://ecomm.one-line.com/one-ecom/schedule/vessel-schedule", "content": "...HTTPS ecomm.one- line .com/one-ecom/ schedule /vessel- schedule ."}
+{"idx": 8, "title": "Wolfram|Alpha: Computational Intelligence", "date": "", "ddg_snippet": "Compute answers using Wolfram's breakthrough technology & knowledgebase, relied on by millions of students & professionals. For math, science, nutrition, history, geography, engineering, mathematics, linguistics, sports, finance, music…", "subpage_snippet": "", "source": "www.wolframalpha.com", "link": "https://www.wolframalpha.com/", "content": "Compute answers using Wolfram's breakthrough technology & knowledgebase, relied on by millions of students & professionals. For math, science, nutrition, history, geography, engineering, mathematics, linguistics, sports, finance, music…"}
+{"idx": 9, "title": "Perplexity", "date": "", "ddg_snippet": "Perplexity is a free AI-powered answer engine that provides accurate, trusted, and real-time answers to any question.", "subpage_snippet": "", "source": "www.perplexity.ai", "link": "https://www.perplexity.ai/", "content": "Perplexity is a free AI-powered answer engine that provides accurate, trusted, and real-time answers to any question."}

data/sampled_jsons/Concept_Bottleneck_Models_Koh_2020_abstract_arxiv_year_2020.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Explainable artificial intelligence - Wikipedia", "date": "", "ddg_snippet": "20 Concept Bottleneck Models , which use concept -level abstractions to explain model reasoning, are examples of this and can be applied in both image ...", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/Explainable_artificial_intelligence", "content": "20 Concept Bottleneck Models , which use concept -level abstractions to explain model reasoning, are examples of this and can be applied in both image ..."}
+{"idx": 1, "title": "[2007.04612] Concept Bottleneck Models - arXiv.org", "date": "", "ddg_snippet": "Jul 9, 2020 · On x-ray grading and bird identification, concept bottleneck models achieve competitive accuracy with standard end-to-end models, while enabling interpretation in terms of high-level clinical concepts (\"bone spurs\") or bird attributes (\"wing color\").", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2007.04612", "content": "Jul 9, 2020 · On x-ray grading and bird identification, concept bottleneck models achieve competitive accuracy with standard end-to-end models, while enabling interpretation in terms of high-level clinical concepts (\"bone spurs\") or bird attributes (\"wing color\")."}
+{"idx": 2, "title": "Concept Bottleneck Models - arXiv.org", "date": "", "ddg_snippet": "Concept bottleneck models can compete on task accuracy while supporting intervention and interpretation, allowing practitioners to reason about these models in terms of high-level concepts they are familiar with, and enabling more effective human-model collaboration through test-time in-tervention.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2007.04612", "content": "Concept bottleneck models can compete on task accuracy while supporting intervention and interpretation, allowing practitioners to reason about these models in terms of high-level concepts they are familiar with, and enabling more effective human-model collaboration through test-time in-tervention."}
+{"idx": 3, "title": "Concept Bottleneck Models - PMLR", "date": "", "ddg_snippet": "Proceedings of Machine Learning Research [edit] Concept Bottleneck Models Pang Wei Koh , Thao Nguyen, Yew Siang Tang, Stephen Mussmann, Emma Pierson, Been Kim, Percy Liang Proceedings of the 37th International Conference on Machine Learning, PMLR 119:5338-5348, 2020 .", "subpage_snippet": "", "source": "proceedings.mlr.press", "link": "https://proceedings.mlr.press/v119/koh20a.html", "content": "Proceedings of Machine Learning Research [edit] Concept Bottleneck Models Pang Wei Koh , Thao Nguyen, Yew Siang Tang, Stephen Mussmann, Emma Pierson, Been Kim, Percy Liang Proceedings of the 37th International Conference on Machine Learning, PMLR 119:5338-5348, 2020 ."}
+{"idx": 4, "title": "Bayesian Concept Bottleneck Models with LLM Priors - arXiv.org", "date": "", "ddg_snippet": "5 hours ago · Abstract Concept Bottleneck Models (CBMs) have been proposed as a compromise between white-box and black-box models, aiming to achieve interpretability without sacrificing accuracy.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2410.15555v2", "content": "5 hours ago · Abstract Concept Bottleneck Models (CBMs) have been proposed as a compromise between white-box and black-box models, aiming to achieve interpretability without sacrificing accuracy."}
+{"idx": 5, "title": "Diverse Concept Proposals for Concept Bottleneck Models", "date": "", "ddg_snippet": "Dec 24, 2024 · Recently popularized by Koh et al. ( 2020 ), concept bottleneck models (CBM) prove to be a highly flexible and (hopefully) interpretable model class. Inputs 𝑥 x italic_x are first converted to a small set of concepts 𝑐 c italic_c that are used to make the ultimate prediction 𝑦 y italic_y. This allows the human operator to inspect the concepts that form the basis of the prediction and ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2412.18059v1", "content": "Dec 24, 2024 · Recently popularized by Koh et al. ( 2020 ), concept bottleneck models (CBM) prove to be a highly flexible and (hopefully) interpretable model class. Inputs 𝑥 x italic_x are first converted to a small set of concepts 𝑐 c italic_c that are used to make the ultimate prediction 𝑦 y italic_y. This allows the human operator to inspect the concepts that form the basis of the prediction and ..."}
+{"idx": 6, "title": "Concept bottleneck models | Proceedings of the 37th ...", "date": "", "ddg_snippet": "Jul 13, 2020 · On x-ray grading and bird identification, concept bottleneck models achieve competitive accuracy with standard end-to-end models, while enabling interpretation in terms of high-level clinical concepts (\"bone spurs\") or bird attributes (\"wing color\").", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/abs/10.5555/3524938.3525433", "content": "Jul 13, 2020 · On x-ray grading and bird identification, concept bottleneck models achieve competitive accuracy with standard end-to-end models, while enabling interpretation in terms of high-level clinical concepts (\"bone spurs\") or bird attributes (\"wing color\")."}
+{"idx": 7, "title": "Concept Bottleneck Language Models For protein design", "date": "", "ddg_snippet": "To achieve this, we modify the standard masked language model architecture by adding a concept bottleneck layer to explicitly incorporate human ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2411.06090v2", "content": "To achieve this, we modify the standard masked language model architecture by adding a concept bottleneck layer to explicitly incorporate human ..."}
+{"idx": 8, "title": "If Concept Bottlenecks are the Question, are Foundation Models", "date": "", "ddg_snippet": "Concept Bottleneck Models (CBMs) [ 41 ] combine two neural modules: a concept extractor f : 𝒳 → ℝ k : 𝑓 → 𝒳 superscript ℝ 𝑘 f ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2504.19774v2", "content": "Concept Bottleneck Models (CBMs) [ 41 ] combine two neural modules: a concept extractor f : 𝒳 → ℝ k : 𝑓 → 𝒳 superscript ℝ 𝑘 f ..."}
+{"idx": 9, "title": "CLIP-QDA: An Explainable Concept Bottleneck Model", "date": "", "ddg_snippet": "A class of networks that effectively exploits this notion is Concept Bottleneck Models (CBMs) ( Koh et al., 2020 ) .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2312.00110v3", "content": "A class of networks that effectively exploits this notion is Concept Bottleneck Models (CBMs) ( Koh et al., 2020 ) ."}

data/sampled_jsons/DART_CVPR_Park_Sang-Jun_disease-matching_constraint_lambda_m_=_1.jsonl

@@ -0,0 +1 @@
+{"idx": 0, "title": "", "date": "", "ddg_snippet": "", "subpage_snippet": "", "source": "", "link": "", "content": ""}

data/sampled_jsons/DART_Disease-aware_Image-Text_Alignment_equation_5_total_loss_stage_1_lambda_m_disease-matching_cons_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "DART : Disease - aware Image - Text Alignment and Self-correcting...", "date": "", "ddg_snippet": "Image -to- text Retrieval with Disease - matching . After aligning the image and text embeddings in a shared embedding space using contrastive learning, we retrieve reports relevant to the image features.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2504.11786v1", "content": "Image -to- text Retrieval with Disease - matching . After aligning the image and text embeddings in a shared embedding space using contrastive learning, we retrieve reports relevant to the image features."}
+{"idx": 1, "title": "(PDF) DART : Disease - aware Image - Text Alignment and...", "date": "", "ddg_snippet": "disease - aware image -to- text alignment . First , an input im-. loss (CL), image -to- text retrieval ( I 2T), disease - matching constraint (DM), and self-correction (SC). A “” indicates the presence of each. component, while “-” denotes its absence.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/390845711_DART_Disease-aware_Image-Text_Alignment_and_Self-correcting_Re-alignment_for_Trustworthy_Radiology_Report_Generation", "content": "disease - aware image -to- text alignment . First , an input im-. loss (CL), image -to- text retrieval ( I 2T), disease - matching constraint (DM), and self-correction (SC). A “” indicates the presence of each. component, while “-” denotes its absence."}
+{"idx": 2, "title": "Brat Text Generator - Charli XCX Inspired Text Maker", "date": "", "ddg_snippet": "Generate Charli XCX Brat-inspired text with our Brat Text Generator. Customize your text with stylish fonts and effects!", "subpage_snippet": "", "source": "bratgenerator.io", "link": "https://bratgenerator.io/old/", "content": "Generate Charli XCX Brat-inspired text with our Brat Text Generator. Customize your text with stylish fonts and effects!"}
+{"idx": 3, "title": "Dart", "date": "", "ddg_snippet": "DART : Disease - aware Image - Text Alignment and Self-correcting Re- alignment for Trustworthy Radiology Report Generation. Request Code.", "subpage_snippet": "", "source": "www.catalyzex.com", "link": "https://www.catalyzex.com/s/Dart", "content": "DART : Disease - aware Image - Text Alignment and Self-correcting Re- alignment for Trustworthy Radiology Report Generation. Request Code."}
+{"idx": 4, "title": "Block of Equations Alignment \\begin{ equation *} - LaTeX.org | Forum", "date": "", "ddg_snippet": "The imgshare.io links are dead, no images there. But you can post the images here as attachments. The \"Attachments\" link is below the text edit field, when you write a post.", "subpage_snippet": "", "source": "latex.org", "link": "https://latex.org/forum/viewtopic.php?t=34561", "content": "The imgshare.io links are dead, no images there. But you can post the images here as attachments. The \"Attachments\" link is below the text edit field, when you write a post."}
+{"idx": 5, "title": "Articles by Dong-Ho Shin | Synthical", "date": "", "ddg_snippet": "DART : Disease - aware Image - Text Alignment and Self-correcting Re- alignment for Trustworthy Radiology Report Generation.", "subpage_snippet": "", "source": "synthical.com", "link": "https://synthical.com/profile/3e7eed8b-226c-4317-a4f7-ae93f39b25b8/articles", "content": "DART : Disease - aware Image - Text Alignment and Self-correcting Re- alignment for Trustworthy Radiology Report Generation."}
+{"idx": 6, "title": "Latest 15 Papers - May 21, 2025", "date": "", "ddg_snippet": "DART : Disease - aware Image - Text Alignment and Self-correcting Re- alignment for Trustworthy Radiology Report Generation.", "subpage_snippet": "", "source": "viao.co.uk", "link": "https://viao.co.uk/blog/latest-15-papers-may-21-1747789981215", "content": "DART : Disease - aware Image - Text Alignment and Self-correcting Re- alignment for Trustworthy Radiology Report Generation."}
+{"idx": 7, "title": "Face Swap Online Free", "date": "", "ddg_snippet": "You can use Remaker's Face Swapper to swap faces online for free. Here are the steps: 1 . Upload the original image that contains the face you want to replace.", "subpage_snippet": "", "source": "remaker.ai", "link": "https://remaker.ai/face-swap-free/", "content": "You can use Remaker's Face Swapper to swap faces online for free. Here are the steps: 1 . Upload the original image that contains the face you want to replace."}
+{"idx": 8, "title": "Joseph is a super minimal content focus theme for Jekyll.", "date": "", "ddg_snippet": "DART : Disease - aware Image - Text Alignment and Self-correcting Re- alignment for Trustworthy Radiology Report Generation. Sang-Jun Park, Keun-Soo Heo, Dong-Hee Shin, Young-Han Son, Ji-Hye Oh, Tae-Eui Kam.", "subpage_snippet": "", "source": "donghee-shin-page.github.io", "link": "https://donghee-shin-page.github.io/publications/", "content": "DART : Disease - aware Image - Text Alignment and Self-correcting Re- alignment for Trustworthy Radiology Report Generation. Sang-Jun Park, Keun-Soo Heo, Dong-Hee Shin, Young-Han Son, Ji-Hye Oh, Tae-Eui Kam."}
+{"idx": 9, "title": "CVPR2025 Accepted Papers-CSDN博客", "date": "", "ddg_snippet": "Single Image Plant Modeling Zhihao Liu · Zhanglin Cheng · Naoto Yokoya Alignment , Mining and Fusion: Representation Alignment with Hard Negative Mining and Selective Knowledge Fusion for Medical Visual Question Answering Yuanhao Zou · Zhaozheng Yin BlobGEN-Vid...", "subpage_snippet": "", "source": "blog.csdn.net", "link": "https://blog.csdn.net/u013963578/article/details/146183100", "content": "Single Image Plant Modeling Zhihao Liu · Zhanglin Cheng · Naoto Yokoya Alignment , Mining and Fusion: Representation Alignment with Hard Negative Mining and Selective Knowledge Fusion for Medical Visual Question Answering Yuanhao Zou · Zhaozheng Yin BlobGEN-Vid..."}

data/sampled_jsons/DCBM_Data-Efficient_Visual_Concept_Bottleneck_Models_OpenReview_Section_5.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "DCBM: Data-Efficient Visual Concept Bottleneck Models - OpenReview", "date": "", "ddg_snippet": "We propose Data-efficient CBMs ( DCBMs ), which reduce the need for large sample sizes during concept generation while preserving interpretability. DCBMs define concepts as image regions detected by segmentation or detection foundation models , allowing each image to generate multiple concepts across different granularities.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=BdO4R6XxUH", "content": "We propose Data-efficient CBMs ( DCBMs ), which reduce the need for large sample sizes during concept generation while preserving interpretability. DCBMs define concepts as image regions detected by segmentation or detection foundation models , allowing each image to generate multiple concepts across different granularities."}
+{"idx": 1, "title": "DCBM: Data-Efficient Visual Concept Bottleneck Models", "date": "", "ddg_snippet": "data /: Directories for classes, concepts , datasets, embeddings, and segments. experiments/: Code for experiments detailed in the main paper and supplementary material.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/KathPra/DCBM", "content": "data /: Directories for classes, concepts , datasets, embeddings, and segments. experiments/: Code for experiments detailed in the main paper and supplementary material."}
+{"idx": 2, "title": "ICML DCBM: Data-Efficient Visual Concept Bottleneck Models", "date": "", "ddg_snippet": "Poster in Workshop: Actionable Interpretability DCBM : Data-Efficient Visual Concept Bottleneck Models Katharina Prasse · Patrick Knab · Sascha Marton · Christian Bartelt · Margret Keuper [ Abstract ] [ Project Page ] [ OpenReview ] Sat 19 Jul 10:40 a.m. PDT — 11:40 a.m. PDT", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/49558", "content": "Poster in Workshop: Actionable Interpretability DCBM : Data-Efficient Visual Concept Bottleneck Models Katharina Prasse · Patrick Knab · Sascha Marton · Christian Bartelt · Margret Keuper [ Abstract ] [ Project Page ] [ OpenReview ] Sat 19 Jul 10:40 a.m. PDT — 11:40 a.m. PDT"}
+{"idx": 3, "title": "DCBM: Data-Efficient Visual Concept Bottleneck Models", "date": "", "ddg_snippet": "Abstract Concept Bottleneck Models (CBMs) enhance the interpretability of neural networks by basing predictions on human-understandable concepts . However, current CBMs typically rely on con-cept sets extracted from large language models or extensive image corpora, limiting their effec-tiveness in data -sparse scenarios.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2412.11576", "content": "Abstract Concept Bottleneck Models (CBMs) enhance the interpretability of neural networks by basing predictions on human-understandable concepts . However, current CBMs typically rely on con-cept sets extracted from large language models or extensive image corpora, limiting their effec-tiveness in data -sparse scenarios."}
+{"idx": 4, "title": "DCBM: Data-Efficient Visual Concept Bottleneck Models :: MPG.PuRe", "date": "", "ddg_snippet": "Content show hide Free keywords: Computer Science, Computer Vision and Pattern Recognition, cs.CV Abstract: Concept Bottleneck Models (CBMs) enhance the interpretability of neural", "subpage_snippet": "", "source": "pure.mpg.de", "link": "https://pure.mpg.de/pubman/faces/ViewItemFullPage.jsp?itemId=item_3636912_1&view=ACTIONS", "content": "Content show hide Free keywords: Computer Science, Computer Vision and Pattern Recognition, cs.CV Abstract: Concept Bottleneck Models (CBMs) enhance the interpretability of neural"}
+{"idx": 5, "title": "Revisions | OpenReview", "date": "", "ddg_snippet": "We introduce Data-efficient Concept Bottleneck Models ( DCBMs ) — a new method that works even when we have few images. Instead of relying on predefined concepts , DCBMs use modern AI tools to detect meaningful regions of each image, automatically creating visual concepts that are specific to the dataset.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/revisions?id=BdO4R6XxUH", "content": "We introduce Data-efficient Concept Bottleneck Models ( DCBMs ) — a new method that works even when we have few images. Instead of relying on predefined concepts , DCBMs use modern AI tools to detect meaningful regions of each image, automatically creating visual concepts that are specific to the dataset."}
+{"idx": 6, "title": "DCBM: Data-Efficient Visual Concept Bottleneck Models", "date": "", "ddg_snippet": "Concept Bottleneck Models (CBMs) enhance the interpretability of neural networks by basing predictions on human-understandable concepts . However, current CBMs typically rely on concept sets extracted from large language models or extensive image corpora, limiting their effectiveness in data -sparse scenarios. We propose Data-efficient CBMs ( DCBMs ), which reduce the need for large sample sizes ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2412.11576", "content": "Concept Bottleneck Models (CBMs) enhance the interpretability of neural networks by basing predictions on human-understandable concepts . However, current CBMs typically rely on concept sets extracted from large language models or extensive image corpora, limiting their effectiveness in data -sparse scenarios. We propose Data-efficient CBMs ( DCBMs ), which reduce the need for large sample sizes ..."}
+{"idx": 7, "title": "GitHub - deepopo/DCBM", "date": "", "ddg_snippet": "This is an implementation of the IEEE TPAMI paper The Decoupling Concept Bottleneck Model ( DCBM ). The vision-language- model (VLM) part is being refined and will be available soon. Figure 1: DCBM Pipeline. (A) DCBM for prediction and interpretation. (B) DCBM for human-machine interaction, including forward intervention and backward rectification.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/deepopo/DCBM", "content": "This is an implementation of the IEEE TPAMI paper The Decoupling Concept Bottleneck Model ( DCBM ). The vision-language- model (VLM) part is being refined and will be available soon. Figure 1: DCBM Pipeline. (A) DCBM for prediction and interpretation. (B) DCBM for human-machine interaction, including forward intervention and backward rectification."}
+{"idx": 8, "title": "DCBM: Data-Efficient Visual Concept Bottleneck Models - OpenReview", "date": "", "ddg_snippet": "Abstract Concept Bottleneck Models (CBMs) enhance the interpretability of neural networks by basing predictions on human-understandable concepts . However, current CBMs typically rely on con-cept sets extracted from large language models or extensive image corpora, limiting their effec-tiveness in data -sparse scenarios.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=BdO4R6XxUH", "content": "Abstract Concept Bottleneck Models (CBMs) enhance the interpretability of neural networks by basing predictions on human-understandable concepts . However, current CBMs typically rely on con-cept sets extracted from large language models or extensive image corpora, limiting their effec-tiveness in data -sparse scenarios."}
+{"idx": 9, "title": "www.mpi-inf.mpg.de", "date": "", "ddg_snippet": "scenarios. We propose Data-efficient CBMs ( DCBMs ), which reduce the need for large sample sizes during concept generation while preserving interpretability.", "subpage_snippet": "", "source": "www.mpi-inf.mpg.de", "link": "https://www.mpi-inf.mpg.de/fileadmin/inf/bibtex/3636912.bib", "content": "scenarios. We propose Data-efficient CBMs ( DCBMs ), which reduce the need for large sample sizes during concept generation while preserving interpretability."}

data/sampled_jsons/DCBM_applicability_limited_by_segmentation_detection_foundation_model.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "DCBM : Data-Efficient Visual Concept Bottleneck Models", "date": "", "ddg_snippet": "DCBM ’s applicability is limited by two factors, the suitability of a segmentation foundation model and the expressiveness of the CLIP embedding space for a given use case. Further advances in vision-language models, segmentation , and detection models can enhance results...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2412.11576v2", "content": "DCBM ’s applicability is limited by two factors, the suitability of a segmentation foundation model and the expressiveness of the CLIP embedding space for a given use case. Further advances in vision-language models, segmentation , and detection models can enhance results..."}
+{"idx": 1, "title": "DCBM : Data-Efficient Visual Concept Bottleneck Models", "date": "", "ddg_snippet": "DCBM ’s applicability is limited by two factors, the suitability of a segmentation foundation model and the expressiveness of the CLIP embedding space for a given use case. Further advances in vision-language models, segmentation , and detection models can enhance results...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2412.11576v3", "content": "DCBM ’s applicability is limited by two factors, the suitability of a segmentation foundation model and the expressiveness of the CLIP embedding space for a given use case. Further advances in vision-language models, segmentation , and detection models can enhance results..."}
+{"idx": 2, "title": "DCBM : Data-Efficient Visual Concept Bottleneck Models", "date": "", "ddg_snippet": "DCBMs use segmentation and detection foundation models to extract image regions as visual concept proposals. DCBM ’s applicability is limited by two factors, the suitability of a segmentation foundation model and the expressiveness of.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2412.11576", "content": "DCBMs use segmentation and detection foundation models to extract image regions as visual concept proposals. DCBM ’s applicability is limited by two factors, the suitability of a segmentation foundation model and the expressiveness of."}
+{"idx": 3, "title": "Publications - Max Planck Institut für Informatik", "date": "", "ddg_snippet": "FAIR-TAT: Improving Model Fairness Using Targeted Adversarial Training,” in IEEE/CVF Winter Conference on Applications of Computer Vision (WACV ...", "subpage_snippet": "", "source": "www.mpi-inf.mpg.de", "link": "https://www.mpi-inf.mpg.de/de/departments/computer-vision-and-machine-learning/publications", "content": "FAIR-TAT: Improving Model Fairness Using Targeted Adversarial Training,” in IEEE/CVF Winter Conference on Applications of Computer Vision (WACV ..."}
+{"idx": 4, "title": "Prof. Dr.-Ing. Margret Keuper | Universität Mannheim", "date": "", "ddg_snippet": "Grouping Problems (in applications such as Image and Motion Segmentation and Multiple Object Tracking) ... Text-Guided Graphics Program Synthesis, by ...", "subpage_snippet": "", "source": "www.uni-mannheim.de", "link": "https://www.uni-mannheim.de/dws/people/professors/prof-dr-ing-margret-keuper/", "content": "Grouping Problems (in applications such as Image and Motion Segmentation and Multiple Object Tracking) ... Text-Guided Graphics Program Synthesis, by ..."}
+{"idx": 5, "title": "Computer Vision & Machine Learning (Prof. Dr.-Ing. Margret", "date": "", "ddg_snippet": "Grouping Problems (in applications such as Image and Motion Segmentation and Multiple Object Tracking) ... Benchmarking Of Semantic Segmentation .", "subpage_snippet": "", "source": "www.uni-mannheim.de", "link": "https://www.uni-mannheim.de/dws/research/focus-groups/computer-vision-machine-learning-prof-dr-ing-margret-keuper/", "content": "Grouping Problems (in applications such as Image and Motion Segmentation and Multiple Object Tracking) ... Benchmarking Of Semantic Segmentation ."}
+{"idx": 6, "title": "How Do I Download Pictures From Verizon Phone", "date": "", "ddg_snippet": "DCbm Another how do i download of why we screw to away contain ' idea '? practice of possible segments + room of mysterious Age updates so is us to ...", "subpage_snippet": "", "source": "imerinc.com", "link": "http://imerinc.com/yatchclub/node/how-do-i-download-pictures-from-verizon-phone.htm", "content": "DCbm Another how do i download of why we screw to away contain ' idea '? practice of possible segments + room of mysterious Age updates so is us to ..."}
+{"idx": 7, "title": "CN107306087B - A dual-stage converter and its control method -", "date": "", "ddg_snippet": "... by static converters using discharge tubes with control electrode or semiconductor devices with control electrode using devices of a triode or ...", "subpage_snippet": "", "source": "patents.google.com", "link": "https://patents.google.com/patent/CN107306087B/en", "content": "... by static converters using discharge tubes with control electrode or semiconductor devices with control electrode using devices of a triode or ..."}
+{"idx": 8, "title": "US20060064583A1 - Programming interface for configuring a", "date": "", "ddg_snippet": "H04N21/45 — Management operations performed by the client for facilitating the reception of or the interaction with the content or ...", "subpage_snippet": "", "source": "patents.google.com", "link": "https://patents.google.com/patent/US20060064583A1/en", "content": "H04N21/45 — Management operations performed by the client for facilitating the reception of or the interaction with the content or ..."}
+{"idx": 9, "title": "Filopodyan: An open-source pipeline for the analysis of", "date": "", "ddg_snippet": "Our highly customizable pipeline is widely applicable, capable of detecting filopodia in four different cell types in vitro and in vivo.", "subpage_snippet": "", "source": "rupress.org", "link": "https://rupress.org/jcb/article/216/10/3405/38925/Filopodyan-An-open-source-pipeline-for-the", "content": "Our highly customizable pipeline is widely applicable, capable of detecting filopodia in four different cell types in vitro and in vivo."}

data/sampled_jsons/DIKE-ERIS_duality_limitations.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Leuce (mythology) - Wikipedia", "date": "", "ddg_snippet": "The double color, Servius says, made a wreath that represented the duality of the hero's labors in both the upper and the underworld.", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/Leuce_(mythology)", "content": "The double color, Servius says, made a wreath that represented the duality of the hero's labors in both the upper and the underworld."}
+{"idx": 1, "title": "A Three-Branch Checks-and-Balances Framework for Context ...", "date": "", "ddg_snippet": "Oct 12, 2024 · The adversarial DIKE-ERIS duality enables adaptation to diverse cultural contexts while upholding consistent ethical principles. This architecture addresses limitations of reinforcement learning with human feedback (RLHF) by providing interpretable, adaptable, and culturally-aware ethical reasoning.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=o2afWIxjKD", "content": "Oct 12, 2024 · The adversarial DIKE-ERIS duality enables adaptation to diverse cultural contexts while upholding consistent ethical principles. This architecture addresses limitations of reinforcement learning with human feedback (RLHF) by providing interpretable, adaptable, and culturally-aware ethical reasoning."}
+{"idx": 2, "title": "Edward Y. Chang on LinkedIn: How can we address the ...", "date": "", "ddg_snippet": "The DIKE-ERIS duality , through their adversarial interaction, enables adaptation to diverse cultural contexts while maintaining consistent ethical principles.", "subpage_snippet": "", "source": "www.linkedin.com", "link": "https://www.linkedin.com/posts/edward-y-chang-218b182_how-can-we-address-the-challenges-of-genai-activity-7255955883786948608-CqQ8", "content": "The DIKE-ERIS duality , through their adversarial interaction, enables adaptation to diverse cultural contexts while maintaining consistent ethical principles."}
+{"idx": 3, "title": "[2502.00136v1] A Three-Branch Checks-and-Balances ... A Three-Branch Checks-and-Balances Framework for Context ... Ethical Guardrails for AI: A Checks-and-Balances Approach Edward Y. Chang on LinkedIn: How can we address the ... It Takes a Mirror to Find Flaws: Uncovering Biases with ... Integrating Emotional and Linguistic Mod...", "date": "", "ddg_snippet": "Jan 31, 2025 · The adversarial DIKE-ERIS duality enables adaptation to diverse cultural contexts while upholding consistent ethical principles. This architecture addresses limitations of reinforcement learning with human feedback (RLHF) by providing interpretable, adaptable, and culturally-aware ethical reasoning. Oct 12, 2024 · The adversarial DIKE-ERIS duality enables adaptation to diverse cultural contexts while upholding consistent ethical principles. This architecture addresses limitations of reinforcement learning with human feedback (RLHF) by providing interpretable, adaptable, and culturally-aware ethical reasoning. Adversarial dynamics: DIKE-ERIS duality creates robust ethical safeguards Practical security: Addresses critical concerns around safe AI deployment and harmful outputs The DIKE-ERIS duality , through their adversarial interaction, enables adaptation to diverse cultural contexts while maintaining consistent ethical principles. Feb 17, 2024 · The \\ DIKE-\\ERIS duality , through their adversarial interaction, enables adaptation to diverse cultural contexts while maintaining consistent ethical principles. This research develops advanced methodologies for Large Language Models (LLMs) to better manage linguistic behaviors related to emotions and ethics. We introduce DIKE , an adversarial framework that enhances the LLMs' ability to internalize and reflect global human values, adapting to varied cultural contexts to promote transparency and trust among users. The methodology involves detailed ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2502.00136v1", "content": "Jan 31, 2025 · The adversarial DIKE-ERIS duality enables adaptation to diverse cultural contexts while upholding consistent ethical principles. This architecture addresses limitations of reinforcement learning with human feedback (RLHF) by providing interpretable, adaptable, and culturally-aware ethical reasoning. Oct 12, 2024 · The adversarial DIKE-ERIS duality enables adaptation to diverse cultural contexts while upholding consistent ethical principles. This architecture addresses limitations of reinforcement learning with human feedback (RLHF) by providing interpretable, adaptable, and culturally-aware ethical reasoning. Adversarial dynamics: DIKE-ERIS duality creates robust ethical safeguards Practical security: Addresses critical concerns around safe AI deployment and harmful outputs The DIKE-ERIS duality , through their adversarial interaction, enables adaptation to diverse cultural contexts while maintaining consistent ethical principles. Feb 17, 2024 · The \\ DIKE-\\ERIS duality , through their adversarial interaction, enables adaptation to diverse cultural contexts while maintaining consistent ethical principles. This research develops advanced methodologies for Large Language Models (LLMs) to better manage linguistic behaviors related to emotions and ethics. We introduce DIKE , an adversarial framework that enhances the LLMs' ability to internalize and reflect global human values, adapting to varied cultural contexts to promote transparency and trust among users. The methodology involves detailed ..."}
+{"idx": 4, "title": "Ethical Guardrails for AI: A Checks-and-Balances Approach", "date": "", "ddg_snippet": "Adversarial dynamics: DIKE-ERIS duality creates robust ethical safeguards Practical security: Addresses critical concerns around safe AI deployment and harmful outputs", "subpage_snippet": "", "source": "www.zerna.io", "link": "https://www.zerna.io/page/security/presentation_set/security-llm-research/presentation/security-ethical-alignment-fairness/slide/security-paper-2502_00136", "content": "Adversarial dynamics: DIKE-ERIS duality creates robust ethical safeguards Practical security: Addresses critical concerns around safe AI deployment and harmful outputs"}
+{"idx": 5, "title": "It Takes a Mirror to Find Flaws: Uncovering Biases with ...", "date": "", "ddg_snippet": "Feb 17, 2024 · The \\ DIKE-\\ERIS duality , through their adversarial interaction, enables adaptation to diverse cultural contexts while maintaining consistent ethical principles.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/378268332_It_Takes_a_Mirror_to_Find_Flaws_Uncovering_Biases_with_Reflective_Large_Language_Models", "content": "Feb 17, 2024 · The \\ DIKE-\\ERIS duality , through their adversarial interaction, enables adaptation to diverse cultural contexts while maintaining consistent ethical principles."}
+{"idx": 6, "title": "Integrating Emotional and Linguistic Mod...", "date": "", "ddg_snippet": "This research develops advanced methodologies for Large Language Models (LLMs) to better manage linguistic behaviors related to emotions and ethics. We introduce DIKE , an adversarial framework that enhances the LLMs' ability to internalize and reflect global human values, adapting to varied cultural contexts to promote transparency and trust among users. The methodology involves detailed ...", "subpage_snippet": "", "source": "axi.lims.ac.uk", "link": "https://axi.lims.ac.uk/paper/2405.07076", "content": "This research develops advanced methodologies for Large Language Models (LLMs) to better manage linguistic behaviors related to emotions and ethics. We introduce DIKE , an adversarial framework that enhances the LLMs' ability to internalize and reflect global human values, adapting to varied cultural contexts to promote transparency and trust among users. The methodology involves detailed ..."}
+{"idx": 7, "title": "[2502.00136v1] A Three-Branch Checks-and-Balances ...", "date": "", "ddg_snippet": "31 Jan 2025 — The adversarial DIKE-ERIS duality enables adaptation to diverse cultural contexts while upholding consistent ethical principles. This ...", "subpage_snippet": "", "source": "www.arxiv.org", "link": "https://www.arxiv.org/abs/2502.00136v1", "content": "31 Jan 2025 — The adversarial DIKE-ERIS duality enables adaptation to diverse cultural contexts while upholding consistent ethical principles. This ..."}
+{"idx": 8, "title": "A Three-Branch Checks-and-Balances Framework", "date": "", "ddg_snippet": "The adversarial DIKE - ERIS duality enables adaptation to diverse cultural contexts while upholding consistent ethical principles. This architecture addresses limitations of reinforcement learning with human feedback (RLHF) by providing interpretable, adaptable, and...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=o2afWIxjKD", "content": "The adversarial DIKE - ERIS duality enables adaptation to diverse cultural contexts while upholding consistent ethical principles. This architecture addresses limitations of reinforcement learning with human feedback (RLHF) by providing interpretable, adaptable, and..."}
+{"idx": 9, "title": "(PDF) Multi-LLM Agent Collaborative Intelligence: The Path to Artificial...", "date": "", "ddg_snippet": "The DIKE - ERIS duality , through their adversarial interaction, enables. adaptation to diverse cultural contexts while maintaining consistent. ethical principles.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/387541177_Multi-LLM_Agent_Collaborative_Intelligence_The_Path_to_Artificial_General_Intelligence_3rd_edition", "content": "The DIKE - ERIS duality , through their adversarial interaction, enables. adaptation to diverse cultural contexts while maintaining consistent. ethical principles."}

data/sampled_jsons/Definition_4.2_(Per-Instance_Privacy_Loss)_Leveraging_Per-Instance_Privacy_for_Machine_Unlearning.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Leveraging Per - Instance Privacy for Machine Unlearning", "date": "", "ddg_snippet": ". 4 Per - Instance Unlearning Difficulty Analysis. Our goal is to bound the number of steps Definition 4 . 2 ( Per - Instance Privacy Loss ). Recall that. νT,Dsubscript𝜈𝑇𝐷\\nu_{T,D}italic_ν start_POSTSUBSCRIPT italic_T , italic_D end_POSTSUBSCRIPT.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2505.18786v1", "content": ". 4 Per - Instance Unlearning Difficulty Analysis. Our goal is to bound the number of steps Definition 4 . 2 ( Per - Instance Privacy Loss ). Recall that. νT,Dsubscript𝜈𝑇𝐷\\nu_{T,D}italic_ν start_POSTSUBSCRIPT italic_T , italic_D end_POSTSUBSCRIPT."}
+{"idx": 1, "title": "Leveraging Per-Instance Privacy for Machine Unlearning", "date": "", "ddg_snippet": "We present a principled, per - instance approach to quantifying the dificulty of unlearning via fine-tuning.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2505.18786", "content": "We present a principled, per - instance approach to quantifying the dificulty of unlearning via fine-tuning."}
+{"idx": 2, "title": "Leveraging Per - Instance Privacy for Machine Unlearning", "date": "", "ddg_snippet": "Definition 4 . 2 ( Per - Instance Privacy Loss ). Per - instance Privacy loss We compute the terms in the privacy loss P (x, α) stated in Definition 4 . 2 by taking a Monte-Carlo estimate from a single training run with check-points w0, ws1 , ws2 , · · · , wsN , i.e.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=0A4Y9qRnu9", "content": "Definition 4 . 2 ( Per - Instance Privacy Loss ). Per - instance Privacy loss We compute the terms in the privacy loss P (x, α) stated in Definition 4 . 2 by taking a Monte-Carlo estimate from a single training run with check-points w0, ws1 , ws2 , · · · , wsN , i.e."}
+{"idx": 3, "title": "RL-Finetuned LLMs for Privacy-Preserving Synthetic Rewriting", "date": "", "ddg_snippet": "... focus on pattern-matching for structured PII, often fall short in addressing complex, context-dependent implicit and stylometric privacy leakages [ 4 ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2508.19286v1", "content": "... focus on pattern-matching for structured PII, often fall short in addressing complex, context-dependent implicit and stylometric privacy leakages [ 4 ..."}
+{"idx": 4, "title": "How to choose the right reserved instance in Azure | Microsoft", "date": "", "ddg_snippet": "A reserved instance is a way to prepay for a certain amount of compute usage in Azure for a fixed period of time (either one or three years [1]), at ...", "subpage_snippet": "", "source": "techcommunity.microsoft.com", "link": "https://techcommunity.microsoft.com/blog/finopsblog/how-to-choose-the-right-reserved-instance-in-azure/4124218", "content": "A reserved instance is a way to prepay for a certain amount of compute usage in Azure for a fixed period of time (either one or three years [1]), at ..."}
+{"idx": 5, "title": "Decentralised, collaborative, and privacy-preserving machine", "date": "", "ddg_snippet": "... training frameworks either do not provide the correct level of privacy protection for individual patients or achieve the best utility- privacy trade ...", "subpage_snippet": "", "source": "www.thelancet.com", "link": "https://www.thelancet.com/journals/ebiom/article/PIIS2352-3964(24)00041-0/fulltext", "content": "... training frameworks either do not provide the correct level of privacy protection for individual patients or achieve the best utility- privacy trade ..."}
+{"idx": 6, "title": "Why Production Machine Vision Systems Matter Today", "date": "", "ddg_snippet": "For instance , Averroes.ai reduced weekly false rejects from 12,000 units to just 246 units, saving over $18 million annually per production line.", "subpage_snippet": "", "source": "www.unitxlabs.com", "link": "https://www.unitxlabs.com/resources/why-production-machine-vision-systems-matter/", "content": "For instance , Averroes.ai reduced weekly false rejects from 12,000 units to just 246 units, saving over $18 million annually per production line."}
+{"idx": 7, "title": "US11188791B2 - Anonymizing data for preserving privacy during", "date": "", "ddg_snippet": "2019-11-18 Assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION reassignment INTERNATIONAL BUSINESS MACHINES CORPORATION ASSIGNMENT OF ASSIGNORS ...", "subpage_snippet": "", "source": "patents.google.com", "link": "https://patents.google.com/patent/US11188791B2/en", "content": "2019-11-18 Assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION reassignment INTERNATIONAL BUSINESS MACHINES CORPORATION ASSIGNMENT OF ASSIGNORS ..."}
+{"idx": 8, "title": "Daniel Roy", "date": "", "ddg_snippet": "I co-organized the first workshop on probabilistic programming for statistics and machine learning at NIPS*2008 (with Vikash Mansinghka, John Winn ...", "subpage_snippet": "", "source": "danroy.org", "link": "http://danroy.org/", "content": "I co-organized the first workshop on probabilistic programming for statistics and machine learning at NIPS*2008 (with Vikash Mansinghka, John Winn ..."}
+{"idx": 9, "title": "Click Without Compromise: Online Advertising Measurement via", "date": "", "ddg_snippet": "... raised increasing privacy concerns regarding user consent, data security, and the potential misuse of personal information [ 48 , 57 , 27 , 49 ] .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2406.02463v3", "content": "... raised increasing privacy concerns regarding user consent, data security, and the potential misuse of personal information [ 48 , 57 , 27 , 49 ] ."}

data/sampled_jsons/Emerging_Properties_in_Self-Supervised_Vision_Transformers_Caron_ICCV_2021.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Emerging Properties in Self - Supervised Vision Transformers", "date": "", "ddg_snippet": "View a PDF of the paper titled Emerging Properties in Self - Supervised Vision Transformers , by Mathilde Caron and 6 other authors.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2104.14294", "content": "View a PDF of the paper titled Emerging Properties in Self - Supervised Vision Transformers , by Mathilde Caron and 6 other authors."}
+{"idx": 1, "title": "ICCV 2021 Open Access Repository", "date": "", "ddg_snippet": "Emerging Properties in Self - Supervised Vision Transformers . Mathilde Caron , Hugo Touvron, Ishan Misra, Hervé Jégou, Julien Mairal, Piotr Bojanowski, Armand Joulin; Proceedings of the IEEE/CVF International Conference on Computer Vision ( ICCV ), 2021 , pp. 9650-9660.", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/ICCV2021/html/Caron_Emerging_Properties_in_Self-Supervised_Vision_Transformers_ICCV_2021_paper", "content": "Emerging Properties in Self - Supervised Vision Transformers . Mathilde Caron , Hugo Touvron, Ishan Misra, Hervé Jégou, Julien Mairal, Piotr Bojanowski, Armand Joulin; Proceedings of the IEEE/CVF International Conference on Computer Vision ( ICCV ), 2021 , pp. 9650-9660."}
+{"idx": 2, "title": "[PDF] Emerging Properties in Self - Supervised Vision Transformers", "date": "", "ddg_snippet": "@article{ Caron 2021 EmergingPI, title={ Emerging Properties in Self - Supervised Vision Transformers }, author={Mathilde Caron and Hugo Touvron and Ishan Misra and Herv'e J'egou and Julien Mairal and Piotr Bojanowski and Armand Joulin}, journal={ 2021 IEEE/CVF...", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/Emerging-Properties-in-Self-Supervised-Vision-Caron-Touvron/ad4a0938c48e61b7827869e4ac3baffd0aefab35", "content": "@article{ Caron 2021 EmergingPI, title={ Emerging Properties in Self - Supervised Vision Transformers }, author={Mathilde Caron and Hugo Touvron and Ishan Misra and Herv'e J'egou and Julien Mairal and Piotr Bojanowski and Armand Joulin}, journal={ 2021 IEEE/CVF..."}
+{"idx": 3, "title": "Emerging Properties in Self - Supervised Vision Transformers", "date": "", "ddg_snippet": "Conference: 2021 IEEE/CVF International Conference on Computer Vision ( ICCV ). Authors... DINO [63] (short for Self-DIstillation with NO Labels) is a self - supervised learning framework that trains vision transformers (ViTs) [44] without requiring any labeled data.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/359005314_Emerging_Properties_in_Self-Supervised_Vision_Transformers", "content": "Conference: 2021 IEEE/CVF International Conference on Computer Vision ( ICCV ). Authors... DINO [63] (short for Self-DIstillation with NO Labels) is a self - supervised learning framework that trains vision transformers (ViTs) [44] without requiring any labeled data."}
+{"idx": 4, "title": "Emerging Properties in Self - Supervised Vision Transformers", "date": "", "ddg_snippet": "In this paper, we question if self - supervised learning provides new properties to Vision Transformer (ViT) that stand out compared to convolutional networks (convnets).", "subpage_snippet": "", "source": "deepai.org", "link": "https://deepai.org/publication/emerging-properties-in-self-supervised-vision-transformers", "content": "In this paper, we question if self - supervised learning provides new properties to Vision Transformer (ViT) that stand out compared to convolutional networks (convnets)."}
+{"idx": 5, "title": "Emerging Properties in Self - Supervised Vision Transformers", "date": "", "ddg_snippet": "Communication Dans Un Congrès Année : 2021 . Emerging Properties in Self - Supervised Vision Transformers .In this paper, we question if self - supervised learning provides new properties to Vision Transformer (ViT) that stand out compared to convolutional networks (convnets).", "subpage_snippet": "", "source": "hal.science", "link": "https://hal.science/hal-03323359", "content": "Communication Dans Un Congrès Année : 2021 . Emerging Properties in Self - Supervised Vision Transformers .In this paper, we question if self - supervised learning provides new properties to Vision Transformer (ViT) that stand out compared to convolutional networks (convnets)."}
+{"idx": 6, "title": "Mathilde Caron - Google Akademik", "date": "", "ddg_snippet": "Emerging properties in self - supervised vision transformers .Proceedings of the International Conference on Computer Vision ( ICCV ), 2021 .", "subpage_snippet": "", "source": "scholar.google.co.id", "link": "https://scholar.google.co.id/citations?user=eiB0s-kAAAAJ&hl=tr", "content": "Emerging properties in self - supervised vision transformers .Proceedings of the International Conference on Computer Vision ( ICCV ), 2021 ."}
+{"idx": 7, "title": "DINO: Self - Supervised Vision Transformers and Their Emerging ...", "date": "", "ddg_snippet": "The paper “ Emerging Properties in Self - Supervised Vision Transformers ” introduces DINO, a novel self - supervised learning approach that reveals unique properties of Vision Transformers and achieves state-of-the-art performance.", "subpage_snippet": "", "source": "medium.com", "link": "https://medium.com/@jimcanary/dino-self-supervised-vision-transformers-and-their-emerging-properties-7f9e5f4adac4", "content": "The paper “ Emerging Properties in Self - Supervised Vision Transformers ” introduces DINO, a novel self - supervised learning approach that reveals unique properties of Vision Transformers and achieves state-of-the-art performance."}
+{"idx": 8, "title": "DINO: Emerging Properties in Self - Supervised Vision Transformers", "date": "", "ddg_snippet": "This study questions if Self Supervised Learning provides new properties to Vision Transformers [1] that standout from convolutional networks and underlines the importance of momentum encoder[2], multi-crop training[3] and the use of small patches.", "subpage_snippet": "", "source": "wandb.ai", "link": "https://wandb.ai/self-supervised-learning/dino/reports/DINO-Emerging-Properties-in-Self-Supervised-Vision-Transformers--VmlldzoxMzM2MTAz", "content": "This study questions if Self Supervised Learning provides new properties to Vision Transformers [1] that standout from convolutional networks and underlines the importance of momentum encoder[2], multi-crop training[3] and the use of small patches."}
+{"idx": 9, "title": "DINO - Emerging properties in self - supervised vision transformers", "date": "", "ddg_snippet": "The emerging properties which have been identified to come up especially when using a vision transformer are: The attention features contain semantic segmentation like properties without being trained in this way (no labels, no supervision ).", "subpage_snippet": "", "source": "www.paepper.com", "link": "https://www.paepper.com/blog/posts/dino-emerging-properties-in-self-supervised-vision-transformers/", "content": "The emerging properties which have been identified to come up especially when using a vision transformer are: The attention features contain semantic segmentation like properties without being trained in this way (no labels, no supervision )."}

data/sampled_jsons/Emotion_Analysis_GPT-4_analyzes_each_rewritten_document_to_identify_the_top_M_emotions.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "(PDF) Integrating Emotional and Linguistic Models for Ethical...", "date": "", "ddg_snippet": "Emotion Analysis : GPT - 4 analyzes each rewritten document to identify the top . M .", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/380515639_Integrating_Emotional_and_Linguistic_Models_for_Ethical_Compliance_in_Large_Language_Models", "content": "Emotion Analysis : GPT - 4 analyzes each rewritten document to identify the top . M ."}
+{"idx": 1, "title": "Integrating Emotional and Linguistic Models for", "date": "", "ddg_snippet": "linguistic behaviors on the behavior spectrum Ψ. 2. Emotion Analysis : GPT - 4 analyzes each rewritten document to identify the top M emotions .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2405.07076", "content": "linguistic behaviors on the behavior spectrum Ψ. 2. Emotion Analysis : GPT - 4 analyzes each rewritten document to identify the top M emotions ."}
+{"idx": 2, "title": "integrating-emotional-and-linguistic-models-for-ethical- ...", "date": "", "ddg_snippet": "... Emotion Analysis: GPT-4 analyzes each rewritten document to identify the top M emotions . It then tallies the frequencies of these top emotions across all N ...", "subpage_snippet": "", "source": "scispace.com", "link": "https://scispace.com/pdf/integrating-emotional-and-linguistic-models-for-ethical-c8c5drc4bk.pdf", "content": "... Emotion Analysis: GPT-4 analyzes each rewritten document to identify the top M emotions . It then tallies the frequencies of these top emotions across all N ..."}
+{"idx": 3, "title": "The Influence of Text Variation on User Engagement in", "date": "", "ddg_snippet": "To answer these questions, we build a large-scale dataset of Reddit posts sharing YouTube videos to enable a comprehensive cross-platform, multimodal ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2505.03769v1", "content": "To answer these questions, we build a large-scale dataset of Reddit posts sharing YouTube videos to enable a comprehensive cross-platform, multimodal ..."}
+{"idx": 4, "title": "Top 15 ChatGPT Rewriter Tools to Improve Your Content Creation", "date": "", "ddg_snippet": "Leveraging the capabilities of the GPT (Generative Pre-trained Transformer) model developed by OpenAI, these tools offer a range of functionalities ...", "subpage_snippet": "", "source": "speedybrand.io", "link": "https://speedybrand.io/blogs/chatgpt-rewriter", "content": "Leveraging the capabilities of the GPT (Generative Pre-trained Transformer) model developed by OpenAI, these tools offer a range of functionalities ..."}
+{"idx": 5, "title": "source code analysis of Amazon Kiro", "date": "", "ddg_snippet": "It uses OpenVSX to attempt to work around the fractured ecosystem problem (see below) which means that developers who use programming languages such ...", "subpage_snippet": "", "source": "ghuntley.com", "link": "https://ghuntley.com/amazon-kiro-source-code/", "content": "It uses OpenVSX to attempt to work around the fractured ecosystem problem (see below) which means that developers who use programming languages such ..."}
+{"idx": 6, "title": "Top 13 Advanced RAG Techniques for Your Next Project", "date": "", "ddg_snippet": "The first step is to load the documents , then split or chunk it using various chunking techniques and then embed it using an embedding model so that ...", "subpage_snippet": "", "source": "www.analyticsvidhya.com", "link": "https://www.analyticsvidhya.com/blog/2025/04/advanced-rag-techniques/", "content": "The first step is to load the documents , then split or chunk it using various chunking techniques and then embed it using an embedding model so that ..."}
+{"idx": 7, "title": "Top Tech Tidbits for Thursday, November 23, 2023 - Volume 938", "date": "", "ddg_snippet": "I am excited to report that we have been working on a custom GPT for Top Tech Tidbits, using the new ChatGPT Plus Custom GPT feature , that ...", "subpage_snippet": "", "source": "www.toptechtidbits.com", "link": "https://www.toptechtidbits.com/tidbits2023/11232023/index.html", "content": "I am excited to report that we have been working on a custom GPT for Top Tech Tidbits, using the new ChatGPT Plus Custom GPT feature , that ..."}
+{"idx": 8, "title": "A Three-Branch Checks-and-Balances Framework", "date": "", "ddg_snippet": "2. Emotion Analysis : GPT - 4 analyzes each rewritten document to identify the top M emotions . It then tallies the frequencies of these top emotions across all N × L instances.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=o2afWIxjKD", "content": "2. Emotion Analysis : GPT - 4 analyzes each rewritten document to identify the top M emotions . It then tallies the frequencies of these top emotions across all N × L instances."}
+{"idx": 9, "title": "How Generative AI Works and How to Use LLMs Wisely — Halo Lab", "date": "", "ddg_snippet": "Each token has its own probability (weight) of use, which helps an LLM choose the most likely options. ... mechanism allows you to take into account ...", "subpage_snippet": "", "source": "www.halo-lab.com", "link": "https://www.halo-lab.com/blog/llms-how-they-work-and-how-to-use-them", "content": "Each token has its own probability (weight) of use, which helps an LLM choose the most likely options. ... mechanism allows you to take into account ..."}

data/sampled_jsons/Equation_(1)_FBox_score_box_embeddings_siteopenreview.net.jsonl

@@ -0,0 +1,7 @@
+{"idx": 0, "title": "Representing Sentence Interpretations with Overlapping Box ...", "date": "", "ddg_snippet": "3.1.1 Box Embeddings Box embeddings represent items as n-dimensional hyperrectangles. A box embedding b is con-structed from two vectors: a center vector c and an offset vector o. For each ith dimension, the area of a box embedding is defined as the interval [ci − oi, ci + oi].", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=DEB8muQHYh", "content": "3.1.1 Box Embeddings Box embeddings represent items as n-dimensional hyperrectangles. A box embedding b is con-structed from two vectors: a center vector c and an offset vector o. For each ith dimension, the area of a box embedding is defined as the interval [ci − oi, ci + oi]."}
+{"idx": 1, "title": "Dual Box Embeddings for the Description Logic EL++ - OpenReview", "date": "", "ddg_snippet": "Figure 1 illustrates 2-dimensional Box2EL embeddings 326 that form a logical model of the TBox in Example 1, since, e.g., 327 Box (Father) ⊆ Box (Parent) ∩ Box (Male) and Equation (1 ) holds 328 for all relevant axioms.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=gTPTgixn3r", "content": "Figure 1 illustrates 2-dimensional Box2EL embeddings 326 that form a logical model of the TBox in Example 1, since, e.g., 327 Box (Father) ⊆ Box (Parent) ∩ Box (Male) and Equation (1 ) holds 328 for all relevant axioms."}
+{"idx": 2, "title": "A GEOMETRIC APPROACH TO PERSONALIZED RECOMMENDATION WITH SET ...", "date": "", "ddg_snippet": "193 Let, Box (m) = QD d=1[m⌞ d, m⌝ d] be the box embeddings for a movie m. At dimension d, the volume 194 of intersection between user u and movie m is defined as - 195 196 ⌝ d s completely contained by us d,u⌝d),(m⌞d,m⌝d)) = 1. This objective creates a set-theoretic interpretation with box embeddings , Vol((u⌞", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=0HWAbWgI3T", "content": "193 Let, Box (m) = QD d=1[m⌞ d, m⌝ d] be the box embeddings for a movie m. At dimension d, the volume 194 of intersection between user u and movie m is defined as - 195 196 ⌝ d s completely contained by us d,u⌝d),(m⌞d,m⌝d)) = 1. This objective creates a set-theoretic interpretation with box embeddings , Vol((u⌞"}
+{"idx": 3, "title": "S moothing the g eometry", "date": "", "ddg_snippet": "Table 5: F 1 scores of the box lattice, order embeddings , and our smoothed model, for different levels of label imbalance on the WordNet mammal subset.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=H1xSNiRcF7", "content": "Table 5: F 1 scores of the box lattice, order embeddings , and our smoothed model, for different levels of label imbalance on the WordNet mammal subset."}
+{"idx": 4, "title": "A Geometric Approach to Personalized Recommendation with...", "date": "", "ddg_snippet": "May 1 , 2025 · This paper presents a geometric approach to recommender systems using box embeddings where users, items, and attributes are all represented as boxes in the latent space to facilitate set-theoretic operations, such as negation and intersection, e.g., recommending a comedy but not romance. Overall the paper received positive-leaning scores where all reviewers praise the innovative usage of the ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=27tMzmzDjO", "content": "May 1 , 2025 · This paper presents a geometric approach to recommender systems using box embeddings where users, items, and attributes are all represented as boxes in the latent space to facilitate set-theoretic operations, such as negation and intersection, e.g., recommending a comedy but not romance. Overall the paper received positive-leaning scores where all reviewers praise the innovative usage of the ..."}
+{"idx": 5, "title": "Locality Sensitive Hashing in Fourier Frequency Domain For ...", "date": "", "ddg_snippet": "Box Embeddings The box embedding based volume score can be expressed as a shift invariant score a (q q x x). Here, the query and corpus items are expressed as boxes denoted by (z z q, Z Z q) and (z z x, Z Z x) respectively (the lower and upper corner coordinate vectors).", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=rUf0GV5CuU", "content": "Box Embeddings The box embedding based volume score can be expressed as a shift invariant score a (q q x x). Here, the query and corpus items are expressed as boxes denoted by (z z q, Z Z q) and (z z x, Z Z x) respectively (the lower and upper corner coordinate vectors)."}
+{"idx": 6, "title": "B : HIERARCHICAL CONCEPT REPRESENTATION O EMBEDDING OF BINARY ...", "date": "", "ddg_snippet": "s as HEC and probabilistic box embeddings with temperatures as T- Box . We report balanced accuracy, meaning we either ensure the positive and negative test sizes are equal (for reconstr ction) or re-weight the negative samples (for trans tive", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=zkE2js9qRe", "content": "s as HEC and probabilistic box embeddings with temperatures as T- Box . We report balanced accuracy, meaning we either ensure the positive and negative test sizes are equal (for reconstr ction) or re-weight the negative samples (for trans tive"}

data/sampled_jsons/Evaluating_Generative_AI_Systems_Is_a_Social_Science_Measurement_Challenge_Section_6_a_lot_of_work_c.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Position: Evaluating Generative AI Systems Is a Social ...", "date": "", "ddg_snippet": "by H Wallach · 2025 · Cited by 12 — We present a four-level framework, grounded in measurement theory from the social sciences , for measuring concepts related to the capabilities, behaviors, and ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2502.00561", "content": "by H Wallach · 2025 · Cited by 12 — We present a four-level framework, grounded in measurement theory from the social sciences , for measuring concepts related to the capabilities, behaviors, and ..."}
+{"idx": 1, "title": "A Validity-Centered Framework for AI Evaluation", "date": "", "ddg_snippet": "Position: Evaluating generative ai systems is a social science measurement challenge . arXiv preprint arXiv:2502.00561, 2025. Kuhn (1997) ↑ Thomas S Kuhn ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2505.10573v3", "content": "Position: Evaluating generative ai systems is a social science measurement challenge . arXiv preprint arXiv:2502.00561, 2025. Kuhn (1997) ↑ Thomas S Kuhn ..."}
+{"idx": 2, "title": "Methodological Challenges in Agentic Evaluations of AI ...", "date": "", "ddg_snippet": "by K Wei — Posi- tion: Evaluating Generative AI Systems is a Social Sci- ence Measurement Challenge , February 2025. URL https://arxiv.org/abs/2502.00561. Wang, A ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=ZhSKG8IslC", "content": "by K Wei — Posi- tion: Evaluating Generative AI Systems is a Social Sci- ence Measurement Challenge , February 2025. URL https://arxiv.org/abs/2502.00561. Wang, A ..."}
+{"idx": 3, "title": "Integrating Generative Artificial Intelligence into Social ...", "date": "", "ddg_snippet": "7 May 2025 — This essay introduces a special issue that examines how these and other affordances of generative AI can advance social science research.", "subpage_snippet": "", "source": "journals.sagepub.com", "link": "https://journals.sagepub.com/doi/10.1177/00491241251339184", "content": "7 May 2025 — This essay introduces a special issue that examines how these and other affordances of generative AI can advance social science research."}
+{"idx": 4, "title": "Generative AI in Computer Science Education", "date": "", "ddg_snippet": "by D Franklin · 2025 · Cited by 6 — Generative AI is a disruptive technology that has the potential to transform many aspects of how computer science is taught.", "subpage_snippet": "", "source": "www.cambridge.org", "link": "https://www.cambridge.org/core/elements/generative-ai-in-computer-science-education/0A22106CBD7FCB391FD120C56E21420F", "content": "by D Franklin · 2025 · Cited by 6 — Generative AI is a disruptive technology that has the potential to transform many aspects of how computer science is taught."}
+{"idx": 5, "title": "Challenges in evaluating AI systems", "date": "", "ddg_snippet": "4 Oct 2023 — We want readers of this post to have two main takeaways: robust evaluations are extremely difficult to develop and implement , and effective AI governance ...", "subpage_snippet": "", "source": "www.anthropic.com", "link": "https://www.anthropic.com/research/evaluating-ai-systems", "content": "4 Oct 2023 — We want readers of this post to have two main takeaways: robust evaluations are extremely difficult to develop and implement , and effective AI governance ..."}
+{"idx": 6, "title": "Impacts of generative artificial intelligence on the future ...", "date": "", "ddg_snippet": "by N Salari · 2025 · Cited by 9 — This systematic review is conducted to examine the impacts of GenAI on the future of employment, focusing on concerns about rising unemployment.", "subpage_snippet": "", "source": "www.sciencedirect.com", "link": "https://www.sciencedirect.com/science/article/pii/S2451958825000673", "content": "by N Salari · 2025 · Cited by 9 — This systematic review is conducted to examine the impacts of GenAI on the future of employment, focusing on concerns about rising unemployment."}
+{"idx": 7, "title": "AI Governance Needs Sociotechnical Expertise", "date": "", "ddg_snippet": "DeepMind researchers have proposed a sociotechnical safety evaluation of generative AI systems by incorporating two additional layers to safety evaluation ...", "subpage_snippet": "", "source": "datasociety.net", "link": "https://datasociety.net/wp-content/uploads/2024/05/DS_AI_Governance_Policy_Brief.pdf", "content": "DeepMind researchers have proposed a sociotechnical safety evaluation of generative AI systems by incorporating two additional layers to safety evaluation ..."}
+{"idx": 8, "title": "ChatGPT and Beyond: Exploring the Responsible Use of ...", "date": "", "ddg_snippet": "by M Söllner · 2025 · Cited by 15 — ChatGPT and Beyond: Exploring the Responsible Use of Generative AI in the Workplace. An Interdisciplinary Perspective. Download PDF.", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/article/10.1007/s12599-025-00932-8", "content": "by M Söllner · 2025 · Cited by 15 — ChatGPT and Beyond: Exploring the Responsible Use of Generative AI in the Workplace. An Interdisciplinary Perspective. Download PDF."}
+{"idx": 9, "title": "Unpacking the Gap in Human-Centered Evaluations of AI ...", "date": "", "ddg_snippet": "by A Khullar · 2025 — We argue for assessing broader achievements enabled through AI's use when conducting human-centered evaluations of AI .", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/full/10.1145/3706598.3713278", "content": "by A Khullar · 2025 — We argue for assessing broader achievements enabled through AI's use when conducting human-centered evaluations of AI ."}

data/sampled_jsons/FlowDec_is_not_streaming-capable_due_to_the_noncausal_architecture_of_the_used_DNNs.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Results obtained for the Voicebank-Demand. Values indicate mean and...", "date": "", "ddg_snippet": "... While FlowDec , like DAC, is currently not streaming - capable due to the noncausal architecture of the used DNNs , our postfilter approach can be modified for a causal DNN as in (Richter et al., 2024a), which would pave the way for real-time communication and audio streaming...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/figure/Results-obtained-for-the-Voicebank-Demand-Values-indicate-mean-and-standard-deviation_tbl2_379089990", "content": "... While FlowDec , like DAC, is currently not streaming - capable due to the noncausal architecture of the used DNNs , our postfilter approach can be modified for a causal DNN as in (Richter et al., 2024a), which would pave the way for real-time communication and audio streaming..."}
+{"idx": 1, "title": "FlowDec : A flow -based full-band general audio codec with high...", "date": "", "ddg_snippet": "While FlowDec , like DAC, is currently not streaming - capable due to the noncausal architecture of the used DNNs , our postfilter approach can be modified for a causal DNN as in (Richter et al., 2024a) , which would pave the way for real-time communication and audio streaming applications.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2503.01485v1", "content": "While FlowDec , like DAC, is currently not streaming - capable due to the noncausal architecture of the used DNNs , our postfilter approach can be modified for a causal DNN as in (Richter et al., 2024a) , which would pave the way for real-time communication and audio streaming applications."}
+{"idx": 2, "title": "Ethereal Prism Rod | Fisch Wiki | Fandom", "date": "", "ddg_snippet": "The Ethereal Prism Rod is an extremely powerful, money-making, all-rounder stat late-game rod costing 15,000,000 C$ , due to its mutation passive, having a 50% chance to apply the 8x sell value Prismize mutation .", "subpage_snippet": "", "source": "fisch.fandom.com", "link": "https://fisch.fandom.com/wiki/Ethereal_Prism_Rod", "content": "The Ethereal Prism Rod is an extremely powerful, money-making, all-rounder stat late-game rod costing 15,000,000 C$ , due to its mutation passive, having a 50% chance to apply the 8x sell value Prismize mutation ."}
+{"idx": 3, "title": "AI Architecture Generator – Realize Your Vision with Leonardo.Ai", "date": "", "ddg_snippet": "Enhance your architectural design process with Leonardo.Ai's AI architecture generator tools. Create stunning mockups, concept designs, and dynamic videos to streamline your workflow.", "subpage_snippet": "", "source": "leonardo.ai", "link": "https://leonardo.ai/ai-architecture-generator/", "content": "Enhance your architectural design process with Leonardo.Ai's AI architecture generator tools. Create stunning mockups, concept designs, and dynamic videos to streamline your workflow."}
+{"idx": 4, "title": "Humanize AI Text Free- Get 100% Human Score", "date": "", "ddg_snippet": "Students can use AI Humanizer to refine essays and homework, improving the flow and readability while adhering to academic standards. It’s the perfect tool for boosting grades and enhancing writing skills.", "subpage_snippet": "", "source": "decopy.ai", "link": "https://decopy.ai/ai-humanizer/", "content": "Students can use AI Humanizer to refine essays and homework, improving the flow and readability while adhering to academic standards. It’s the perfect tool for boosting grades and enhancing writing skills."}
+{"idx": 5, "title": "ChatPlanet - Random Video Chat Roulette", "date": "", "ddg_snippet": "Here, you can meet interesting people from around the globe through random video chats. Whether you're looking to make new friends, share experiences, or simply enjoy some light-hearted banter, ChatPlanet is the perfect place for you. Just click to start, and let the conversations flow !", "subpage_snippet": "", "source": "videochatplanet.com", "link": "https://videochatplanet.com/", "content": "Here, you can meet interesting people from around the globe through random video chats. Whether you're looking to make new friends, share experiences, or simply enjoy some light-hearted banter, ChatPlanet is the perfect place for you. Just click to start, and let the conversations flow !"}
+{"idx": 6, "title": "Can AI Actually Create a Python Trading Bot Specifically for...", "date": "", "ddg_snippet": "The potential lies in using AI models to create custom strategies, manage data, and even automate certain aspects of trading, though the actual level of automation achievable directly through Python code on Thinkorswim is constrained by the platform’s architecture .", "subpage_snippet": "", "source": "trading-strategies.academy", "link": "https://trading-strategies.academy/archives/1645", "content": "The potential lies in using AI models to create custom strategies, manage data, and even automate certain aspects of trading, though the actual level of automation achievable directly through Python code on Thinkorswim is constrained by the platform’s architecture ."}
+{"idx": 7, "title": "“I Want To Enjoy Every Minute That I Can”: For... | British Vogue", "date": "", "ddg_snippet": "They are capable of tracking your browser across other sites and building up a profile of your interests. This may impact the content and messages you see on other websites you visit.You can refuse the use of this cookie by switching off the slider to the right.", "subpage_snippet": "", "source": "www.vogue.co.uk", "link": "https://www.vogue.co.uk/article/lando-norris-interview", "content": "They are capable of tracking your browser across other sites and building up a profile of your interests. This may impact the content and messages you see on other websites you visit.You can refuse the use of this cookie by switching off the slider to the right."}
+{"idx": 8, "title": "Historical Consciousness: What Germany Could Learn from Russia", "date": "", "ddg_snippet": "I use the term “historical consciousness” because I consider it the best antidote to the repetition of catastrophes.“Despite this betrayal of the Soviet Union, Russia still uses diplomatic and friendly words toward the US, which is actually astonishing.”", "subpage_snippet": "", "source": "sonar21.com", "link": "https://sonar21.com/historical-consciousness-what-germany-could-learn-from-russia/", "content": "I use the term “historical consciousness” because I consider it the best antidote to the repetition of catastrophes.“Despite this betrayal of the Soviet Union, Russia still uses diplomatic and friendly words toward the US, which is actually astonishing.”"}
+{"idx": 9, "title": "International Departures", "date": "", "ddg_snippet": "Fraport TAV Antalya Airport Operator cannot be held responsible for any damages that may arise from the use of this information, inaccuracies or deficiencies. Please refer to the airline company for more detailed information on flights.", "subpage_snippet": "", "source": "www.antalya-airport.aero", "link": "https://www.antalya-airport.aero/passengers-visitors/flight-info/international-departures", "content": "Fraport TAV Antalya Airport Operator cannot be held responsible for any damages that may arise from the use of this information, inaccuracies or deficiencies. Please refer to the airline company for more detailed information on flights."}

data/sampled_jsons/FourCastNet_A_Global_Data-driven_High-resolution_Weather_Model_using_Adaptive_Fourier_Neural_Operato.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "FourCastNet: A Global Data-driven High-resolution Weather Model using ...", "date": "", "ddg_snippet": "FourCastNet , short for Fourier Forecasting Neural Network, is a global data-driven weather forecasting model that provides accurate short to medium-range global predictions at $0.25^{\\\\circ}$ resolution . FourCastNet accurately forecasts high-resolution , fast-timescale variables such as the surface wind speed, precipitation, and atmospheric water vapor. It has important implications for ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2202.11214", "content": "FourCastNet , short for Fourier Forecasting Neural Network, is a global data-driven weather forecasting model that provides accurate short to medium-range global predictions at $0.25^{\\\\circ}$ resolution . FourCastNet accurately forecasts high-resolution , fast-timescale variables such as the surface wind speed, precipitation, and atmospheric water vapor. It has important implications for ..."}
+{"idx": 1, "title": "FourCastNet: Accelerating Global High-Resolution Weather Forecasting ...", "date": "", "ddg_snippet": "We report that a data-driven deep learning Earth system emulator, FourCastNet , can predict global weather and generate medium-range forecasts five orders-of-magnitude faster than NWP while approaching state-of-the-art accuracy.", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/10.1145/3592979.3593412", "content": "We report that a data-driven deep learning Earth system emulator, FourCastNet , can predict global weather and generate medium-range forecasts five orders-of-magnitude faster than NWP while approaching state-of-the-art accuracy."}
+{"idx": 2, "title": "Global Data-driven High-resolution Weather Model - GitHub", "date": "", "ddg_snippet": "@article {pathak2022fourcastnet, title = { Fourcastnet : A global data-driven high-resolution weather model using adaptive fourier neural operators }, author = {Pathak, Jaideep and Subramanian, Shashank and Harrington, Peter and Raja, Sanjeev and Chattopadhyay, Ashesh and Mardani, Morteza and Kurth, Thorsten and Hall, David and Li, Zongyi and Azizzadenesheli, Kamyar and others}, journal = { arXiv ...", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/yrqUni/FourCastNet", "content": "@article {pathak2022fourcastnet, title = { Fourcastnet : A global data-driven high-resolution weather model using adaptive fourier neural operators }, author = {Pathak, Jaideep and Subramanian, Shashank and Harrington, Peter and Raja, Sanjeev and Chattopadhyay, Ashesh and Mardani, Morteza and Kurth, Thorsten and Hall, David and Li, Zongyi and Azizzadenesheli, Kamyar and others}, journal = { arXiv ..."}
+{"idx": 3, "title": "FourCastNet: A Data-driven Model for High-resolution Weather ... - ICLR", "date": "", "ddg_snippet": "Poster in Workshop: AI for Earth and Space Science FourCastNet : A Data-driven Model for High-resolution Weather Forecasts using Adaptive Fourier Neural Operators", "subpage_snippet": "", "source": "iclr.cc", "link": "https://iclr.cc/virtual/2022/7656", "content": "Poster in Workshop: AI for Earth and Space Science FourCastNet : A Data-driven Model for High-resolution Weather Forecasts using Adaptive Fourier Neural Operators"}
+{"idx": 4, "title": "FourCastNet: A Global Data-driven High-resolution Weather Model using ...", "date": "", "ddg_snippet": "How data-driven deep learning models such as FourCastNet are a valuable addition to the meteorology toolkit to aid and augment NWP models is discussed. FourCastNet , short for Fourier Forecasting Neural Network, is a global data-driven weather forecasting model that provides accurate short to medium-range global predictions at $0.25^{\\\\circ}$ resolution . FourCastNet accurately forecasts high ...", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/FourCastNet:-A-Global-Data-driven-High-resolution-Pathak-Subramanian/10194e9d1d6b8ca8870445c990d4933c1dac1125", "content": "How data-driven deep learning models such as FourCastNet are a valuable addition to the meteorology toolkit to aid and augment NWP models is discussed. FourCastNet , short for Fourier Forecasting Neural Network, is a global data-driven weather forecasting model that provides accurate short to medium-range global predictions at $0.25^{\\\\circ}$ resolution . FourCastNet accurately forecasts high ..."}
+{"idx": 5, "title": "FourCastNet: Accelerating Global High-Resolution Weather Forecasting ...", "date": "", "ddg_snippet": "Abstract: Extreme weather amplified by climate change is causing increasingly devastating impacts across the globe. The current use of physics-based numerical weather prediction (NWP) limits accuracy and resolution due to high computational cost and strict time-to-solution limits. We report that a data-driven deep learning Earth system emulator, FourCastNet , can predict global weather and ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=Hnd0NDzUWL", "content": "Abstract: Extreme weather amplified by climate change is causing increasingly devastating impacts across the globe. The current use of physics-based numerical weather prediction (NWP) limits accuracy and resolution due to high computational cost and strict time-to-solution limits. We report that a data-driven deep learning Earth system emulator, FourCastNet , can predict global weather and ..."}
+{"idx": 6, "title": "Skilful global seasonal predictions from a machine learning weather ...", "date": "", "ddg_snippet": "Kurth, T. et al. Fourcastnet : Accelerating global high-resolution weather forecasting using adaptive fourier neural operators . In Proceedings of the platform for advanced scientific computing ...", "subpage_snippet": "", "source": "www.nature.com", "link": "https://www.nature.com/articles/s41612-025-01198-3", "content": "Kurth, T. et al. Fourcastnet : Accelerating global high-resolution weather forecasting using adaptive fourier neural operators . In Proceedings of the platform for advanced scientific computing ..."}
+{"idx": 7, "title": "Innovative Short-Term Weather Forecasting System Combining Data-Driven ...", "date": "", "ddg_snippet": "Abstract Regional short-term high-resolution meteorological prediction systems are critical for applications requiring precise and frequent updates, such as renewable energy forecasting. However, existing forecasting methods are constrained by limitations such as coarse resolution , high computational demand, and a narrow range of predictive variables. This study introduces an innovative ...", "subpage_snippet": "", "source": "journals.ametsoc.org", "link": "https://journals.ametsoc.org/view/journals/aies/4/3/AIES-D-24-0125.1.xml", "content": "Abstract Regional short-term high-resolution meteorological prediction systems are critical for applications requiring precise and frequent updates, such as renewable energy forecasting. However, existing forecasting methods are constrained by limitations such as coarse resolution , high computational demand, and a narrow range of predictive variables. This study introduces an innovative ..."}
+{"idx": 8, "title": "[2208.05419] FourCastNet: Accelerating Global High-Resolution Weather ...", "date": "", "ddg_snippet": "Extreme weather amplified by climate change is causing increasingly devastating impacts across the globe. The current use of physics-based numerical weather prediction (NWP) limits accuracy due to high computational cost and strict time-to-solution limits. We report that a data-driven deep learning Earth system emulator, FourCastNet , can predict global weather and generate medium-range ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2208.05419", "content": "Extreme weather amplified by climate change is causing increasingly devastating impacts across the globe. The current use of physics-based numerical weather prediction (NWP) limits accuracy due to high computational cost and strict time-to-solution limits. We report that a data-driven deep learning Earth system emulator, FourCastNet , can predict global weather and generate medium-range ..."}
+{"idx": 9, "title": "FourCastNet: A Global Data-driven High-resolution Weather Model using ...", "date": "", "ddg_snippet": "FourCastNet , short for Fourier Forecasting Neural Network, is a global data-driven weather forecasting model that provides accurate short to medium-range global predictions at 0.25∘ resolution .", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/362153109_FourCastNet_A_Global_Data-driven_High-resolution_Weather_Model_using_Adaptive_Fourier_Neural_Operators", "content": "FourCastNet , short for Fourier Forecasting Neural Network, is a global data-driven weather forecasting model that provides accurate short to medium-range global predictions at 0.25∘ resolution ."}

data/sampled_jsons/FourCastNet_Pathak_2022_evaluation_metrics_negative_log-likelihood_year_2022.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "FourCastNet: A Global Data-driven High-resolution Weather Model using ...", "date": "", "ddg_snippet": "FourCastNet , short for Fourier Forecasting Neural Network, is a global data-driven weather forecasting model that provides accurate short to medium-range global predictions at $0.25^{\\\\circ}$ resolution. FourCastNet accurately forecasts high-resolution, fast-timescale variables such as the surface wind speed, precipitation, and atmospheric water vapor. It has important implications for ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2202.11214", "content": "FourCastNet , short for Fourier Forecasting Neural Network, is a global data-driven weather forecasting model that provides accurate short to medium-range global predictions at $0.25^{\\\\circ}$ resolution. FourCastNet accurately forecasts high-resolution, fast-timescale variables such as the surface wind speed, precipitation, and atmospheric water vapor. It has important implications for ..."}
+{"idx": 1, "title": "GitHub - NVlabs/FourCastNet: Initial public release of code, data, and ...", "date": "", "ddg_snippet": "FourCastNet , short for Fourier Forecasting Neural Network, is a global data-driven weather forecasting model that provides accurate short to medium-range global predictions at 0.25∘ resolution. FourCastNet accurately forecasts high-resolution, fast-timescale variables such as the surface wind speed, precipitation, and atmospheric water vapor.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/NVlabs/FourCastNet", "content": "FourCastNet , short for Fourier Forecasting Neural Network, is a global data-driven weather forecasting model that provides accurate short to medium-range global predictions at 0.25∘ resolution. FourCastNet accurately forecasts high-resolution, fast-timescale variables such as the surface wind speed, precipitation, and atmospheric water vapor."}
+{"idx": 2, "title": "FourCastNet: A Data-driven Model for High-resolution Weather ... - ICLR", "date": "", "ddg_snippet": "FourCastNet : A Data-driven Model for High-resolution Weather Forecasts using Adaptive Fourier Neural Operators Jaideep Pathak · Shashank Subramanian · Peter Harrington · Sanjeev Raja · Ashesh Chattopadhyay · Morteza Mardani · Thorsten Kurth · David M. Hall · Zongyi Li · Kamyar Azizzadenesheli · Pedram Hassanzadeh · Karthik Kashinath ...", "subpage_snippet": "", "source": "iclr.cc", "link": "https://iclr.cc/virtual/2022/7656", "content": "FourCastNet : A Data-driven Model for High-resolution Weather Forecasts using Adaptive Fourier Neural Operators Jaideep Pathak · Shashank Subramanian · Peter Harrington · Sanjeev Raja · Ashesh Chattopadhyay · Morteza Mardani · Thorsten Kurth · David M. Hall · Zongyi Li · Kamyar Azizzadenesheli · Pedram Hassanzadeh · Karthik Kashinath ..."}
+{"idx": 3, "title": "FourCastNet - Janelia CVML", "date": "", "ddg_snippet": "The FourCastNet paper [ Pathak , 2022 ] trains an Adaptive Fourier Neural Operator (AFNO) network [Guibas, 2022 ] to predict a collection of atmospheric variables at the next time step (6 hours into the future) given the current readout for those variables.", "subpage_snippet": "", "source": "janelia-cvml.github.io", "link": "https://janelia-cvml.github.io/blog/posts/FourCastNet/index.html", "content": "The FourCastNet paper [ Pathak , 2022 ] trains an Adaptive Fourier Neural Operator (AFNO) network [Guibas, 2022 ] to predict a collection of atmospheric variables at the next time step (6 hours into the future) given the current readout for those variables."}
+{"idx": 4, "title": "FourCastNet: A practical introduction to a state-of-the-art deep ...", "date": "", "ddg_snippet": "However, recent advances in deep learning, specifically the FourCastNet model, have shown that data-driven approaches can forecast important atmospheric variables with excellent skill and comparable accuracy to standard numerical methods, but at orders-of-magnitude lower computational and energy cost during inference, enabling larger ensembles ...", "subpage_snippet": "", "source": "www.climatechange.ai", "link": "https://www.climatechange.ai/papers/neurips2022/115", "content": "However, recent advances in deep learning, specifically the FourCastNet model, have shown that data-driven approaches can forecast important atmospheric variables with excellent skill and comparable accuracy to standard numerical methods, but at orders-of-magnitude lower computational and energy cost during inference, enabling larger ensembles ..."}
+{"idx": 5, "title": "[2507.12144] FourCastNet 3: A geometric approach to probabilistic ...", "date": "", "ddg_snippet": "FourCastNet 3 advances global weather modeling by implementing a scalable, geometric machine learning (ML) approach to probabilistic ensemble forecasting. The approach is designed to respect spherical geometry and to accurately model the spatially correlated probabilistic nature of the problem, resulting in stable spectra and realistic dynamics across multiple scales. FourCastNet 3 delivers ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2507.12144", "content": "FourCastNet 3 advances global weather modeling by implementing a scalable, geometric machine learning (ML) approach to probabilistic ensemble forecasting. The approach is designed to respect spherical geometry and to accurately model the spatially correlated probabilistic nature of the problem, resulting in stable spectra and realistic dynamics across multiple scales. FourCastNet 3 delivers ..."}
+{"idx": 6, "title": "FourCastNet: Accelerating Global High-Resolution Weather Forecasting ...", "date": "", "ddg_snippet": "We report that a data-driven deep learning Earth system emulator, FourCastNet , can predict global weather and generate medium-range forecasts five orders-of-magnitude faster than NWP while approaching state-of-the-art accuracy.", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/abs/10.1145/3592979.3593412", "content": "We report that a data-driven deep learning Earth system emulator, FourCastNet , can predict global weather and generate medium-range forecasts five orders-of-magnitude faster than NWP while approaching state-of-the-art accuracy."}
+{"idx": 7, "title": "FourCastNet: A Global Data-driven High-resolution Weather Model using ...", "date": "", "ddg_snippet": "How data-driven deep learning models such as FourCastNet are a valuable addition to the meteorology toolkit to aid and augment NWP models is discussed. FourCastNet , short for Fourier Forecasting Neural Network, is a global data-driven weather forecasting model that provides accurate short to medium-range global predictions at $0.25^{\\\\circ}$ resolution. FourCastNet accurately forecasts high ...", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/FourCastNet:-A-Global-Data-driven-High-resolution-Pathak-Subramanian/10194e9d1d6b8ca8870445c990d4933c1dac1125", "content": "How data-driven deep learning models such as FourCastNet are a valuable addition to the meteorology toolkit to aid and augment NWP models is discussed. FourCastNet , short for Fourier Forecasting Neural Network, is a global data-driven weather forecasting model that provides accurate short to medium-range global predictions at $0.25^{\\\\circ}$ resolution. FourCastNet accurately forecasts high ..."}
+{"idx": 8, "title": "FourCastNet 3: A geometric approach to probabilistic ...", "date": "", "ddg_snippet": "16 Jul 2025 — Appendix D Evaluation metrics . Report issue for preceding element. We define evaluation metrics to measure the performance of trained models.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2507.12144v1", "content": "16 Jul 2025 — Appendix D Evaluation metrics . Report issue for preceding element. We define evaluation metrics to measure the performance of trained models."}
+{"idx": 9, "title": "the logarithm trick: achieve better long term - forecast via ...", "date": "", "ddg_snippet": "by T Zhang — In this paper, we present a simpler solution: by merely integrating an element-wise logarithmic operation after the standard Mean Square Error(MSE) loss - a ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=Y29rdPpPu4", "content": "by T Zhang — In this paper, we present a simpler solution: by merely integrating an element-wise logarithmic operation after the standard Mean Square Error(MSE) loss - a ..."}

data/sampled_jsons/GTA_Greedy_Task_Assignment_distributed_machine_learning_performance_worker_time_inefficiency.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "ATA: Adaptive Task Allocation for Efficient Resource ...", "date": "", "ddg_snippet": "In this paper, we propose ATA (Adaptive Task Allocation), a method that adapts to heterogeneous and random distributions of worker computation times .", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/46650", "content": "In this paper, we propose ATA (Adaptive Task Allocation), a method that adapts to heterogeneous and random distributions of worker computation times ."}
+{"idx": 1, "title": "ATA: Adaptive Task Allocation for Efficient Resource ...", "date": "", "ddg_snippet": "18 Jun 2025 — In distributed machine learning , traditional greedy methods waste resources by assigning tasks to every worker , even when only a few results are ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=1BaC3AdG1i&noteId=hkH8Wi9zZm", "content": "18 Jun 2025 — In distributed machine learning , traditional greedy methods waste resources by assigning tasks to every worker , even when only a few results are ..."}
+{"idx": 2, "title": "ATA: Adaptive Task Allocation for Efficient Resource ...", "date": "", "ddg_snippet": "2 Feb 2025 — However, their greedy approach can lead to inefficiencies using more computation than required, especially when computation times vary across ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2502.00775v1", "content": "2 Feb 2025 — However, their greedy approach can lead to inefficiencies using more computation than required, especially when computation times vary across ..."}
+{"idx": 3, "title": "ATA: Adaptive Task Allocation for Efficient Resource ...", "date": "", "ddg_snippet": "Current distributed machine learning systems typically employ Greedy Task Allocation ( GTA ) strategies, where all available workers are assigned tasks to ...", "subpage_snippet": "", "source": "www.alphaxiv.org", "link": "https://www.alphaxiv.org/overview/2502.00775v2", "content": "Current distributed machine learning systems typically employ Greedy Task Allocation ( GTA ) strategies, where all available workers are assigned tasks to ..."}
+{"idx": 4, "title": "Task allocation for maximum cooperation in complex ...", "date": "", "ddg_snippet": "by J Wang · 2024 · Cited by 1 — Based on RULE 1 and RULE 2, we design a Greedy Task Allocation ( GTA ) algorithm as shown in Algorithm 1. At first, we obtain critical actors ...", "subpage_snippet": "", "source": "www.sciencedirect.com", "link": "https://www.sciencedirect.com/science/article/pii/S0950705124006233", "content": "by J Wang · 2024 · Cited by 1 — Based on RULE 1 and RULE 2, we design a Greedy Task Allocation ( GTA ) algorithm as shown in Algorithm 1. At first, we obtain critical actors ..."}
+{"idx": 5, "title": "Consensus-Based Group Task Assignment with Social ...", "date": "", "ddg_snippet": "by X Li · 2020 · Cited by 45 — In this paper, we propose a novel framework for group task assignment based on worker groups' preferences, which includes two components: social impact-based ...", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/article/10.1007/s41019-020-00142-0", "content": "by X Li · 2020 · Cited by 45 — In this paper, we propose a novel framework for group task assignment based on worker groups' preferences, which includes two components: social impact-based ..."}
+{"idx": 6, "title": "Multiattribute E-CARGO Task Assignment Model Based on ...", "date": "", "ddg_snippet": "by Z Liu · Cited by 8 — The CTO requires A to organize different groups to complete these tasks and achieve the most effective performance in the shortest time . Obviously, GTA is used.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=dhQ3OKfzRu", "content": "by Z Liu · Cited by 8 — The CTO requires A to organize different groups to complete these tasks and achieve the most effective performance in the shortest time . Obviously, GTA is used."}
+{"idx": 7, "title": "Coalition-based task assignment with priority-aware ...", "date": "", "ddg_snippet": "by Y Zhao · 2024 · Cited by 23 — The greedy approach forms a set of worker coalitions greedily for performing tasks and uses an acceptance probability to identify high-value ...", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/article/10.1007/s00778-023-00802-3", "content": "by Y Zhao · 2024 · Cited by 23 — The greedy approach forms a set of worker coalitions greedily for performing tasks and uses an acceptance probability to identify high-value ..."}
+{"idx": 8, "title": "Profit Optimization in Spatial Crowdsourcing - Kai Zheng", "date": "", "ddg_snippet": "To achieve computational efficiency, we propose a Greedy Task Assignment (GTA) algorithm that gives priority to tasks with the higher reward per unit of ... 16 pages", "subpage_snippet": "", "source": "zheng-kai.com", "link": "https://zheng-kai.com/paper/tkde_2022_zhao.pdf", "content": "To achieve computational efficiency, we propose a Greedy Task Assignment (GTA) algorithm that gives priority to tasks with the higher reward per unit of ... 16 pages"}
+{"idx": 9, "title": "Generating Adversarial Examples for Discrete Data", "date": "", "ddg_snippet": "by P Yang · 2020 · Cited by 138 — Greedy Attack achieves higher success rate , while Gumbel Attack requires fewer model evaluations, leading to better efficiency in real-time or large-scale ... 36 pages", "subpage_snippet": "", "source": "jmlr.org", "link": "https://jmlr.org/papers/volume21/19-569/19-569.pdf", "content": "by P Yang · 2020 · Cited by 138 — Greedy Attack achieves higher success rate , while Gumbel Attack requires fewer model evaluations, leading to better efficiency in real-time or large-scale ... 36 pages"}

data/sampled_jsons/GUI_automation_action_planning_execution_LLM_agent_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "You Only Look at Screens: Multimodal Chain-of-Action Agents", "date": "", "ddg_snippet": "Building intelligent autonomous agents that are capable of task planning , decision making, and action execution in a particular environment is a long ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2309.11436v4", "content": "Building intelligent autonomous agents that are capable of task planning , decision making, and action execution in a particular environment is a long ..."}
+{"idx": 1, "title": "Large Language Model-Brained GUI Agents: A Survey", "date": "", "ddg_snippet": "... LLM -brained” GUI agents capable of interpreting complex GUI elements and autonomously executing actions based on natural language instructions.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2411.18279v12", "content": "... LLM -brained” GUI agents capable of interpreting complex GUI elements and autonomously executing actions based on natural language instructions."}
+{"idx": 2, "title": "Mobile-Agent-v3: Foundamental Agents for GUI Automation", "date": "", "ddg_snippet": "... post-trained on large-scale, diverse GUI interaction data, GUI -Owl unifies perception, grounding, reasoning, planning , and action execution within a ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2508.15144v1", "content": "... post-trained on large-scale, diverse GUI interaction data, GUI -Owl unifies perception, grounding, reasoning, planning , and action execution within a ..."}
+{"idx": 3, "title": "Echoes of Understanding: Enhancing LLM-based Agents with", "date": "", "ddg_snippet": "In these roles, LLM -based agents [ 4 ; 5 ] harness the reasoning and planning capabilities of LLMs to automate complex tasks across diverse domains ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2503.16024v1", "content": "In these roles, LLM -based agents [ 4 ; 5 ] harness the reasoning and planning capabilities of LLMs to automate complex tasks across diverse domains ..."}
+{"idx": 4, "title": "Evaluation and Benchmarking of LLM Agents: A Survey", "date": "", "ddg_snippet": "This taxonomy serves both as a conceptual framework and a practical guide, enabling systematic comparison and analysis of LLM agents across a wide ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2507.21504v1", "content": "This taxonomy serves both as a conceptual framework and a practical guide, enabling systematic comparison and analysis of LLM agents across a wide ..."}
+{"idx": 5, "title": "Bridging Reasoning and Action: The Synergy of Large Concept", "date": "", "ddg_snippet": "Agentic graph systems require sophisticated reasoning, planning , and action - execution capabilities to function effectively.", "subpage_snippet": "", "source": "techaireports.com", "link": "https://techaireports.com/bridging-reasoning-and-action-the-synergy-of-large-concept-models-lcms-and-large-action-models-lams-in-agentic-systems/", "content": "Agentic graph systems require sophisticated reasoning, planning , and action - execution capabilities to function effectively."}
+{"idx": 6, "title": "Xinbei Ma - ACL Anthology", "date": "", "ddg_snippet": "Existing LLM agents mainly generate natural language plans to guide reasoning, which is verbose and inefficient. ... Planning of Thoughts (D-PoT) for ...", "subpage_snippet": "", "source": "aclanthology.org", "link": "https://aclanthology.org/people/x/xinbei-ma/", "content": "Existing LLM agents mainly generate natural language plans to guide reasoning, which is verbose and inefficient. ... Planning of Thoughts (D-PoT) for ..."}
+{"idx": 7, "title": "o1 · GitHub Topics · GitHub", "date": "", "ddg_snippet": "LLM Agent Framework in ComfyUI includes MCP ... Official implementation of GUI -R1 : A Generalist R1-Style Vision-Language Action Model For GUI Agents", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/topics/o1", "content": "LLM Agent Framework in ComfyUI includes MCP ... Official implementation of GUI -R1 : A Generalist R1-Style Vision-Language Action Model For GUI Agents"}
+{"idx": 8, "title": "Yian Wang", "date": "", "ddg_snippet": "To facilitate future research in this area, we developed OS-Atlas - a foundational GUI action model that excels at GUI grounding and OOD agentic ...", "subpage_snippet": "", "source": "www.catalyzex.com", "link": "https://www.catalyzex.com/author/Yian+Wang", "content": "To facilitate future research in this area, we developed OS-Atlas - a foundational GUI action model that excels at GUI grounding and OOD agentic ..."}
+{"idx": 9, "title": "browser-use vs comic-mono-font - compare differences and", "date": "", "ddg_snippet": "... I'm excited to share talk2browser, which leverages LangGraph's agent orchestration capabilities to create a self-improving browser automation system ...", "subpage_snippet": "", "source": "www.libhunt.com", "link": "https://www.libhunt.com/compare-browser-use-vs-comic-mono-font", "content": "... I'm excited to share talk2browser, which leverages LangGraph's agent orchestration capabilities to create a self-improving browser automation system ..."}

data/sampled_jsons/Herman_Chau_algebraic_combinatorics_dataset.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "[2503.06366] Machine Learning meets Algebraic Combinatorics: A", "date": "", "ddg_snippet": "... Machine Learning meets Algebraic Combinatorics : A Suite of Datasets Capturing Research-level Conjecturing Ability in Pure Mathematics, by Herman Chau ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2503.06366", "content": "... Machine Learning meets Algebraic Combinatorics : A Suite of Datasets Capturing Research-level Conjecturing Ability in Pure Mathematics, by Herman Chau ..."}
+{"idx": 1, "title": "AlCoVE: an Algebraic Combinatorics Virtual Expedition", "date": "", "ddg_snippet": "AlCoVE brings together researchers interested in algebraic combinatorics from around the world. ... algebra, prove its eigenvalues are polynomials in ...", "subpage_snippet": "", "source": "www.math.uwaterloo.ca", "link": "https://www.math.uwaterloo.ca/~opecheni/alcove2024.htm", "content": "AlCoVE brings together researchers interested in algebraic combinatorics from around the world. ... algebra, prove its eigenvalues are polynomials in ..."}
+{"idx": 2, "title": "Read Herman by Jim Unger - GoComics", "date": "", "ddg_snippet": "3 days ago · Discover Herman by Jim Unger, the outrageous single-panel comic known for its distinctive humor and quirky characters. Classic strips and new adventures continue this beloved cartoon's legacy.", "subpage_snippet": "", "source": "www.gocomics.com", "link": "https://www.gocomics.com/herman", "content": "3 days ago · Discover Herman by Jim Unger, the outrageous single-panel comic known for its distinctive humor and quirky characters. Classic strips and new adventures continue this beloved cartoon's legacy."}
+{"idx": 3, "title": "Herman by Jim Unger for August 23, 2025 | GoComics", "date": "", "ddg_snippet": "Aug 23, 2025 · Read Herman —a comic strip by creator Jim Unger—for today, August 23, 2025, and check out other great comics, too!", "subpage_snippet": "", "source": "www.gocomics.com", "link": "https://www.gocomics.com/herman/2025/08/23", "content": "Aug 23, 2025 · Read Herman —a comic strip by creator Jim Unger—for today, August 23, 2025, and check out other great comics, too!"}
+{"idx": 4, "title": "Read about Herman and Jim Unger | GoComics", "date": "", "ddg_snippet": "Learn more about the Herman comic strip, its cast of characters, and creator Jim Unger.", "subpage_snippet": "", "source": "www.gocomics.com", "link": "https://www.gocomics.com/herman/about", "content": "Learn more about the Herman comic strip, its cast of characters, and creator Jim Unger."}
+{"idx": 5, "title": "Herman by Jim Unger for December 21, 2024 | GoComics", "date": "", "ddg_snippet": "Dec 21, 2024 · Read Herman —a comic strip by creator Jim Unger—for today, December 21, 2024, and check out other great comics, too!", "subpage_snippet": "", "source": "www.gocomics.com", "link": "https://www.gocomics.com/herman/2024/12/21", "content": "Dec 21, 2024 · Read Herman —a comic strip by creator Jim Unger—for today, December 21, 2024, and check out other great comics, too!"}
+{"idx": 6, "title": "Herman by Jim Unger for June 12, 2022 - GoComics", "date": "", "ddg_snippet": "Jun 12, 2022 · Read Herman —a comic strip by creator Jim Unger—for today, June 12, 2022, and check out other great comics, too!", "subpage_snippet": "", "source": "www.gocomics.com", "link": "https://www.gocomics.com/herman/2022/06/12", "content": "Jun 12, 2022 · Read Herman —a comic strip by creator Jim Unger—for today, June 12, 2022, and check out other great comics, too!"}
+{"idx": 7, "title": "synthical.com/search/by_author/Davis%20Brown", "date": "", "ddg_snippet": "Machine Learning meets Algebraic Combinatorics : A Suite of Datasets Capturing Research-level Conjecturing Ability in Pure Mathematics", "subpage_snippet": "", "source": "synthical.com", "link": "https://synthical.com/search/by_author/Davis+Brown", "content": "Machine Learning meets Algebraic Combinatorics : A Suite of Datasets Capturing Research-level Conjecturing Ability in Pure Mathematics"}
+{"idx": 8, "title": "Davis Brown", "date": "", "ddg_snippet": "We build datasets and tasks desgined to evaluate a model's ability to generate new research-level algebraic combinatorics conjectures.", "subpage_snippet": "", "source": "davisrbrown.com", "link": "https://davisrbrown.com/", "content": "We build datasets and tasks desgined to evaluate a model's ability to generate new research-level algebraic combinatorics conjectures."}
+{"idx": 9, "title": "MATH-AI: The 4th Workshop on Mathematical Reasoning and AI", "date": "", "ddg_snippet": "Proving Olympiad Algebraic Inequalities without ... HARDMATH: A Benchmark Dataset for Challenging Problems in Applied Mathematics ( Poster ) > link", "subpage_snippet": "", "source": "neurips.cc", "link": "https://neurips.cc/virtual/2024/workshop/84719", "content": "Proving Olympiad Algebraic Inequalities without ... HARDMATH: A Benchmark Dataset for Challenging Problems in Applied Mathematics ( Poster ) > link"}

data/sampled_jsons/HtmlRAG_Section_3.2.1_exact_text.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "plageon/ HtmlRAG : HtmlRAG : HTML is Better Than Plain Text for...", "date": "", "ddg_snippet": "We propose HtmlRAG , which uses HTML instead of plain text as the format of external knowledge in RAG systems. To tackle the long context brought by HTML , we propose Lossless HTML Cleaning and Two-Step Block-Tree-Based HTML Pruning.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/plageon/HtmlRAG", "content": "We propose HtmlRAG , which uses HTML instead of plain text as the format of external knowledge in RAG systems. To tackle the long context brought by HTML , we propose Lossless HTML Cleaning and Two-Step Block-Tree-Based HTML Pruning."}
+{"idx": 1, "title": "Implementing HtmlRAG : Enhancing Retrieval-Augmented... | Dev Genius", "date": "", "ddg_snippet": "HtmlRAG is a novel approach that proposes using HTML as the format of retrieved knowledge in RAG systems instead of plain text . By retaining the HTML structure, LLMs can access richer semantic and structural information, leading to improved understanding and generation capabilities.", "subpage_snippet": "", "source": "blog.devgenius.io", "link": "https://blog.devgenius.io/implementing-htmlrag-enhancing-retrieval-augmented-generation-with-html-knowledge-91cdd6278e23", "content": "HtmlRAG is a novel approach that proposes using HTML as the format of retrieved knowledge in RAG systems instead of plain text . By retaining the HTML structure, LLMs can access richer semantic and structural information, leading to improved understanding and generation capabilities."}
+{"idx": 2, "title": "HtmlRAG : HTML is Better Than Plain Text for Modeling Retrieved...", "date": "", "ddg_snippet": "In this paper, we propose HtmlRAG , which uses HTML instead of plain text as the format of retrieved knowledge in RAG systems, aiming to keep richer semantic and structured information that is missing in plain text .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2411.02959v1", "content": "In this paper, we propose HtmlRAG , which uses HTML instead of plain text as the format of retrieved knowledge in RAG systems, aiming to keep richer semantic and structured information that is missing in plain text ."}
+{"idx": 3, "title": "AI Innovations and Insights 20: HtmlRAG , AFLOW, ChunkRAG, and...", "date": "", "ddg_snippet": "HtmlRAG leverages HTML format instead of plain text in RAG systems to preserve semantic and structural information.", "subpage_snippet": "", "source": "readmedium.com", "link": "https://readmedium.com/ai-innovations-and-insights-20-htmlrag-aflow-chunkrag-and-markitdown-fe102693315e", "content": "HtmlRAG leverages HTML format instead of plain text in RAG systems to preserve semantic and structural information."}
+{"idx": 4, "title": "HtmlRAG : Building an Efficient HTML Retrieval Enhanced Generation...", "date": "", "ddg_snippet": "HtmlRAG is an innovative open source project focused on improving retrieval enhancement generation ( RAG ) approach to HTML document processing in the system. The project presents a novel approach that argues that using HTML formatting in RAG systems is more efficient than plain text .", "subpage_snippet": "", "source": "www.kdjingpai.com", "link": "https://www.kdjingpai.com/en/htmlrag/", "content": "HtmlRAG is an innovative open source project focused on improving retrieval enhancement generation ( RAG ) approach to HTML document processing in the system. The project presents a novel approach that argues that using HTML formatting in RAG systems is more efficient than plain text ."}
+{"idx": 5, "title": "Paper page - HtmlRAG : HTML is Better Than Plain Text for Modeling...", "date": "", "ddg_snippet": "Abstract. HtmlRAG enhances Retrieval-Augmented Generation ( RAG ) systems by using HTML instead of plain text , improving knowledge modeling and reducing information loss through HTML cleaning, compression, and pruning. AI-generated summary.", "subpage_snippet": "", "source": "www.aifasthub.com", "link": "https://www.aifasthub.com/papers/2411.02959", "content": "Abstract. HtmlRAG enhances Retrieval-Augmented Generation ( RAG ) systems by using HTML instead of plain text , improving knowledge modeling and reducing information loss through HTML cleaning, compression, and pruning. AI-generated summary."}
+{"idx": 6, "title": "HtmlRAG : Enhancing RAG Systems with Richer... - MarkTechPost", "date": "", "ddg_snippet": "HtmlRAG ’s superior performance compared to traditional plain- text -based post-retrieval processes validates the effectiveness of utilizing HTML format for knowledge retrieval.", "subpage_snippet": "", "source": "www.marktechpost.com", "link": "https://www.marktechpost.com/2024/11/10/htmlrag-enhancing-rag-systems-with-richer-semantic-and-structural-information-through-html/", "content": "HtmlRAG ’s superior performance compared to traditional plain- text -based post-retrieval processes validates the effectiveness of utilizing HTML format for knowledge retrieval."}
+{"idx": 7, "title": "HtmlRAG : Enhancing RAG Systems with Richer Semantic and...", "date": "", "ddg_snippet": "HtmlRAG is a new method that improves Retrieval-Augmented Generation ( RAG ) systems by using HTML instead of plain text . This approach helps maintain important structural and semantic information that is often lost during conversion to plain text .", "subpage_snippet": "", "source": "itinai.com", "link": "https://itinai.com/htmlrag-enhancing-rag-systems-with-richer-semantic-and-structural-information-through-html/", "content": "HtmlRAG is a new method that improves Retrieval-Augmented Generation ( RAG ) systems by using HTML instead of plain text . This approach helps maintain important structural and semantic information that is often lost during conversion to plain text ."}
+{"idx": 8, "title": "Unleashing the Power of HtmlRAG : Transforming RAG with HTML ...", "date": "", "ddg_snippet": "Discover how HtmlRAG , combined with UnDatas.io's HTML - based table data extraction, revolutionizes RAG systems. Learn how it preserves data structure, alleviates LLMs' hallucination problem, and outperforms traditional plain - text - based RAG through its unique workflow.", "subpage_snippet": "", "source": "undatas.io", "link": "https://undatas.io/blog/posts/unleashing-the-power-of-htmlrag-transforming-rag-with-html-enhanced-table-data-from-undatas-io/", "content": "Discover how HtmlRAG , combined with UnDatas.io's HTML - based table data extraction, revolutionizes RAG systems. Learn how it preserves data structure, alleviates LLMs' hallucination problem, and outperforms traditional plain - text - based RAG through its unique workflow."}
+{"idx": 9, "title": "htmlrag · PyPI", "date": "", "ddg_snippet": "A smart toolkit for HTML cleaning and pruning for RAG systems.If you switch from htmlrag v0.0.4 to v0.0.5, please download the latest version of modeling files for Gerative HTML Pruners, which are available at modeling_llama.py, and modeling_phi3.py.", "subpage_snippet": "", "source": "pypi.org", "link": "https://pypi.org/project/htmlrag/", "content": "A smart toolkit for HTML cleaning and pruning for RAG systems.If you switch from htmlrag v0.0.4 to v0.0.5, please download the latest version of modeling files for Gerative HTML Pruners, which are available at modeling_llama.py, and modeling_phi3.py."}

data/sampled_jsons/ICML_2025_checks_and_balances_ethical_AI_limitations.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "A Checks-and-Balances Framework for Context-Aware ...", "date": "", "ddg_snippet": "A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment. 2 months ago. ·. ICML. Paper · ICML 2025 ... limitations : (1) the challenge of decomposing ...", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/46461", "content": "A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment. 2 months ago. ·. ICML. Paper · ICML 2025 ... limitations : (1) the challenge of decomposing ..."}
+{"idx": 1, "title": "A Checks-and-Balances Framework for Context-Aware ...", "date": "", "ddg_snippet": "by EY Chang · Cited by 1 — A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment ... RLHF Limitations : ▷ Susceptible to social biases. ▷ Vulnerable to reward ...", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/media/icml-2025/Slides/46461_OMgXx2a.pdf", "content": "by EY Chang · Cited by 1 — A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment ... RLHF Limitations : ▷ Susceptible to social biases. ▷ Vulnerable to reward ..."}
+{"idx": 2, "title": "A Checks-and-Balances Framework for Context-Aware ...", "date": "", "ddg_snippet": "1 May 2025 — back arrow Go to ICML 2025 Conference homepage. A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment ... limitations and ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=4uOEiitySn&noteId=cYh3zaQycT", "content": "1 May 2025 — back arrow Go to ICML 2025 Conference homepage. A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment ... limitations and ..."}
+{"idx": 3, "title": "ICML 2025 Papers", "date": "", "ddg_snippet": "A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment · Premise-Augmented Reasoning Chains Improve Error Identification in Math reasoning ...", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/papers.html", "content": "A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment · Premise-Augmented Reasoning Chains Improve Error Identification in Math reasoning ..."}
+{"idx": 4, "title": "ICML 2025 Schedule", "date": "", "ddg_snippet": "Reasoning Limitations of Multimodal Large Language Models. A case study of Bongard Problems ... A Checks-and-Balances Framework for Context-Aware Ethical AI ...", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/calendar", "content": "Reasoning Limitations of Multimodal Large Language Models. A case study of Bongard Problems ... A Checks-and-Balances Framework for Context-Aware Ethical AI ..."}
+{"idx": 5, "title": "ICML 2025 Tuesday 07/15", "date": "", "ddg_snippet": "... limitations . We also show that WRO underperforms in practice due optimization ... A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment.", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/day/7/15", "content": "... limitations . We also show that WRO underperforms in practice due optimization ... A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment."}
+{"idx": 6, "title": "Digital SuperIntelligence", "date": "", "ddg_snippet": "In one paper (accepted to ICML 2025 ), researchers showed over a 20% performance gain by having the model minimize the “surprise” (perplexity) of ...", "subpage_snippet": "", "source": "www.linkedin.com", "link": "https://www.linkedin.com/pulse/digital-superintelligence-bassel-haidar-pxfje", "content": "In one paper (accepted to ICML 2025 ), researchers showed over a 20% performance gain by having the model minimize the “surprise” (perplexity) of ..."}
+{"idx": 7, "title": "Computer Science", "date": "", "ddg_snippet": "Title: A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment ... In this work, we analyze the strengths and limitations ... Comments: ICML 2025 ...", "subpage_snippet": "", "source": "www.arxiv.org", "link": "http://www.arxiv.org/list/cs/new?skip=1825&show=50", "content": "Title: A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment ... In this work, we analyze the strengths and limitations ... Comments: ICML 2025 ..."}
+{"idx": 8, "title": "Edward Chang", "date": "", "ddg_snippet": "A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment · Edward Y Chang. ICML 2025 poster; Readers: Everyone. Position: Limitations ... Submitted ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/profile?id=~Edward_Chang2", "content": "A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment · Edward Y Chang. ICML 2025 poster; Readers: Everyone. Position: Limitations ... Submitted ..."}
+{"idx": 9, "title": "Computer Science", "date": "", "ddg_snippet": "... limitations of LLM-based operators. ... Title: A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment ... Comments: Accepted at ICML 2025 . This ...", "subpage_snippet": "", "source": "www.arxiv.org", "link": "http://www.arxiv.org/list/cs/new?skip=875&show=500", "content": "... limitations of LLM-based operators. ... Title: A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment ... Comments: Accepted at ICML 2025 . This ..."}

data/sampled_jsons/IMhoJgWANP_Digital_Disparities-_A_Comparative_Web_Measurement_Study_Across_Economic_Boundaries_Figur.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Digital Disparities: A Comparative Web Measurement Study Across ...", "date": "", "ddg_snippet": "Concretely, we collect the largest dataset to date that compares web development practices across developed and developing regions -- 200,000 webpages across 20 countries -- which we aim to open source along with this publication.", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/10.1145/3696410.3714647", "content": "Concretely, we collect the largest dataset to date that compares web development practices across developed and developing regions -- 200,000 webpages across 20 countries -- which we aim to open source along with this publication."}
+{"idx": 1, "title": "PDF Digital Disparities: A Comparative Web Measurement Study Across ...", "date": "", "ddg_snippet": "Specifically, we select a sample of 10 developing and 10 developed countries for a comparative analysis of their web ecosys-tems. The selection process was guided by two primary criteria: population size and the availability of 10,000 websites per country that met our inclusion criteria (§3.2) within the CrUX database [14].", "subpage_snippet": "", "source": "www.staicu.org", "link": "https://www.staicu.org/publications/www2025.pdf", "content": "Specifically, we select a sample of 10 developing and 10 developed countries for a comparative analysis of their web ecosys-tems. The selection process was guided by two primary criteria: population size and the availability of 10,000 websites per country that met our inclusion criteria (§3.2) within the CrUX database [14]."}
+{"idx": 2, "title": "kal-purush/digital-disparities-www25 - GitHub", "date": "", "ddg_snippet": "Digital Disparities : A Comparative Web Measurement Study This repository contains the dataset, tools, and analysis for our research paper \"Digital Disparities : A Comparative Web Measurement Study Across Economic Boundaries \", presented at WWW'25. The study explores differences in web development practices across developed and developing countries , focusing on web size, complexity, security ...", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/kal-purush/digital-disparities-www25", "content": "Digital Disparities : A Comparative Web Measurement Study This repository contains the dataset, tools, and analysis for our research paper \"Digital Disparities : A Comparative Web Measurement Study Across Economic Boundaries \", presented at WWW'25. The study explores differences in web development practices across developed and developing countries , focusing on web size, complexity, security ..."}
+{"idx": 3, "title": "Unequal Internet: study highlights differences between websites from ...", "date": "", "ddg_snippet": "The Internet may be a global phenomenon, but its often-claimed global nature is tempered by the 'digital divide' - digital participation still heavily depends on economic conditions. CISPA researcher Masudul Bhuiyan from CISPA Faculty Dr. Cristian-Alexander Staicu's team explored whether security and data privacy differences can be found on websites as well. His study of 200,000 ...", "subpage_snippet": "", "source": "nachrichten.idw-online.de", "link": "https://nachrichten.idw-online.de/2025/04/29/unequal-internet-study-highlights-differences-between-websites-from-developing-and-developed-countries", "content": "The Internet may be a global phenomenon, but its often-claimed global nature is tempered by the 'digital divide' - digital participation still heavily depends on economic conditions. CISPA researcher Masudul Bhuiyan from CISPA Faculty Dr. Cristian-Alexander Staicu's team explored whether security and data privacy differences can be found on websites as well. His study of 200,000 ..."}
+{"idx": 4, "title": "Digital Disparities: A Comparative Web Measurement Study Across ...", "date": "", "ddg_snippet": "Figure 10 shows the adoption of HTTPS across both developed and developing nations. In developed countries , only 5% of websites still use unencrypted HTTP , a significant improvement from previously-reported mea-surements [35].", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=IMhoJgWANP", "content": "Figure 10 shows the adoption of HTTPS across both developed and developing nations. In developed countries , only 5% of websites still use unencrypted HTTP , a significant improvement from previously-reported mea-surements [35]."}
+{"idx": 5, "title": "\"Digital Disparities: A Comparative Web Measurement Study Across ... - dblp", "date": "", "ddg_snippet": "Bibliographic details on Digital Disparities : A Comparative Web Measurement Study Across Economic Boundaries .", "subpage_snippet": "", "source": "dblp.org", "link": "https://dblp.org/rec/conf/www/BhuiyanVSZ25", "content": "Bibliographic details on Digital Disparities : A Comparative Web Measurement Study Across Economic Boundaries ."}
+{"idx": 6, "title": "PDF Unequal internet: Study highlights differences between websites from ...", "date": "", "ddg_snippet": "Visualization to the paper \" A Comparative Web Measurement Study Across Economic Boundaries .\" Credit: CISPA Helmholtz Center for Information Security The Internet may be a global phenomenon, but its often-claimed global nature is tempered by the \"digital divide\"—digital participation still heavily depends on economic conditions.", "subpage_snippet": "", "source": "techxplore.com", "link": "https://techxplore.com/news/2025-04-unequal-internet-highlights-differences-websites.pdf", "content": "Visualization to the paper \" A Comparative Web Measurement Study Across Economic Boundaries .\" Credit: CISPA Helmholtz Center for Information Security The Internet may be a global phenomenon, but its often-claimed global nature is tempered by the \"digital divide\"—digital participation still heavily depends on economic conditions."}
+{"idx": 7, "title": "digital-disparities-www25/README.md at main - GitHub", "date": "", "ddg_snippet": "Digital Disparities : A Comparative Web Measurement Study This repository contains the dataset, tools, and analysis for our research paper \"Digital Disparities : A Comparative Web Measurement Study Across Economic Boundaries \", presented at WWW'25. The study explores differences in web development practices across developed and developing countries , focusing on web size, complexity, security ...", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/kal-purush/digital-disparities-www25/blob/main/README.md", "content": "Digital Disparities : A Comparative Web Measurement Study This repository contains the dataset, tools, and analysis for our research paper \"Digital Disparities : A Comparative Web Measurement Study Across Economic Boundaries \", presented at WWW'25. The study explores differences in web development practices across developed and developing countries , focusing on web size, complexity, security ..."}
+{"idx": 8, "title": "Digital Disparities: A Comparative Web Measurement Study Across ...", "date": "", "ddg_snippet": "Anecdotal evidence suggests that websites in developing and developed regions differ significantly. In this work, we test this hypothesis by measuring differences in web development practices across the two groups of countries , using multiple dimensions: websites' size, complexity, security, privacy, quality, technology adoption, and accessibility.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=IMhoJgWANP", "content": "Anecdotal evidence suggests that websites in developing and developed regions differ significantly. In this work, we test this hypothesis by measuring differences in web development practices across the two groups of countries , using multiple dimensions: websites' size, complexity, security, privacy, quality, technology adoption, and accessibility."}
+{"idx": 9, "title": "Cristian-Alexandru Staicu", "date": "", "ddg_snippet": "(paper) The Web Conference 2025 Digital Disparities : A Comparative Web Measurement Study Across Economic Boundaries Masudul Hasan Masud Bhuiyan, Matteo Varvello, Cristian-Alexandru Staicu, Yasir Zaki (paper) EuroS&P 2025 CHARON: Polyglot Code Analysis for Detecting Vulnerabilities in Scripting Languages Native Extensions", "subpage_snippet": "", "source": "www.staicu.org", "link": "https://www.staicu.org/publications.html", "content": "(paper) The Web Conference 2025 Digital Disparities : A Comparative Web Measurement Study Across Economic Boundaries Masudul Hasan Masud Bhuiyan, Matteo Varvello, Cristian-Alexandru Staicu, Yasir Zaki (paper) EuroS&P 2025 CHARON: Polyglot Code Analysis for Detecting Vulnerabilities in Scripting Languages Native Extensions"}

data/sampled_jsons/IP-Adapter_CLIP_encoding_VAE_latent_space_failure_origin_identification.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Exploring CLIP Latent Space | tuba", "date": "", "ddg_snippet": "Sep 9, 2024 · One interesting area of research today is the open problem of how to control image models better. For example, it is difficult to tweak an output of an image model through prompting – a small change in prompt usually ends up changing the entire image. New techniques such as ControlNet and IP-Adapter are ways that users can maintain the structure of an image while changing small aspects of it ...", "subpage_snippet": "", "source": "0xtuba.github.io", "link": "https://0xtuba.github.io/posts/clip-latent-space/", "content": "Sep 9, 2024 · One interesting area of research today is the open problem of how to control image models better. For example, it is difficult to tweak an output of an image model through prompting – a small change in prompt usually ends up changing the entire image. New techniques such as ControlNet and IP-Adapter are ways that users can maintain the structure of an image while changing small aspects of it ..."}
+{"idx": 1, "title": "[2503.08455] Controlling Latent Diffusion Using Latent CLIP", "date": "", "ddg_snippet": "Mar 11, 2025 · Instead of performing text-conditioned denoising in the image domain, latent diffusion models (LDMs) operate in latent space of a variational autoencoder ( VAE ), enabling more efficient processing at reduced computational costs. However, while the diffusion process has moved to the latent space , the contrastive language-image pre-training ( CLIP ) models, as used in many image processing tasks ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2503.08455", "content": "Mar 11, 2025 · Instead of performing text-conditioned denoising in the image domain, latent diffusion models (LDMs) operate in latent space of a variational autoencoder ( VAE ), enabling more efficient processing at reduced computational costs. However, while the diffusion process has moved to the latent space , the contrastive language-image pre-training ( CLIP ) models, as used in many image processing tasks ..."}
+{"idx": 2, "title": "Latent Space Representations in Variational Autoencoders ...", "date": "", "ddg_snippet": "Dec 9, 2024 · Extract Latent Vectors: After training the VAE , I extract the latent representations for the dataset. This gives me a clear view of how the encoder maps input data into the latent space .", "subpage_snippet": "", "source": "medium.com", "link": "https://medium.com/@whyamit101/latent-space-representations-in-variational-autoencoders-vaes-e74076eda77b", "content": "Dec 9, 2024 · Extract Latent Vectors: After training the VAE , I extract the latent representations for the dataset. This gives me a clear view of how the encoder maps input data into the latent space ."}
+{"idx": 3, "title": "278-stable-diffusion-ip-adapter.ipynb - Colab - Google Colab", "date": "", "ddg_snippet": "The stable diffusion model with ip-adapter takes a latent image representation, a text prompt is transformed to text embeddings via CLIP text encoder and ip-adapter image is transformed to image embeddings via CLIP Image Encoder.", "subpage_snippet": "", "source": "colab.research.google.com", "link": "https://colab.research.google.com/github/openvinotoolkit/openvino_notebooks/blob/main/notebooks/278-stable-diffusion-ip-adapter/278-stable-diffusion-ip-adapter.ipynb", "content": "The stable diffusion model with ip-adapter takes a latent image representation, a text prompt is transformed to text embeddings via CLIP text encoder and ip-adapter image is transformed to image embeddings via CLIP Image Encoder."}
+{"idx": 4, "title": "GitHub - wendlerc/latent_clip: CLIP trained in SDXL VAE's ...", "date": "", "ddg_snippet": "CLIP trained in SDXL VAE 's latent space . Contribute to wendlerc/ latent _ clip development by creating an account on GitHub .", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/wendlerc/latent_clip", "content": "CLIP trained in SDXL VAE 's latent space . Contribute to wendlerc/ latent _ clip development by creating an account on GitHub ."}
+{"idx": 5, "title": "Condition Monitoring Using a Latent Space of Variational ...", "date": "", "ddg_snippet": "Sep 22, 2024 · The VAE encoder maps input data to a continuous probabilistic latent subspace, and the VAE decoder generates output data by randomly sampling in the continuous latent subspace and decoding these samples. This paper introduces a unique approach to fault detection in rotating machines.", "subpage_snippet": "", "source": "www.mdpi.com", "link": "https://www.mdpi.com/1424-8220/24/21/6825", "content": "Sep 22, 2024 · The VAE encoder maps input data to a continuous probabilistic latent subspace, and the VAE decoder generates output data by randomly sampling in the continuous latent subspace and decoding these samples. This paper introduces a unique approach to fault detection in rotating machines."}
+{"idx": 6, "title": "Adaptive Compression of the Latent Space in Variational ...", "date": "", "ddg_snippet": "Sep 17, 2024 · In this paper, we propose ALD- VAE (Adaptive Latent Dimensionality VAE ) - a novel, automated heuristic for determining the optimal latent space size in VAEs. Our approach involves gradually decreasing the latent space size by removing neurons during the training process and observing the reconstruction loss, Fréchet Inception Distance (FID) and ...", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/chapter/10.1007/978-3-031-72332-2_7", "content": "Sep 17, 2024 · In this paper, we propose ALD- VAE (Adaptive Latent Dimensionality VAE ) - a novel, automated heuristic for determining the optimal latent space size in VAEs. Our approach involves gradually decreasing the latent space size by removing neurons during the training process and observing the reconstruction loss, Fréchet Inception Distance (FID) and ..."}
+{"idx": 7, "title": "VAE Decode (Tiled) - ComfyUI Community Manual", "date": "", "ddg_snippet": "VAE Encode (for Inpainting).The VAE Decode (Tiled) node can be used to decode latent space images back into pixel space images, using the provided VAE .", "subpage_snippet": "", "source": "blenderneko.github.io", "link": "https://blenderneko.github.io/ComfyUI-docs/Core+Nodes/Experimental/VAEDecodeTiled/", "content": "VAE Encode (for Inpainting).The VAE Decode (Tiled) node can be used to decode latent space images back into pixel space images, using the provided VAE ."}
+{"idx": 8, "title": "Variational Autoencoder − Dimension of the latent space", "date": "", "ddg_snippet": "After the training of a deep convolutional VAE with a large latent space (8x8x1024) on MNIST, the reconstruction works very well.", "subpage_snippet": "", "source": "stats.stackexchange.com", "link": "https://stats.stackexchange.com/questions/327966/variational-autoencoder-−-dimension-of-the-latent-space", "content": "After the training of a deep convolutional VAE with a large latent space (8x8x1024) on MNIST, the reconstruction works very well."}
+{"idx": 9, "title": "(PDF) Generalizable Origin Identification for Text-Guided...", "date": "", "ddg_snippet": "Generalizable Origin Identification for. Text-Guided Image-to-Image Diffusion Models.on IP - Adapter , which uses CLIP for encoding . We also try. the linear transformed CLIP embedding, but it still fails to. generalize (36.6% mAP and 27.8% Acc).", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/387767437_Generalizable_Origin_Identification_for_Text-Guided_Image-to-Image_Diffusion_Models", "content": "Generalizable Origin Identification for. Text-Guided Image-to-Image Diffusion Models.on IP - Adapter , which uses CLIP for encoding . We also try. the linear transformed CLIP embedding, but it still fails to. generalize (36.6% mAP and 27.8% Acc)."}

data/sampled_jsons/ITBench_Table_4_'Mean_Time_to_Diagnosis'_lowest_model_seconds_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "ITBench: Evaluating AI Agents across Diverse Real-World IT Automation Tasks", "date": "", "ddg_snippet": "3. ITBench ITBench is a systematic benchmarking framework and run- time environment designed to evaluate AI agents tasked with automating IT operations, incorporating a robust archi-tecture (see Figure 2) comprising the AI Agent, Scenario Specification and Environment, Evaluator, and Leaderboard to facilitate comprehensive performance assessment.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2502.05352", "content": "3. ITBench ITBench is a systematic benchmarking framework and run- time environment designed to evaluate AI agents tasked with automating IT operations, incorporating a robust archi-tecture (see Figure 2) comprising the AI Agent, Scenario Specification and Environment, Evaluator, and Leaderboard to facilitate comprehensive performance assessment."}
+{"idx": 1, "title": "GitHub - itbench-hub/ITBench: Code repository for ITBench", "date": "", "ddg_snippet": "Code repository for ITBench . Contribute to itbench -hub/ ITBench development by creating an account on GitHub.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/itbench-hub/ITBench", "content": "Code repository for ITBench . Contribute to itbench -hub/ ITBench development by creating an account on GitHub."}
+{"idx": 2, "title": "ITBench: Next-Gen Benchmarking for IT Automation Evaluation", "date": "", "ddg_snippet": "Learn more about ITBench , an open framework to benchmark AI agents for IT automation, focusing on reliability, efficiency, and real-world IT scenarios.", "subpage_snippet": "", "source": "dzone.com", "link": "https://dzone.com/articles/itbench-next-gen-benchmarking-it-automation", "content": "Learn more about ITBench , an open framework to benchmark AI agents for IT automation, focusing on reliability, efficiency, and real-world IT scenarios."}
+{"idx": 3, "title": "(PDF) ITBench: Evaluating AI Agents across Diverse Real-World IT ...", "date": "", "ddg_snippet": "We introduce ITBench , a framework that offers a systematic methodology for benchmarking AI agents to address real-world IT automation tasks.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/388882803_ITBench_Evaluating_AI_Agents_across_Diverse_Real-World_IT_Automation_Tasks", "content": "We introduce ITBench , a framework that offers a systematic methodology for benchmarking AI agents to address real-world IT automation tasks."}
+{"idx": 4, "title": "GitHub - IBM/ITBench-Utilities: Code repository for tools as part of ...", "date": "", "ddg_snippet": "Code repository for tools as part of ITBench . Contribute to IBM/ ITBench -Utilities development by creating an account on GitHub.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/IBM/ITBench-Utilities/", "content": "Code repository for tools as part of ITBench . Contribute to IBM/ ITBench -Utilities development by creating an account on GitHub."}
+{"idx": 5, "title": "ITBench User Experience: Democratizing AI Agent Evaluation", "date": "", "ddg_snippet": "Learn how ITBench enables realistic AI agent evaluation in IT with streamlined onboarding, automated benchmarks, and meaningful metrics for real-world impact.", "subpage_snippet": "", "source": "dzone.com", "link": "https://dzone.com/articles/itbench-part-2-ai-agent-evaluation-guide", "content": "Learn how ITBench enables realistic AI agent evaluation in IT with streamlined onboarding, automated benchmarks, and meaningful metrics for real-world impact."}
+{"idx": 6, "title": "ITBench: Evaluating AI Agents across Diverse Real-World IT Automation Tasks", "date": "", "ddg_snippet": "Realizing the vision of using AI agents to automate critical IT tasks depends on the ability to measure and understand effectiveness of proposed solutions. We introduce ITBench , a framework that offers a systematic methodology for benchmarking AI agents to address real-world IT automation tasks. Our initial release targets three key areas: Site Reliability Engineering (SRE), Compliance and ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2502.05352", "content": "Realizing the vision of using AI agents to automate critical IT tasks depends on the ability to measure and understand effectiveness of proposed solutions. We introduce ITBench , a framework that offers a systematic methodology for benchmarking AI agents to address real-world IT automation tasks. Our initial release targets three key areas: Site Reliability Engineering (SRE), Compliance and ..."}
+{"idx": 7, "title": "GitHub - itbench-hub/ITBench-Scenarios: Code repository for scenarios ...", "date": "", "ddg_snippet": "ITBench : Central repository providing an overview of the ITBench ecosystem, the ITBench Leaderboard, related announcements, and publications. CISO-CAA Agent: CISO (Chief Information Security Officer) agents that automate compliance assessments by generating policies from natural language, collecting evidence, integrating with GitOps workflows ...", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/itbench-hub/ITBench-Scenarios", "content": "ITBench : Central repository providing an overview of the ITBench ecosystem, the ITBench Leaderboard, related announcements, and publications. CISO-CAA Agent: CISO (Chief Information Security Officer) agents that automate compliance assessments by generating policies from natural language, collecting evidence, integrating with GitOps workflows ..."}
+{"idx": 8, "title": "Now you can gauge if AI agents are actually useful for work", "date": "", "ddg_snippet": "IBM Research's new ITBench benchmarks aim to bring an objective approach to seeing whether IT agents are actually making work easier for enterprises.", "subpage_snippet": "", "source": "research.ibm.com", "link": "https://research.ibm.com/blog/it-agent-benchmark", "content": "IBM Research's new ITBench benchmarks aim to bring an objective approach to seeing whether IT agents are actually making work easier for enterprises."}
+{"idx": 9, "title": "Publications | Yinfang CHEN", "date": "", "ddg_snippet": "We introduce ITBench , a framework that offers a systematic methodology for benchmarking AI agents to address real-world IT automation tasks. Our initial release targets three key areas: Site Reliability Engineering (SRE), Compliance and Security Operations (CISO), and Financial Operations (FinOps).", "subpage_snippet": "", "source": "yinfangchen.github.io", "link": "https://yinfangchen.github.io/publications/", "content": "We introduce ITBench , a framework that offers a systematic methodology for benchmarking AI agents to address real-world IT automation tasks. Our initial release targets three key areas: Site Reliability Engineering (SRE), Compliance and Security Operations (CISO), and Financial Operations (FinOps)."}

data/sampled_jsons/ImageNet-1k_Syn._DP_(ours)_6.5M_IN_real_Val..jsonl

@@ -0,0 +1,3 @@
+{"idx": 0, "title": "(PDF) Improving the Scaling Laws of Synthetic Data with Deliberate...", "date": "", "ddg_snippet": "Syn . DP ( ours ) IN-100 100k 1.9 M 74.3 75.0 66.3 52.0 76.6 25.9.On ImageNet -100, DP generated 4.6. million fewer samples and trained for only one-sixth of the iterations compared to previous works, yet achieved. superior performance on the real data.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/389274598_Improving_the_Scaling_Laws_of_Synthetic_Data_with_Deliberate_Practice", "content": "Syn . DP ( ours ) IN-100 100k 1.9 M 74.3 75.0 66.3 52.0 76.6 25.9.On ImageNet -100, DP generated 4.6. million fewer samples and trained for only one-sixth of the iterations compared to previous works, yet achieved. superior performance on the real data."}
+{"idx": 1, "title": "Deliberate Practice", "date": "", "ddg_snippet": "by R Askari-Hemmat · 2025 · Cited by 1 — (Right): Top-1 validation accuracy on ImageNet-1k with models trained solely on synthetic data. ... Syn. DP (ours ). IN-100. 100k. 1.9M. 74.3.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2502.15588", "content": "by R Askari-Hemmat · 2025 · Cited by 1 — (Right): Top-1 validation accuracy on ImageNet-1k with models trained solely on synthetic data. ... Syn. DP (ours ). IN-100. 100k. 1.9M. 74.3."}
+{"idx": 2, "title": "", "date": "", "ddg_snippet": "", "subpage_snippet": "", "source": "", "link": "", "content": ""}

data/sampled_jsons/ImagineFSL_DISEF_Flowers_Table_1_github.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Amazing Table of Flowers and Epoxy resin. - YouTube", "date": "", "ddg_snippet": "How to make an amazing and functional table of flowers , plywood and epoxy with your own hands. #positivecoupleyoutube #art #epoxyOur channel with music:Posit...", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=AsopsTPbnwM", "content": "How to make an amazing and functional table of flowers , plywood and epoxy with your own hands. #positivecoupleyoutube #art #epoxyOur channel with music:Posit..."}
+{"idx": 1, "title": "Markdown table: table - 1 · GitHub", "date": "", "ddg_snippet": "Markdown table: table - 1 . GitHub Gist: instantly share code, notes, and snippets.Save will-edward-moore/0d35453aa7 f 8c01c33b9 f 8d7429b8e3c to your computer and use it in GitHub Desktop. Download ZIP. Markdown table: table - 1 .", "subpage_snippet": "", "source": "gist.github.com", "link": "https://gist.github.com/will-edward-moore/0d35453aa7f8c01c33b9f8d7429b8e3c", "content": "Markdown table: table - 1 . GitHub Gist: instantly share code, notes, and snippets.Save will-edward-moore/0d35453aa7 f 8c01c33b9 f 8d7429b8e3c to your computer and use it in GitHub Desktop. Download ZIP. Markdown table: table - 1 ."}
+{"idx": 2, "title": "How to Create a Folder in Github Repos in 4 Simple Steps - αlphαrithms", "date": "", "ddg_snippet": "github create new folder illustration. Github is an incredible tool for storing, sharing, and learning code. Table of Contents show. 1 Overview. 2 Step 1 : Have a Repository. 3 Step 2: Click “creating a new file”. 4 Step 3: Use the Forward-Slash Character to Create a New Folder.", "subpage_snippet": "", "source": "www.alpharithms.com", "link": "https://www.alpharithms.com/how-to-create-a-folder-in-github-repos-463022/", "content": "github create new folder illustration. Github is an incredible tool for storing, sharing, and learning code. Table of Contents show. 1 Overview. 2 Step 1 : Have a Repository. 3 Step 2: Click “creating a new file”. 4 Step 3: Use the Forward-Slash Character to Create a New Folder."}
+{"idx": 3, "title": "Periodic Table - Ptable - Properties", "date": "", "ddg_snippet": "Interactive periodic table showing names, electrons, and oxidation states.", "subpage_snippet": "", "source": "ptable.com", "link": "https://ptable.com/", "content": "Interactive periodic table showing names, electrons, and oxidation states."}
+{"idx": 4, "title": "Как FSR 4 на RX 6900 XT запускали — Софт на DTF", "date": "", "ddg_snippet": "Как многие знают, относительно недавно AMD на короткое время выложила исходный код FSR 4 на GitHub . И спустя непродолжительное время с помощью OptiScaler его начали запускать на видеокартах rdna 2 и 3, в том числе удачно — и на Steam Deck.", "subpage_snippet": "", "source": "dtf.ru", "link": "https://dtf.ru/software/4035298-fsr-4-na-rx-6900-xt-zapusk-i-testirovanie", "content": "Как многие знают, относительно недавно AMD на короткое время выложила исходный код FSR 4 на GitHub . И спустя непродолжительное время с помощью OptiScaler его начали запускать на видеокартах rdna 2 и 3, в том числе удачно — и на Steam Deck."}
+{"idx": 5, "title": "Profile Readme Generator", "date": "", "ddg_snippet": "Beautify your github profile with this amazing tool, creating the readme your way in a simple and fast way! The best profile readme generator you will find!", "subpage_snippet": "", "source": "profile-readme-generator.com", "link": "https://profile-readme-generator.com/", "content": "Beautify your github profile with this amazing tool, creating the readme your way in a simple and fast way! The best profile readme generator you will find!"}
+{"idx": 6, "title": "Stardew Valley Vanilla IDs | Full 1 .6 Item List", "date": "", "ddg_snippet": "Mixed Flower Seeds. [MixedFlowerSeeds]. Golden Bobber.Ancient Table .", "subpage_snippet": "", "source": "mateusaquino.github.io", "link": "https://mateusaquino.github.io/stardewids/", "content": "Mixed Flower Seeds. [MixedFlowerSeeds]. Golden Bobber.Ancient Table ."}
+{"idx": 7, "title": "Rudalle — Используйте технические возможности моделей для...", "date": "", "ddg_snippet": "Код и веса модели находятся в открытом доступе: GitHub , HuggingFace. Примеры видеороликов можно посмотреть в разделе Галерея, а самостоятельно потестировать генерацию видео на платформе fusionbrain.ai и в Telegram-боте.", "subpage_snippet": "", "source": "rudalle.ru", "link": "https://rudalle.ru/", "content": "Код и веса модели находятся в открытом доступе: GitHub , HuggingFace. Примеры видеороликов можно посмотреть в разделе Галерея, а самостоятельно потестировать генерацию видео на платформе fusionbrain.ai и в Telegram-боте."}
+{"idx": 8, "title": "SSH и удалённые git-репозитории / Хабр", "date": "", "ddg_snippet": "GitHub , GitLab и Yandex рекомендуют использовать ed25519. Название файла, в который будет сохранён ключ, можно оставить дефолтным. Далее по желанию можно задать пароль на генерируемый ключ.", "subpage_snippet": "", "source": "habr.com", "link": "https://habr.com/ru/articles/755036/", "content": "GitHub , GitLab и Yandex рекомендуют использовать ed25519. Название файла, в который будет сохранён ключ, можно оставить дефолтным. Далее по желанию можно задать пароль на генерируемый ключ."}
+{"idx": 9, "title": "SELECT DISTINCT ON in PostgreSQL | Geeky Tidbits", "date": "", "ddg_snippet": "GitHub .That INNER JOIN with a subquery is used to determine the last timestamp for each URL. Then, the outer query is pulling from the log table and using the results of that subquery to limit the results to only the last requests by URL.", "subpage_snippet": "", "source": "www.geekytidbits.com", "link": "https://www.geekytidbits.com/postgres-distinct-on/", "content": "GitHub .That INNER JOIN with a subquery is used to determine the last timestamp for each URL. Then, the outer query is pulling from the log table and using the results of that subquery to limit the results to only the last requests by URL."}

data/sampled_jsons/ImagineFSL_Self-Supervised_Pretraining_Matters_reference_21.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "ImagineFSL: Self-Supervised Pretraining Matters on Imagined ...", "date": "", "ddg_snippet": "We find that, compared to no pretraining , both supervised and self-supervised pretraining are beneficial, with the latter pro-viding better performance. Based on on this finding, we propose an improved self-supervised method tailored for few-shot scenarios, enhancing the transferability of repre-sentations from synthetic to real image domains.", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/papers/Yang_ImagineFSL_Self-Supervised_Pretraining_Matters_on_Imagined_Base_Set_for_VLM-based_CVPR_2025_paper.pdf", "content": "We find that, compared to no pretraining , both supervised and self-supervised pretraining are beneficial, with the latter pro-viding better performance. Based on on this finding, we propose an improved self-supervised method tailored for few-shot scenarios, enhancing the transferability of repre-sentations from synthetic to real image domains."}
+{"idx": 1, "title": "ImagineFSL: Self-Supervised Pretraining Matters on Imagined ...", "date": "", "ddg_snippet": "We find that, compared to no pretraining , both supervised and self-supervised pretraining are beneficial, with the latter providing better performance. Based on on this finding, we propose an improved self-supervised method tailored for few-shot scenarios, enhancing the transferability of representations from synthetic to real image domains.", "subpage_snippet": "", "source": "ieeexplore.ieee.org", "link": "https://ieeexplore.ieee.org/document/11094502", "content": "We find that, compared to no pretraining , both supervised and self-supervised pretraining are beneficial, with the latter providing better performance. Based on on this finding, we propose an improved self-supervised method tailored for few-shot scenarios, enhancing the transferability of representations from synthetic to real image domains."}
+{"idx": 2, "title": "Releases: HaoyuanYang-2023/ImagineFSL_Preview - GitHub", "date": "", "ddg_snippet": "Official implementation of \" ImagineFSL : Self-Supervised Pretraining Matters on Imagined Base Set for VLM-based Few-shot Learning\" [CVPR 2025 Highlight] - HaoyuanYang ...", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/HaoyuanYang-2023/ImagineFSL_Preview/releases", "content": "Official implementation of \" ImagineFSL : Self-Supervised Pretraining Matters on Imagined Base Set for VLM-based Few-shot Learning\" [CVPR 2025 Highlight] - HaoyuanYang ..."}
+{"idx": 3, "title": "dblp: ImagineFSL: Self-Supervised Pretraining Matters on ...", "date": "", "ddg_snippet": "Jul 21 , 2025 · Bibliographic details on ImagineFSL : Self-Supervised Pretraining Matters on Imagined Base Set for VLM-based Few-shot Learning.", "subpage_snippet": "", "source": "dblp.org", "link": "https://dblp.org/rec/conf/cvpr/YangLLCWL25", "content": "Jul 21 , 2025 · Bibliographic details on ImagineFSL : Self-Supervised Pretraining Matters on Imagined Base Set for VLM-based Few-shot Learning."}
+{"idx": 4, "title": "ImagineFSL: Self-Supervised Pretraining Matters on Imagined ...", "date": "", "ddg_snippet": "We introduce a novel CLIP adaptation methodology called * ImagineFSL *, involving pretraining on the imagined base set followed by fine-tuning on downstream few-shot tasks. We find that, compared to no pretraining , both supervised and self-supervised pretraining are beneficial, with the latter providing better performance.", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/html/Yang_ImagineFSL_Self-Supervised_Pretraining_Matters_on_Imagined_Base_Set_for_VLM-based_CVPR_2025_paper.html", "content": "We introduce a novel CLIP adaptation methodology called * ImagineFSL *, involving pretraining on the imagined base set followed by fine-tuning on downstream few-shot tasks. We find that, compared to no pretraining , both supervised and self-supervised pretraining are beneficial, with the latter providing better performance."}
+{"idx": 5, "title": "Self-Supervised Pretraining Matters on Imagined Base Set ...", "date": "", "ddg_snippet": "by H Yang — The hyperparameters of fine-tuning for few-shot tasks are presented in Table S-2. For ImagineFSL , we use. AdamW optimizer with a cosine decay of learning rate.", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/supplemental/Yang_ImagineFSL_Self-Supervised_Pretraining_CVPR_2025_supplemental.pdf", "content": "by H Yang — The hyperparameters of fine-tuning for few-shot tasks are presented in Table S-2. For ImagineFSL , we use. AdamW optimizer with a cosine decay of learning rate."}
+{"idx": 6, "title": "Homepage of Qilong Wang - GitHub Pages", "date": "", "ddg_snippet": "Mar 3, 2022 · ImagineFSL : Self-Supervised Pretraining Matters on Imagined Base Set for VLM-based Few-shot Learning. 38th IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2025 [PDF] [Code] (highlight paper (13.5%)) Junjie Wu, Qilong Wang *, Jiangtao Xie, Pengfei Zhu, Qinghua Hu. Asymmetric Factorized Bilinear Operation for Vision Transformer.", "subpage_snippet": "", "source": "csqlwang.github.io", "link": "https://csqlwang.github.io/homepage/", "content": "Mar 3, 2022 · ImagineFSL : Self-Supervised Pretraining Matters on Imagined Base Set for VLM-based Few-shot Learning. 38th IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2025 [PDF] [Code] (highlight paper (13.5%)) Junjie Wu, Qilong Wang *, Jiangtao Xie, Pengfei Zhu, Qinghua Hu. Asymmetric Factorized Bilinear Operation for Vision Transformer."}
+{"idx": 7, "title": "52CV/CVPR-2025-Papers", "date": "", "ddg_snippet": "ImagineFSL: Self-Supervised Pretraining Matters on Imagined Base Set for VLM-based Few-shot Learning ... A Unified Approach to Interpreting Self-supervised Pre- ...", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/52CV/CVPR-2025-Papers", "content": "ImagineFSL: Self-Supervised Pretraining Matters on Imagined Base Set for VLM-based Few-shot Learning ... A Unified Approach to Interpreting Self-supervised Pre- ..."}
+{"idx": 8, "title": "IEEE/CVF Conference on Computer Vision and Pattern ...", "date": "", "ddg_snippet": "370 ImagineFSL : Self - Supervised Pretraining Matters on Imagined. ❉. Base Set for VLM-based Few-shot Learning, Haoyuan Yang,. ⭐ Xiaoou Li, Jiaming Lv, Xianjun ... 80 pages", "subpage_snippet": "", "source": "media.eventhosts.cc", "link": "https://media.eventhosts.cc/Conferences/CVPR2025/CVPR_main_conf_2025.pdf", "content": "370 ImagineFSL : Self - Supervised Pretraining Matters on Imagined. ❉. Base Set for VLM-based Few-shot Learning, Haoyuan Yang,. ⭐ Xiaoou Li, Jiaming Lv, Xianjun ... 80 pages"}
+{"idx": 9, "title": "Welcome to Vision by Statistical Learning lab - Peihua Li", "date": "", "ddg_snippet": "Representative publications Selected publications by area My google scholar citations", "subpage_snippet": "", "source": "www.peihuali.org", "link": "https://www.peihuali.org/Publications.html", "content": "Representative publications Selected publications by area My google scholar citations"}

data/sampled_jsons/JUICE_dual-run_approach_superposition_effects_attention_heads_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Massive Values in Self-Attention Modules are the Key to ...", "date": "", "ddg_snippet": "3 Feb 2025 — ... Run Twice ( JuICE ), a test-time attention ... attention heads and leverages a dual - run approach to mitigate the superposition effects .", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/Massive-Values-in-Self-Attention-Modules-are-the-to-Jin-Mei/e57e636fe5dfd2d39eafe92448f53336ce6b8911", "content": "3 Feb 2025 — ... Run Twice ( JuICE ), a test-time attention ... attention heads and leverages a dual - run approach to mitigate the superposition effects ."}
+{"idx": 1, "title": "Taming Knowledge Conflicts in Language Models", "date": "", "ddg_snippet": "by G Li · 2025 — JuICE identifies a set of reliable attention heads and leverages a dual-run approach to mitigate the superposition effects.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2503.10996", "content": "by G Li · 2025 — JuICE identifies a set of reliable attention heads and leverages a dual-run approach to mitigate the superposition effects."}
+{"idx": 2, "title": "Taming Knowledge Conflicts in Language Models", "date": "", "ddg_snippet": "JUICE identifies a set of reliable attention heads and leverages a dual-run approach to mitigate the superposition effects.", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/46677", "content": "JUICE identifies a set of reliable attention heads and leverages a dual-run approach to mitigate the superposition effects."}
+{"idx": 3, "title": "Taming Knowledge Conflicts in Language Models", "date": "", "ddg_snippet": "14 Mar 2025 — JuICE identifies a set of reliable attention heads and leverages a dual - run approach to mitigate the superposition effects . Extensive ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2503.10996v1", "content": "14 Mar 2025 — JuICE identifies a set of reliable attention heads and leverages a dual - run approach to mitigate the superposition effects . Extensive ..."}
+{"idx": 4, "title": "Taming Knowledge Conflicts in Language Models", "date": "", "ddg_snippet": "by G Li — JuICE identifies a set of reliable attention heads and leverages a dual-run approach to mitigate the superposition effects.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=0cEZyhHEks", "content": "by G Li — JuICE identifies a set of reliable attention heads and leverages a dual-run approach to mitigate the superposition effects."}
+{"idx": 5, "title": "Daily Papers", "date": "", "ddg_snippet": "JUICE identifies a set of reliable attention heads and leverages a dual - run approach to mitigate the superposition effects . Extensive experiments across 11 ...", "subpage_snippet": "", "source": "huggingface.co", "link": "https://huggingface.co/papers?q=JuICe", "content": "JUICE identifies a set of reliable attention heads and leverages a dual - run approach to mitigate the superposition effects . Extensive experiments across 11 ..."}
+{"idx": 6, "title": "Daily Papers", "date": "", "ddg_snippet": "2 days ago — JUICE identifies a set of reliable attention heads and leverages a dual - run approach to mitigate the superposition effects . Extensive ...", "subpage_snippet": "", "source": "huggingface.co", "link": "https://huggingface.co/papers?q=Mapping+Attention+head+ParameterS", "content": "2 days ago — JUICE identifies a set of reliable attention heads and leverages a dual - run approach to mitigate the superposition effects . Extensive ..."}
+{"idx": 7, "title": "Mitigating Knowledge Conflicts in LLM Generation via Identifying ...", "date": "", "ddg_snippet": "This work proposes Just Run Twice ( JuICE ), a test-time attention ... attention heads and leverages a dual - run approach to mitigate the superposition effects .", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/IRCAN:-Mitigating-Knowledge-Conflicts-in-LLM-via-Shi-Jin/f95eb48dd381c04ee797d588c7417d71040c8ac0", "content": "This work proposes Just Run Twice ( JuICE ), a test-time attention ... attention heads and leverages a dual - run approach to mitigate the superposition effects ."}
+{"idx": 8, "title": "[Literature Review] Taming Knowledge Conflicts in ...", "date": "", "ddg_snippet": "14 Mar 2025 — JUICE consistently outperformed baseline methods , including existing model fine-tuning techniques. JUICE demonstrated robustness regarding the ...", "subpage_snippet": "", "source": "www.themoonlight.io", "link": "https://www.themoonlight.io/en/review/taming-knowledge-conflicts-in-language-models", "content": "14 Mar 2025 — JUICE consistently outperformed baseline methods , including existing model fine-tuning techniques. JUICE demonstrated robustness regarding the ..."}
+{"idx": 9, "title": "Spotlight Posters", "date": "", "ddg_snippet": "JuICE identifies a set of reliable attention heads and leverages a dual - run approach to mitigate the superposition effects . Extensive experiments across 11 ...", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/events/2025SpotlightPosters", "content": "JuICE identifies a set of reliable attention heads and leverages a dual - run approach to mitigate the superposition effects . Extensive experiments across 11 ..."}

data/sampled_jsons/Kerner_2024_research_paper_publication_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Kerner -Collection, as of February 2024", "date": "", "ddg_snippet": "Gender gaps in publications and citations in gambling studies: Comparisons against addiction science. Sinclair, Eliscia Siu-Lin Liang; Clark", "subpage_snippet": "", "source": "criminologie.org.ro", "link": "https://criminologie.org.ro/wp-content/uploads/2024/02/3-Kerner-Collecton-APA-Journal-Articles_OA-FoC-2024.pdf", "content": "Gender gaps in publications and citations in gambling studies: Comparisons against addiction science. Sinclair, Eliscia Siu-Lin Liang; Clark"}
+{"idx": 1, "title": "About - Hannah Kerner", "date": "", "ddg_snippet": "November 2024 : Our paper , “Hotspotter: A Generalizable Pipeline for Automated Detection of Subtle Volcanic Thermal Features in Satellite Images,” was accepted for publication at AAAI 2025 Innovative Applications of AI! ( public link coming soon).", "subpage_snippet": "", "source": "hannah-rae.github.io", "link": "https://hannah-rae.github.io/", "content": "November 2024 : Our paper , “Hotspotter: A Generalizable Pipeline for Automated Detection of Subtle Volcanic Thermal Features in Satellite Images,” was accepted for publication at AAAI 2025 Innovative Applications of AI! ( public link coming soon)."}
+{"idx": 2, "title": "Kerner 2024 – Weingut Taschlerhof – Peter Wachtler", "date": "", "ddg_snippet": "HomeKerner 2024 . Kerner 2024 . Sort: Cross of Riesling x Trollinger (Vernatsch). Straw-yellow to greenish-yellow in colour, fruity with fresh note, taste of nutmeg, full and minerally.", "subpage_snippet": "", "source": "www.taschlerhof.com", "link": "https://www.taschlerhof.com/en/produkt/kerner/", "content": "HomeKerner 2024 . Kerner 2024 . Sort: Cross of Riesling x Trollinger (Vernatsch). Straw-yellow to greenish-yellow in colour, fruity with fresh note, taste of nutmeg, full and minerally."}
+{"idx": 3, "title": "Mathilde Bernard, prix Kerner 2024 de vulgarisation scientifique...", "date": "", "ddg_snippet": "Elle a remporté le 1er prix Kerner 2024 de vulgarisation scientifique de la Fondation ARC, lors de la 28e édition des Journées Jeunes Chercheurs en cancérologie.", "subpage_snippet": "", "source": "www.iledefrance-villejuif.cnrs.fr", "link": "https://www.iledefrance-villejuif.cnrs.fr/fr/cnrsinfo/mathilde-bernard-prix-kerner-2024-de-vulgarisation-scientifique-fondation-arc", "content": "Elle a remporté le 1er prix Kerner 2024 de vulgarisation scientifique de la Fondation ARC, lors de la 28e édition des Journées Jeunes Chercheurs en cancérologie."}
+{"idx": 4, "title": "Abbazia di Novacella Kerner 2024 | xtraWine", "date": "", "ddg_snippet": "Technical Sheet. Name. Abbazia di Novacella Kerner 2024 . Type. White still.Alto Adige DOC. Vintage. 2024 . Size.", "subpage_snippet": "", "source": "www.xtrawine.com", "link": "https://www.xtrawine.com/en-uk/products/abbazia-di-novacella-kerner-2024", "content": "Technical Sheet. Name. Abbazia di Novacella Kerner 2024 . Type. White still.Alto Adige DOC. Vintage. 2024 . Size."}
+{"idx": 5, "title": "Kerner 2024", "date": "", "ddg_snippet": "An elegant Kerner with a varietally typical aromatic expression and a smooth fruity palate.sandy loess. date of collection. 7.9. 2024 . sugar content at harvest.", "subpage_snippet": "", "source": "en.vinarstvibalaz.cz", "link": "https://en.vinarstvibalaz.cz/vino/kerner-2024-ps-klasik", "content": "An elegant Kerner with a varietally typical aromatic expression and a smooth fruity palate.sandy loess. date of collection. 7.9. 2024 . sugar content at harvest."}
+{"idx": 6, "title": "Ian Kerner - 2024 Annual Conference Speaker", "date": "", "ddg_snippet": "CAMFT's 2024 Annual Conference. May 3 - 4, 2024 at the Los Angeles Airport Marriott.Ian Kerner , PhD, LMFT is the co-Director of the sex therapy program at the Institute for Contemporary Psychotherapy and contributes regularly on the topic of sexual health for CNN.", "subpage_snippet": "", "source": "www.camft.org", "link": "https://www.camft.org/Education/Events/2024-Annual-Conference/Ian-Kerner", "content": "CAMFT's 2024 Annual Conference. May 3 - 4, 2024 at the Los Angeles Airport Marriott.Ian Kerner , PhD, LMFT is the co-Director of the sex therapy program at the Institute for Contemporary Psychotherapy and contributes regularly on the topic of sexual health for CNN."}
+{"idx": 7, "title": "Aduki: un Extraño Planeta by Ivan Kerner ( 2024 ...) | eBay Australia", "date": "", "ddg_snippet": "Publication Year 2024 . Language Spanish. Number of Pages 32 Pages. Author Ivan Kerner . Book Series Aduki Ser.", "subpage_snippet": "", "source": "www.ebay.com.au", "link": "https://www.ebay.com.au/p/28082408567", "content": "Publication Year 2024 . Language Spanish. Number of Pages 32 Pages. Author Ivan Kerner . Book Series Aduki Ser."}
+{"idx": 8, "title": "Information avoidance and testing for COVID‐19 - Kerner - 2024 ...", "date": "", "ddg_snippet": "To limit the spread of the COVID-19 virus, many employers and institutions developed procedures for people who tested positive. We propose that these procedures may have dissuaded people from testing...", "subpage_snippet": "", "source": "compass.onlinelibrary.wiley.com", "link": "https://compass.onlinelibrary.wiley.com/doi/10.1111/spc3.12920", "content": "To limit the spread of the COVID-19 virus, many employers and institutions developed procedures for people who tested positive. We propose that these procedures may have dissuaded people from testing..."}
+{"idx": 9, "title": "AI and Machine Learning Algorithms: Strengths, Weaknesses and Best...", "date": "", "ddg_snippet": "In supervised learning, the supervised learning algorithm learns a mapping between the input features and output labels” (Gupta, 2024 ). Unsupervised Learning Algorithms (ML-specific): K-Means Clustering, Hierarchical Clustering, and Principal Component Analysis (PCA).", "subpage_snippet": "", "source": "www.alexomegapy.com", "link": "https://www.alexomegapy.com/post/ai-and-machine-learning-algorithms-strengths-weaknesses-and-best-use-cases", "content": "In supervised learning, the supervised learning algorithm learns a mapping between the input features and output labels” (Gupta, 2024 ). Unsupervised Learning Algorithms (ML-specific): K-Means Clustering, Hierarchical Clustering, and Principal Component Analysis (PCA)."}

data/sampled_jsons/LLaVA-Next_4x_more_pixels_higher_resolution_672x672_336x1344_vision_encoder_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "LLaVA-NeXT", "date": "", "ddg_snippet": "20 Mar 2024 — LLaVA ‑ NeXT improves on Llava by increasing the input image resolution by 4x more ... 672x672 , 336x1344 , 1344x336) to better grasp visual details.", "subpage_snippet": "", "source": "huggingface.co", "link": "https://huggingface.co/docs/transformers/en/model_doc/llava_next", "content": "20 Mar 2024 — LLaVA ‑ NeXT improves on Llava by increasing the input image resolution by 4x more ... 672x672 , 336x1344 , 1344x336) to better grasp visual details."}
+{"idx": 1, "title": "LLaVA-NeXT: Improved reasoning, OCR, and world knowledge", "date": "", "ddg_snippet": "30 Jan 2024 — It supports three aspect ratios, up to 672x672 , 336x1344 , 1344x336 resolution . Better visual reasoning and OCR capability with an improved ...", "subpage_snippet": "", "source": "llava-vl.github.io", "link": "https://llava-vl.github.io/blog/2024-01-30-llava-next/", "content": "30 Jan 2024 — It supports three aspect ratios, up to 672x672 , 336x1344 , 1344x336 resolution . Better visual reasoning and OCR capability with an improved ..."}
+{"idx": 2, "title": "LLaVA-NeXT", "date": "", "ddg_snippet": "Increasing the input image resolution to 4x more pixels . This allows it to grasp more visual details. It supports three aspect ratios, up to 672x672 ...", "subpage_snippet": "", "source": "huggingface.co", "link": "https://huggingface.co/docs/transformers/v4.45.2/en/model_doc/llava_next", "content": "Increasing the input image resolution to 4x more pixels . This allows it to grasp more visual details. It supports three aspect ratios, up to 672x672 ..."}
+{"idx": 3, "title": "llava", "date": "", "ddg_snippet": "Increasing the input image resolution to up to 4x more pixels , supporting 672x672 , 336x1344 , 1344x336 resolutions . · Better visual reasoning and OCR capability ...", "subpage_snippet": "", "source": "ollama.com", "link": "https://ollama.com/library/llava", "content": "Increasing the input image resolution to up to 4x more pixels , supporting 672x672 , 336x1344 , 1344x336 resolutions . · Better visual reasoning and OCR capability ..."}
+{"idx": 4, "title": "LLaVA: Large Language and Vision Assistant Explained", "date": "", "ddg_snippet": "17 Oct 2023 — It supports three aspect ratios, up to 672x672 , 336x1344 , and 1344x336 resolution . Better visual reasoning and zero-shot OCR capability with ...", "subpage_snippet": "", "source": "encord.com", "link": "https://encord.com/blog/llava-large-language-vision-assistant/", "content": "17 Oct 2023 — It supports three aspect ratios, up to 672x672 , 336x1344 , and 1344x336 resolution . Better visual reasoning and zero-shot OCR capability with ..."}
+{"idx": 5, "title": "Large Language and Vision Assistant (LLaVA) — v1.6 vs. ...", "date": "", "ddg_snippet": "By increasing the input image resolution to four times more pixels , as mentioned above, the model now supports images up to 672 x 672 , 336 x ...", "subpage_snippet": "", "source": "medium.com", "link": "https://medium.com/@sulaiman.shamasna/large-language-and-vision-assistant-llava-v1-6-vs-v1-5-ede06b81ab48", "content": "By increasing the input image resolution to four times more pixels , as mentioned above, the model now supports images up to 672 x 672 , 336 x ..."}
+{"idx": 6, "title": "gokayfem/awesome-vlm-architectures: Famous Vision ...", "date": "", "ddg_snippet": "LLaVA seamlessly integrates a pre-trained language model (Vicuna) with a visual encoder (CLIP) using a simple linear layer, creating a robust architecture ...", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/gokayfem/awesome-vlm-architectures", "content": "LLaVA seamlessly integrates a pre-trained language model (Vicuna) with a visual encoder (CLIP) using a simple linear layer, creating a robust architecture ..."}
+{"idx": 7, "title": "huggingface/transformers v4.39.0 on GitHub", "date": "", "ddg_snippet": "It supports three aspect ratios, up to 672x672 , 336x1344 , 1344x336 resolution . Better visual reasoning and OCR capability with an improved visual instruction ...", "subpage_snippet": "", "source": "newreleases.io", "link": "https://newreleases.io/project/github/huggingface/transformers/release/v4.39.0", "content": "It supports three aspect ratios, up to 672x672 , 336x1344 , 1344x336 resolution . Better visual reasoning and OCR capability with an improved visual instruction ..."}
+{"idx": 8, "title": "Why Dubai Businesses Must Embrace AI for Employee ...", "date": "", "ddg_snippet": "New in LLaVA 1.6: Increasing the input image resolution to up to 4x more pixels , supporting 672x672 , 336x1344 , 1344x336 resolutions . Better ...", "subpage_snippet": "", "source": "www.linkedin.com", "link": "https://www.linkedin.com/pulse/why-dubai-businesses-must-embrace-ai-employee-while-keeping-ibrahim-vh5nf", "content": "New in LLaVA 1.6: Increasing the input image resolution to up to 4x more pixels , supporting 672x672 , 336x1344 , 1344x336 resolutions . Better ..."}
+{"idx": 9, "title": "AI/ML Toolkit", "date": "", "ddg_snippet": "It supports three aspect ratios, up to 672x672 , 336x1344 , 1344x336 resolution . Better visual reasoning and OCR capability with an improved visual instruction ...", "subpage_snippet": "", "source": "gist.github.com", "link": "https://gist.github.com/0xdevalias/09a5c27702cb94f81c9fb4b7434df966", "content": "It supports three aspect ratios, up to 672x672 , 336x1344 , 1344x336 resolution . Better visual reasoning and OCR capability with an improved visual instruction ..."}

data/sampled_jsons/Linear_convergence_of_Sinkhorn's_algorithm_for_generalized_static_Schrödinger_bridge_filetypepdf.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "ICML Poster Linear convergence of Sinkhorn ' s algorithm for ...", "date": "", "ddg_snippet": "We establish Kantorovich duality and linear convergence of Sinkhorn ' s algorithm for the generalized SSB problem under mild conditions. Our results provide a new rigorous foundation for understanding Sinkhorn - type iterative methods in the context of large-scale generalized ...", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/46671", "content": "We establish Kantorovich duality and linear convergence of Sinkhorn ' s algorithm for the generalized SSB problem under mild conditions. Our results provide a new rigorous foundation for understanding Sinkhorn - type iterative methods in the context of large-scale generalized ..."}
+{"idx": 1, "title": "[2201.10059] Stability of Schrödinger Potentials and Convergence of ...", "date": "", "ddg_snippet": "View a PDF of the paper titled Stability of Schr\\\"odinger Potentials and Convergence of Sinkhorn ' s Algorithm , by Marcel Nutz and 1 other authors.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2201.10059", "content": "View a PDF of the paper titled Stability of Schr\\\"odinger Potentials and Convergence of Sinkhorn ' s Algorithm , by Marcel Nutz and 1 other authors."}
+{"idx": 2, "title": "( PDF ) An Optimal Transport Approach for the Schrödinger Bridge ...", "date": "", "ddg_snippet": "Bridge problem, including convergence of Sinkhorn algorithm in the multi-marginal case.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/345547115_An_Optimal_Transport_Approach_for_the_Schrodinger_Bridge_Problem_and_Convergence_of_Sinkhorn_Algorithm", "content": "Bridge problem, including convergence of Sinkhorn algorithm in the multi-marginal case."}
+{"idx": 3, "title": "Quantitative contraction rates for Sinkhorn algorithm", "date": "", "ddg_snippet": "Exponential convergence of sinkhorn algorithm .Theorem 31 (Exponential convergence of Sinkhorn bridges ). Assume the validity of A1 and A2 and (19) for some positive constants A, B > 0. Then, for any n ≥ 1 it holds.", "subpage_snippet": "", "source": "pure.tue.nl", "link": "https://pure.tue.nl/ws/portalfiles/portal/295195017/2304.04451v1.pdf", "content": "Exponential convergence of sinkhorn algorithm .Theorem 31 (Exponential convergence of Sinkhorn bridges ). Assume the validity of A1 and A2 and (19) for some positive constants A, B > 0. Then, for any n ≥ 1 it holds."}
+{"idx": 4, "title": "On the linear convergence of the", "date": "", "ddg_snippet": "Multi-marginal Sinkhorn algorithm . Linear convergence .The aim of this short note is to give an elementary proof of linear convergence of the Sinkhorn algorithm for the entropic regularization of multi-marginal optimal transport.", "subpage_snippet": "", "source": "www.ceremade.dauphine.fr", "link": "https://www.ceremade.dauphine.fr/~carlier/linear-sinkhorn.pdf", "content": "Multi-marginal Sinkhorn algorithm . Linear convergence .The aim of this short note is to give an elementary proof of linear convergence of the Sinkhorn algorithm for the entropic regularization of multi-marginal optimal transport."}
+{"idx": 5, "title": "Optimal transport with f -divergence regularization and generalized", "date": "", "ddg_snippet": "Algorithm 2 Generalized Sinkhorn algorithm for com-puting optimal potentials f, g and optimal coupling π.An optimal transport approach for the schrödinger bridge prob-lem and convergence of sinkhorn algorithm .", "subpage_snippet": "", "source": "proceedings.mlr.press", "link": "https://proceedings.mlr.press/v151/terjek22a/terjek22a.pdf", "content": "Algorithm 2 Generalized Sinkhorn algorithm for com-puting optimal potentials f, g and optimal coupling π.An optimal transport approach for the schrödinger bridge prob-lem and convergence of sinkhorn algorithm ."}
+{"idx": 6, "title": "An Optimal Transport Approach for the Schrödinger Bridge Problem...", "date": "", "ddg_snippet": "3 Convergence of the Sinkhorn /IPFP Algorithm .In this section we generalize the results obtain previously for the Schrödinger problem with more than two marginals, including a proof of convergence of the Sinkhorn algorithm in the several marginals case.", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/article/10.1007/s10915-020-01325-7", "content": "3 Convergence of the Sinkhorn /IPFP Algorithm .In this section we generalize the results obtain previously for the Schrödinger problem with more than two marginals, including a proof of convergence of the Sinkhorn algorithm in the several marginals case."}
+{"idx": 7, "title": "Designing Algorithms for Entropic Optimal Transport", "date": "", "ddg_snippet": "Dynamical Schrödinger bridge problem.Based on this, classical analysis of the Sinkhorn algorithm with Hilbert’ s projective metric and Birkhoff’ s theorem [FL89] renders a linear convergence with contraction rate 1 − Θ(e− c ∞/ε), where ε is the regularisation parameter.", "subpage_snippet": "", "source": "nbviewer.org", "link": "https://nbviewer.org/github/QijiaJ/QijiaJ.github.io/blob/master/_includes/eOT_optimization_2025.pdf", "content": "Dynamical Schrödinger bridge problem.Based on this, classical analysis of the Sinkhorn algorithm with Hilbert’ s projective metric and Birkhoff’ s theorem [FL89] renders a linear convergence with contraction rate 1 − Θ(e− c ∞/ε), where ε is the regularisation parameter."}
+{"idx": 8, "title": "[ PDF ] An Optimal Transport Approach for the Schrödinger Bridge ...", "date": "", "ddg_snippet": "Convergence of the Sinkhorn algorithm when the Schrödinger problem has no solution. Aymeric BaradatE. Ventre. Schrödinger bridge is a stochastic optimal control problem to steer a given initial state density to another, subject to controlled diffusion and deadline constraints.", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/An-Optimal-Transport-Approach-for-the-Schrödinger-Marino-Gerolin/1fa3ad8de61e534b3983553a2af7d629caeb0e1f", "content": "Convergence of the Sinkhorn algorithm when the Schrödinger problem has no solution. Aymeric BaradatE. Ventre. Schrödinger bridge is a stochastic optimal control problem to steer a given initial state density to another, subject to controlled diffusion and deadline constraints."}
+{"idx": 9, "title": "Tree-Based Diffusion Schrödinger Bridge with Applications to...", "date": "", "ddg_snippet": "A general framework for tree-based static Schrödinger Bridges on discrete state -spaces was given in Haasler et al.Carlier, G. On the linear convergence of the multimarginal Sinkhorn algorithm .", "subpage_snippet": "", "source": "hal.science", "link": "https://hal.science/hal-04402356/document", "content": "A general framework for tree-based static Schrödinger Bridges on discrete state -spaces was given in Haasler et al.Carlier, G. On the linear convergence of the multimarginal Sinkhorn algorithm ."}

data/sampled_jsons/Machine_Learning_meets_Algebraic_Combinatorics_mHeight_3412_patterns_Section_4.2.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Machine Learning Meets Algebraic Combinatorics", "date": "", "ddg_snippet": "The mHeight of σ is then the minimum height over all 3412 patterns in σ. We provide datasets for n = 8, 9, 10. ML task: Predict the mHeight of a permutation.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/attachment?id=tlniJJFUW2&name=pdf", "content": "The mHeight of σ is then the minimum height over all 3412 patterns in σ. We provide datasets for n = 8, 9, 10. ML task: Predict the mHeight of a permutation."}
+{"idx": 1, "title": "Machine Learning meets Algebraic Combinatorics", "date": "", "ddg_snippet": "by H Chau — In this paper we introduced Algebraic Combinatorics Dataset Repository, a collection of datasets structured for machine learning and designed to facilitate the ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=KQ1gI5qzAf", "content": "by H Chau — In this paper we introduced Algebraic Combinatorics Dataset Repository, a collection of datasets structured for machine learning and designed to facilitate the ..."}
+{"idx": 2, "title": "Machine Learning meets Algebraic Combinatorics", "date": "", "ddg_snippet": "by H Chau · 2025 · Cited by 3 — The mHeight of σ is then the minimum height over all 3412 patterns in σ. We provide datasets for n = 8, 9, 10. ML task: Predict the mHeight ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2503.06366", "content": "by H Chau · 2025 · Cited by 3 — The mHeight of σ is then the minimum height over all 3412 patterns in σ. We provide datasets for n = 8, 9, 10. ML task: Predict the mHeight ..."}
+{"idx": 3, "title": "Machine Learning meets Algebraic Combinatorics: A Suite of ...", "date": "", "ddg_snippet": "To address this, we introduce a new collection of datasets, the Algebraic Combinatorics Dataset Repository (ACD Repo), representing either foundational results or open problems in algebraic combinatorics , a subfield of mathematics that studies discrete structures arising from abstract algebra .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2503.06366v1", "content": "To address this, we introduce a new collection of datasets, the Algebraic Combinatorics Dataset Repository (ACD Repo), representing either foundational results or open problems in algebraic combinatorics , a subfield of mathematics that studies discrete structures arising from abstract algebra ."}
+{"idx": 4, "title": "Probability and Machine Learning in Combinatorial Commutative ...", "date": "", "ddg_snippet": "elds, un-less explicitly stated otherwise. Although algebraic closure and characteristic are generally crucial to proofs in commutative algebra , the combinatorial nature of monomial ideals ( Sec-tion 1.2.1) often allows us to skirt these considerations.", "subpage_snippet": "", "source": "www.cpp.edu", "link": "https://www.cpp.edu/faculty/lsilverstein/dissertation.pdf", "content": "elds, un-less explicitly stated otherwise. Although algebraic closure and characteristic are generally crucial to proofs in commutative algebra , the combinatorial nature of monomial ideals ( Sec-tion 1.2.1) often allows us to skirt these considerations."}
+{"idx": 5, "title": "Machine Checked Proofs and Programs in Algebraic Combinatorics", "date": "", "ddg_snippet": "A specific feature of algebraic combinatorics is the constant interplay between algorithms and algebraic con-structions: algorithms are not only in computations, but also are key ingredients in definitions and proofs.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2412.04864", "content": "A specific feature of algebraic combinatorics is the constant interplay between algorithms and algebraic con-structions: algorithms are not only in computations, but also are key ingredients in definitions and proofs."}
+{"idx": 6, "title": "An Introduction to Algebraic Combinatorics - LMU", "date": "", "ddg_snippet": "Abstract. This is an introduction to algebraic combinatorics , writ- ten for a quarter-long graduate course. It starts with a rigorous in- troduction to formal power series with some combinatorial applica- tions, then discusses integer partitions (proving Jacobi’s triple prod- uct identity), permutations (Lehmer codes, cycles) and subtractive methods (alternating sums, cancellations and ...", "subpage_snippet": "", "source": "www.cip.ifi.lmu.de", "link": "https://www.cip.ifi.lmu.de/~grinberg/t/21s/lecs.pdf", "content": "Abstract. This is an introduction to algebraic combinatorics , writ- ten for a quarter-long graduate course. It starts with a rigorous in- troduction to formal power series with some combinatorial applica- tions, then discusses integer partitions (proving Jacobi’s triple prod- uct identity), permutations (Lehmer codes, cycles) and subtractive methods (alternating sums, cancellations and ..."}
+{"idx": 7, "title": "Lecture Notes on Algebraic Combinatorics", "date": "", "ddg_snippet": "These lecture notes began as my notes from Vic Reiner’s Algebraic Combinatorics course at the University of Minnesota in Fall 2003. I currently use them for graduate courses at the University of Kansas.", "subpage_snippet": "", "source": "jlmartin.ku.edu", "link": "https://jlmartin.ku.edu/~jlmartin/LectureNotes.pdf", "content": "These lecture notes began as my notes from Vic Reiner’s Algebraic Combinatorics course at the University of Minnesota in Fall 2003. I currently use them for graduate courses at the University of Kansas."}
+{"idx": 8, "title": "Machine Learning meets Algebraic Combinatorics: A Suite of ...", "date": "", "ddg_snippet": "In this paper we introduce the Algebraic Combinatorics Dataset Repository, a collection of research-level mathemat-ics datasets structured for machine learning and designed to accelerate mathematical discovery.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2503.06366v1", "content": "In this paper we introduce the Algebraic Combinatorics Dataset Repository, a collection of research-level mathemat-ics datasets structured for machine learning and designed to accelerate mathematical discovery."}
+{"idx": 9, "title": "(PDF) Machine Learning Algebraic Geometry for Physics", "date": "", "ddg_snippet": "Apr 21, 2022 · PDF | We review some recent applications of machine learning to algebraic geometry and physics. Since problems in algebraic geometry can typically be... | Find, read and cite all the research you ...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/360166117_Machine_Learning_Algebraic_Geometry_for_Physics", "content": "Apr 21, 2022 · PDF | We review some recent applications of machine learning to algebraic geometry and physics. Since problems in algebraic geometry can typically be... | Find, read and cite all the research you ..."}

data/sampled_jsons/Machine_Unlearning_A_Survey.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Machine - Wikipedia", "date": "", "ddg_snippet": "A machine is a thermodynamic system that uses power to apply forces and control movement to perform an action. The term is commonly applied to artificial devices, such as those employing engines or motors, but also to natural biological macromolecules, such as molecular machines .", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/Machine", "content": "A machine is a thermodynamic system that uses power to apply forces and control movement to perform an action. The term is commonly applied to artificial devices, such as those employing engines or motors, but also to natural biological macromolecules, such as molecular machines ."}
+{"idx": 1, "title": "MACHINE Definition & Meaning | Dictionary .com", "date": "", "ddg_snippet": "Machine definition: an apparatus consisting of interrelated parts with separate functions, used in the performance of some kind of work.. See examples of MACHINE used in a sentence.", "subpage_snippet": "", "source": "www.dictionary.com", "link": "https://www.dictionary.com/browse/machine", "content": "Machine definition: an apparatus consisting of interrelated parts with separate functions, used in the performance of some kind of work.. See examples of MACHINE used in a sentence."}
+{"idx": 2, "title": "MACHINE Definition & Meaning - Merriam-Webster", "date": "", "ddg_snippet": "The meaning of MACHINE is a mechanically, electrically, or electronically operated device for performing a task. How to use machine in a sentence.", "subpage_snippet": "", "source": "www.merriam-webster.com", "link": "https://www.merriam-webster.com/dictionary/machine", "content": "The meaning of MACHINE is a mechanically, electrically, or electronically operated device for performing a task. How to use machine in a sentence."}
+{"idx": 3, "title": "Machine | Definition, Mechanisms & Efficiency | Britannica", "date": "", "ddg_snippet": "machine , device, having a unique purpose, that augments or replaces human or animal effort for the accomplishment of physical tasks.", "subpage_snippet": "", "source": "www.britannica.com", "link": "https://www.britannica.com/technology/machine", "content": "machine , device, having a unique purpose, that augments or replaces human or animal effort for the accomplishment of physical tasks."}
+{"idx": 4, "title": "MACHINE | English meaning - Cambridge Dictionary", "date": "", "ddg_snippet": "MACHINE definition: 1. a piece of equipment with several moving parts that uses power to do a particular type of work…. Learn more.", "subpage_snippet": "", "source": "dictionary.cambridge.org", "link": "https://dictionary.cambridge.org/dictionary/english/machine", "content": "MACHINE definition: 1. a piece of equipment with several moving parts that uses power to do a particular type of work…. Learn more."}
+{"idx": 5, "title": "machine , n. meanings, etymology and more | Oxford English...", "date": "", "ddg_snippet": "machine , n. meanings, etymology, pronunciation and more in the Oxford English Dictionary", "subpage_snippet": "", "source": "www.oed.com", "link": "https://www.oed.com/dictionary/machine_n", "content": "machine , n. meanings, etymology, pronunciation and more in the Oxford English Dictionary"}
+{"idx": 6, "title": "What Is A Machine ? Its Types and How it Works - Mech Lesson", "date": "", "ddg_snippet": "A machine is a mechanical device that uses power to apply force and control motion to perform work efficiently . Machines range from simple tools like pulleys and levers to complex systems like engines, robots, and manufacturing equipment.", "subpage_snippet": "", "source": "mechlesson.com", "link": "https://mechlesson.com/machine/", "content": "A machine is a mechanical device that uses power to apply force and control motion to perform work efficiently . Machines range from simple tools like pulleys and levers to complex systems like engines, robots, and manufacturing equipment."}
+{"idx": 7, "title": "machine - Wiktionary, the free dictionary", "date": "", "ddg_snippet": "3 days ago · (figuratively) A person or organisation that seemingly acts like a machine , being particularly efficient, single-minded, or unemotional. Bruce Campbell was a \"demon-killing machine \" because he made quick work of killing demons. The government has become a money-making machine .", "subpage_snippet": "", "source": "en.wiktionary.org", "link": "https://en.wiktionary.org/wiki/machine", "content": "3 days ago · (figuratively) A person or organisation that seemingly acts like a machine , being particularly efficient, single-minded, or unemotional. Bruce Campbell was a \"demon-killing machine \" because he made quick work of killing demons. The government has become a money-making machine ."}
+{"idx": 8, "title": "Machine - definition of machine by The Free Dictionary", "date": "", "ddg_snippet": "Of, relating to, or felt to resemble a machine : machine repairs; machine politics.", "subpage_snippet": "", "source": "www.thefreedictionary.com", "link": "https://www.thefreedictionary.com/machine", "content": "Of, relating to, or felt to resemble a machine : machine repairs; machine politics."}
+{"idx": 9, "title": "The Smashing Machine | Official Trailer HD | A24 - YouTube", "date": "", "ddg_snippet": "Special Blu-ray & 4K editions of Danny & Michael Philippou's sinister tale of domestic and occult horror. Special features include a commentary with the directors, one deleted scene, and an...", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=aRpnP3LZ99g", "content": "Special Blu-ray & 4K editions of Danny & Michael Philippou's sinister tale of domestic and occult horror. Special features include a commentary with the directors, one deleted scene, and an..."}

data/sampled_jsons/Medusa_Cai_et_al_2024_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Whisper-Medusa: aiOla Achieved a 1.5X Speedup Over OpenAI", "date": "", "ddg_snippet": "Our Medusa model builds on top of ... The results indicate that our Medusa architecture achieves a consistent speedup across all sequence lengths.", "subpage_snippet": "", "source": "aiola.ai", "link": "https://aiola.ai/the-tech-talk/medusa-architect/", "content": "Our Medusa model builds on top of ... The results indicate that our Medusa architecture achieves a consistent speedup across all sequence lengths."}
+{"idx": 1, "title": "Most Influential ArXiv (Machine Learning) Papers (2024-10)", "date": "", "ddg_snippet": "Medusa : Simple LLM Inference Acceleration Framework with Multiple Decoding Heads IF:4 Related Papers Related Patents Related Grants Related Venues ...", "subpage_snippet": "", "source": "www.paperdigest.org", "link": "https://www.paperdigest.org/2024/10/most-influential-arxiv-machine-learning-papers-2024-10/", "content": "Medusa : Simple LLM Inference Acceleration Framework with Multiple Decoding Heads IF:4 Related Papers Related Patents Related Grants Related Venues ..."}
+{"idx": 2, "title": "Reward-Shifted Speculative Sampling Is An Efficient Test-Time", "date": "", "ddg_snippet": "To mitigate these issues, test-time alignment (Khanov et al ., 2024 ; Li et al ., 2024a ; Qiu et al ., 2024 ) has emerged as a training-free ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2508.15044v1", "content": "To mitigate these issues, test-time alignment (Khanov et al ., 2024 ; Li et al ., 2024a ; Qiu et al ., 2024 ) has emerged as a training-free ..."}
+{"idx": 3, "title": "A1: Asynchronous Test-Time Scaling via Conformal Prediction", "date": "", "ddg_snippet": "Speculative decoding (Li et al ., 2024a ; Leviathan et al ., 2023 ; Kim et al ., 2023 ; Pan et al ., 2025b ; Yang et al ., 2025 ) represents a ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2509.15148v1", "content": "Speculative decoding (Li et al ., 2024a ; Leviathan et al ., 2023 ; Kim et al ., 2023 ; Pan et al ., 2025b ; Yang et al ., 2025 ) represents a ..."}
+{"idx": 4, "title": "Alignment-Augmented Speculative Decoding with Alignment", "date": "", "ddg_snippet": "Approaches such as EAGLE (Li et al ., 2024 ) strengthen the alignment between the draft and target models through alignment training, causing ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2505.13204v2", "content": "Approaches such as EAGLE (Li et al ., 2024 ) strengthen the alignment between the draft and target models through alignment training, causing ..."}
+{"idx": 5, "title": "COLING 2025 Tutorial: Speculative Decoding for Efficient LLM", "date": "", "ddg_snippet": "Medusa : Simple LLM Inference Acceleration Framework with Multiple Decoding Heads ( Cai et al ., 2023) ... Speculative Decoding (Sun et al ., 2024 ...", "subpage_snippet": "", "source": "speculative-decoding.github.io", "link": "https://speculative-decoding.github.io/", "content": "Medusa : Simple LLM Inference Acceleration Framework with Multiple Decoding Heads ( Cai et al ., 2023) ... Speculative Decoding (Sun et al ., 2024 ..."}
+{"idx": 6, "title": "transcript", "date": "", "ddg_snippet": "Medusa ’ s authors note it “generate[ s ] consistent responses with the same distribution as the original model,” but “cannot further enhance ...", "subpage_snippet": "", "source": "notes.aarnphm.xyz", "link": "https://notes.aarnphm.xyz/lectures/41/notes", "content": "Medusa ’ s authors note it “generate[ s ] consistent responses with the same distribution as the original model,” but “cannot further enhance ..."}
+{"idx": 7, "title": "Most Influential ArXiv (Machine Learning) Papers (2025-03", "date": "", "ddg_snippet": "Medusa : Simple LLM Inference Acceleration Framework with Multiple Decoding Heads IF:4 Related Papers Related Patents Related Grants Related Venues ...", "subpage_snippet": "", "source": "resources.paperdigest.org", "link": "https://resources.paperdigest.org/2025/03/most-influential-arxiv-machine-learning-papers-2025-03-version/", "content": "Medusa : Simple LLM Inference Acceleration Framework with Multiple Decoding Heads IF:4 Related Papers Related Patents Related Grants Related Venues ..."}
+{"idx": 8, "title": "Pre-Training Curriculum for Multi-Token Prediction in Language", "date": "", "ddg_snippet": "So far, the previous work prioritized mid- and large-sized models with at least 7B parameters, since Gloeckle et al .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2505.22757v1", "content": "So far, the previous work prioritized mid- and large-sized models with at least 7B parameters, since Gloeckle et al ."}
+{"idx": 9, "title": "SpeLLM: Input Tokens, Output Chars", "date": "", "ddg_snippet": "However, it also raises the costs of generating each token, as the vocabulary embedding table is used both for projecting the output token at the ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2507.16323v1", "content": "However, it also raises the costs of generating each token, as the vocabulary embedding table is used both for projecting the output token at the ..."}

data/sampled_jsons/Near-Optimal_Online_Learning_for_Multi-Agent_Submodular_Coordination_Section_5_adversarial_target_be_year_2023.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Udemy Online Classes - A Leading Learning Destination Ad Viewing ads is privacy protected by DuckDuckGo. Ad clicks are managed by Microsoft's ad network ( more info ).", "date": "", "ddg_snippet": "Study any topic when it suits you. Explore thousands of high-quality courses. Join millions of learners from around the world already learning on Udemy.", "subpage_snippet": "", "source": "duckduckgo.com", "link": "https://duckduckgo.com/y.js?ad_domain=udemy.com&ad_provider=bingv7aa&ad_type=txad&click_metadata=UCPIy_GUbb855RBojMOGC-uDwNBAeG4GMIHfk2L4sl85Cx5p1fXo8HKb_3P5jauZ3-pJUYwqf3qo8ONl7Ogkdb193JPW1at226vc86WzeCb9Dalo8Gzjtv5NyE3uFNoI.rUoH_nWwp_ThukOuUG_O-w&rut=c877445c8dd9084fc6f0ada3e6f289556cbf2ec0041983d1dab57b709e72807b&u3=https://www.bing.com/aclick?ld=e8iAo_DWTNRT-9FuJoZ1BJ4DVUCUxNFBD0Hi3az7bYOCR9sINrU2ZvFWHS-2tlfQ46G4FlJqXRcechjg3bS4EjJm62sfPanrh3f7g_kDdL1rfn12QdP-EBMoBSzQErZILVtO1fIQBp1yJReVJLRlaksrWAEqEr5jri8u4cqj6zqXc1ik-h36HIAkRAcRwj9dmp3Xxo2A&u=aHR0cHMlM2ElMmYlMmZ3d3cudWRlbXkuY29tJTJmJTNmdXRtX3NvdXJjZSUzZGJpbmclMjZ1dG1fbWVkaXVtJTNkdWRlbXlhZHMlMjZ1dG1fY2FtcGFpZ24lM2RCRy1TZWFyY2hfS2V5d29yZF9HYW1tYV9Ob25QX2xhLkVOX2NjLlJPVy1FbmdsaXNoJTI2Y2FtcGFpZ250eXBlJTNkU2VhcmNoJTI2cG9ydGZvbGlvJTNkQmluZy1ST1ctRW5nbGlzaCUyNmxhbmd1YWdlJTNkRU4lMjZwcm9kdWN0JTNkQ291cnNlJTI2dGVzdCUzZCUyNmF1ZGllbmNlJTNkS2V5d29yZCUyNnRvcGljJTNkJTI2cHJpb3JpdHklM2RHYW1tYSUyNnV0bV9jb250ZW50JTNkZGVhbDQ1ODQlMjZ1dG1fdGVybSUzZF8uX2FnXzEzMjYwMTM0MTE2NzgzMzJfLl9hZF9fLl9rd19vbmxpbmUlMjUyMGNvdXJjZXNfLl9kZV9jXy5fZG1fXy5fcGxfXy5fdGlfa3dkLTgyODc2OTY5MDA1Nzg2JTNhbG9jLTE2NF8uX2xpXzE2NF8uX3BkX18uXyUyNm1hdGNodHlwZSUzZHAlMjZtc2Nsa2lkJTNkODc2OTc0YTgzMjQ0MWMwNzM5MGUxYzdhYWYyNzNlMjE&rlid=876974a832441c07390e1c7aaf273e21&vqd=4-29136137857996143131188833869597288217&iurl={1}IG=86D1EFE663B74D35B8DE312F7109216E&CID=0A565CB0084D62233D344AC0092863EF&ID=DevEx,5035.1", "content": "Study any topic when it suits you. Explore thousands of high-quality courses. Join millions of learners from around the world already learning on Udemy."}
+{"idx": 1, "title": "(PDF) Near - Optimal Online Learning for Multi - Agent Submodular ...", "date": "", "ddg_snippet": "Near - optimal online learning for multi -. Agent submodular coordination : tight ap-. Proximation and communication efficiency.vehicles (UAVs), for multi - target tracking (Zhou et al.,2018;Corah & Michael,2021) as depicted.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/388847678_Near-Optimal_Online_Learning_for_Multi-Agent_Submodular_Coordination_Tight_Approximation_and_Communication_Efficiency", "content": "Near - optimal online learning for multi -. Agent submodular coordination : tight ap-. Proximation and communication efficiency.vehicles (UAVs), for multi - target tracking (Zhou et al.,2018;Corah & Michael,2021) as depicted."}
+{"idx": 2, "title": "Near-Optimal Online Learning for Multi-Agent Submodular ...", "date": "", "ddg_snippet": "7 Feb 2025 — Near-Optimal Online Learning for Multi-Agent Submodular Coordination ... Adversarial' target escapes at a speed of 15 units/s for one ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2502.05028v1", "content": "7 Feb 2025 — Near-Optimal Online Learning for Multi-Agent Submodular Coordination ... Adversarial' target escapes at a speed of 15 units/s for one ..."}
+{"idx": 3, "title": "Performance-Aware Self-Configurable Multi-Agent Networks: A", "date": "", "ddg_snippet": "In the future, distributed teams of agents will be coordinating via agent -to- agent communication to execute tasks such as target tracking [ 1 ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2409.01411v1", "content": "In the future, distributed teams of agents will be coordinating via agent -to- agent communication to execute tasks such as target tracking [ 1 ..."}
+{"idx": 4, "title": "Inverse Submodular Maximization with Application to", "date": "", "ddg_snippet": "We consider a new type of inverse combinatorial optimization, Inverse Submodular Maximization (ISM), for human-in-the-loop multi -robot coordination .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2403.10991v1", "content": "We consider a new type of inverse combinatorial optimization, Inverse Submodular Maximization (ISM), for human-in-the-loop multi -robot coordination ."}
+{"idx": 5, "title": "Diffusion Models for Influence Maximization on Temporal", "date": "", "ddg_snippet": "... for diverse applications, including enhancing public health outreach, mitigating the spread of harmful rumors, and optimizing marketing campaigns.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2507.22589v1", "content": "... for diverse applications, including enhancing public health outreach, mitigating the spread of harmful rumors, and optimizing marketing campaigns."}
+{"idx": 6, "title": "N ear -o ptimal", "date": "", "ddg_snippet": "Near - optimal online learning for multi - agent submodular coordination : tight ap-proximation and communication efficiency. Definition 1. For a set function f : 2 V → R+, we define its multi-linear extension as.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=i8dYPGdB1C", "content": "Near - optimal online learning for multi - agent submodular coordination : tight ap-proximation and communication efficiency. Definition 1. For a set function f : 2 V → R+, we define its multi-linear extension as."}
+{"idx": 7, "title": "Combatting Dimensional Collapse in LLM Pre-Training Data via", "date": "", "ddg_snippet": "... analyze its approximation to the optimal solution under the formulation of γ 𝛾 \\gamma italic_γ -weakly submodular optimization problem ( Section ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2504.20644v1", "content": "... analyze its approximation to the optimal solution under the formulation of γ 𝛾 \\gamma italic_γ -weakly submodular optimization problem ( Section ..."}
+{"idx": 8, "title": "Efficiency of Coordinate Descent Methods on Huge-Scale", "date": "", "ddg_snippet": "Tseng, On the convergence of the coordinate descent method for convex differentiable minimization, J. ... Nesterov, A method for unconstrained convex ...", "subpage_snippet": "", "source": "epubs.siam.org", "link": "https://epubs.siam.org/doi/abs/10.1137/100802001?cookieSet=1", "content": "Tseng, On the convergence of the coordinate descent method for convex differentiable minimization, J. ... Nesterov, A method for unconstrained convex ..."}
+{"idx": 9, "title": "Efficiency of Coordinate Descent Methods on Huge-Scale", "date": "", "ddg_snippet": "Tseng, On the convergence of the coordinate descent method for convex differentiable minimization, J. ... Nesterov, A method for unconstrained convex ...", "subpage_snippet": "", "source": "epubs.siam.org", "link": "https://epubs.siam.org/doi/abs/10.1137/100802001", "content": "Tseng, On the convergence of the coordinate descent method for convex differentiable minimization, J. ... Nesterov, A method for unconstrained convex ..."}

data/sampled_jsons/OmniBench_paper_Section_5.1_experimental_setup_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "What Limits Virtual Agent Application? OmniBench: A Scalable Multi ...", "date": "", "ddg_snippet": "In this section , we first introduce the experimental setup ( Sec-tion 5.1 ). Then, we comprehensively compare the differences in capabilities across various models on OmniBench , along with several key findings ( Section 5.2).", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2506.08933", "content": "In this section , we first introduce the experimental setup ( Sec-tion 5.1 ). Then, we comprehensively compare the differences in capabilities across various models on OmniBench , along with several key findings ( Section 5.2)."}
+{"idx": 1, "title": "OmniBench", "date": "", "ddg_snippet": "OmniBench spans five fundamental types of task complexity to construct 10 evaluation dimensions (see the main figure). Test tasks across these dimensions are categorized based on combinations of complexity types. For example, a long-range planning test task typically exhibits higher dependency complexity and hierarchical complexity.", "subpage_snippet": "", "source": "omni-bench.github.io", "link": "https://omni-bench.github.io/", "content": "OmniBench spans five fundamental types of task complexity to construct 10 evaluation dimensions (see the main figure). Test tasks across these dimensions are categorized based on combinations of complexity types. For example, a long-range planning test task typically exhibits higher dependency complexity and hierarchical complexity."}
+{"idx": 2, "title": "OmniBench: Towards The Future of Universal Omni-Language Models", "date": "", "ddg_snippet": "These results underscore the importance of OmniBench as a tool for identifying areas of improvement and guiding research in multimodal systems. In the following sections , we detail the data collection protocol of OmniBench , present our evaluation results on current state-of-the-art MLLMs, and discuss the implications of our findings for the future of research and development. Through OmniBench ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2409.15272v1", "content": "These results underscore the importance of OmniBench as a tool for identifying areas of improvement and guiding research in multimodal systems. In the following sections , we detail the data collection protocol of OmniBench , present our evaluation results on current state-of-the-art MLLMs, and discuss the implications of our findings for the future of research and development. Through OmniBench ..."}
+{"idx": 3, "title": "OmniBench: Towards The Future of Universal Omni-Language Models", "date": "", "ddg_snippet": "Recent advancements in multimodal large language models (MLLMs) have focused on integrating multiple modalities, yet their ability to simultaneously process and reason across different inputs remains underexplored. We introduce OmniBench , a novel benchmark designed to evaluate models' ability to recognize, interpret, and reason across visual, acoustic, and textual inputs simultaneously. We ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2409.15272", "content": "Recent advancements in multimodal large language models (MLLMs) have focused on integrating multiple modalities, yet their ability to simultaneously process and reason across different inputs remains underexplored. We introduce OmniBench , a novel benchmark designed to evaluate models' ability to recognize, interpret, and reason across visual, acoustic, and textual inputs simultaneously. We ..."}
+{"idx": 4, "title": "PDF 7 Detailed Experimental Setup", "date": "", "ddg_snippet": "This document provides additional details, analysis, and experimental results. We begin by discussing the detailed experimental setup and implementation of the methods in Section 7. Then, we provide additional empirical experiments in Section 8. Finally, we discuss the limitation of our work in Section 9.", "subpage_snippet": "", "source": "papers.nips.cc", "link": "https://papers.nips.cc/paper_files/paper/2022/file/fa0126bb7ebad258bf4ffdbbac2dd787-Supplemental-Conference.pdf", "content": "This document provides additional details, analysis, and experimental results. We begin by discussing the detailed experimental setup and implementation of the methods in Section 7. Then, we provide additional empirical experiments in Section 8. Finally, we discuss the limitation of our work in Section 9."}
+{"idx": 5, "title": "OmniBench: Towards The Future of Universal Omni-Language Models", "date": "", "ddg_snippet": "This paper introduces OmniBench , a crucial step towards developing truly multimodal AI. By rigorously evaluating models on their ability to integrate visual, acoustic, and textual information, OmniBench exposes critical limitations in current approaches and highlights the need for dedicated research in tri-modal reasoning.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2409.15272v4", "content": "This paper introduces OmniBench , a crucial step towards developing truly multimodal AI. By rigorously evaluating models on their ability to integrate visual, acoustic, and textual information, OmniBench exposes critical limitations in current approaches and highlights the need for dedicated research in tri-modal reasoning."}
+{"idx": 6, "title": "OmniR: Evaluating Omni-modality Language Models on Reasoning across ...", "date": "", "ddg_snippet": "Video/Audio/Image Evaluation benchmarks. Omnibench specifically aimed at evaluating OLMs' tri-modal, i.e., text, vision, and audio, processing capabilities with human-annotated tasks. Compared to it, OmnixR emphasizes the omni-modality reasoning evaluations with both human-annotated realistic set and scalable synthetic set.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2410.12219", "content": "Video/Audio/Image Evaluation benchmarks. Omnibench specifically aimed at evaluating OLMs' tri-modal, i.e., text, vision, and audio, processing capabilities with human-annotated tasks. Compared to it, OmnixR emphasizes the omni-modality reasoning evaluations with both human-annotated realistic set and scalable synthetic set."}
+{"idx": 7, "title": "GitHub - opendatalab/OmniDocBench: [CVPR 2025] A Comprehensive ...", "date": "", "ddg_snippet": "OmniDocBench is a benchmark for evaluating diverse document parsing in real-world scenarios, featuring the following characteristics: Diverse Document Types: This benchmark includes 981 PDF pages, covering 9 document types, 4 layout types, and 3 language types. It encompasses a wide range of content, including academic papers , financial reports, newspapers, textbooks, and handwritten notes ...", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/opendatalab/OmniDocBench", "content": "OmniDocBench is a benchmark for evaluating diverse document parsing in real-world scenarios, featuring the following characteristics: Diverse Document Types: This benchmark includes 981 PDF pages, covering 9 document types, 4 layout types, and 3 language types. It encompasses a wide range of content, including academic papers , financial reports, newspapers, textbooks, and handwritten notes ..."}
+{"idx": 8, "title": "(PDF) Baichuan-Omni Technical Report - ResearchGate", "date": "", "ddg_snippet": "In this paper , we introduce Baichuan-Omni, the first open-source 7B Multimodal Large Language Model (MLLM) adept at concurrently processing and analyzing modalities of image, video, audio, and ...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/384887170_Baichuan-Omni_Technical_Report", "content": "In this paper , we introduce Baichuan-Omni, the first open-source 7B Multimodal Large Language Model (MLLM) adept at concurrently processing and analyzing modalities of image, video, audio, and ..."}
+{"idx": 9, "title": "PDF O R: E OMNI MODALITY LANGUAGE M REASONING ACROSS MODALITIES - OpenReview", "date": "", "ddg_snippet": "ABSTRACT We introduce Omni×R, an evaluation suite designed to benchmark state-of-the-art Omni-modality Language Models (OLMs), such as GPT-4o and Gemini. Eval-uating OLMs, which integrate multiple modalities such as text, vision, and audio, presents unique challenges. Particularly, the user message might often consist of multiple modalities, such that OLMs have to establish holistic ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf/a8f5792b167b7d40c9acb6a680d0c8c51c2d13a0.pdf", "content": "ABSTRACT We introduce Omni×R, an evaluation suite designed to benchmark state-of-the-art Omni-modality Language Models (OLMs), such as GPT-4o and Gemini. Eval-uating OLMs, which integrate multiple modalities such as text, vision, and audio, presents unique challenges. Particularly, the user message might often consist of multiple modalities, such that OLMs have to establish holistic ..."}

data/sampled_jsons/On_a_Connection_Between_Imitation_Learning_and_RLHF_LSIF.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "On a Connection Between Imitation Learning and RLHF", "date": "", "ddg_snippet": "This work studies the alignment of large language models with preference data from an imitation learning perspective. We establish a close theoretical connection between reinforcement learning from human feedback RLHF and imitation learning (IL), revealing that RLHF implicitly performs imitation learning on the preference data distribution. Building on this connection , we propose DIL, a ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2503.05079", "content": "This work studies the alignment of large language models with preference data from an imitation learning perspective. We establish a close theoretical connection between reinforcement learning from human feedback RLHF and imitation learning (IL), revealing that RLHF implicitly performs imitation learning on the preference data distribution. Building on this connection , we propose DIL, a ..."}
+{"idx": 1, "title": "Connection Between Imitation Learning and RLHF | Cong's Log", "date": "", "ddg_snippet": "The paper, Xiao, Teng, et al. On a Connection Between Imitation Learning and RLHF . arXiv:2503.05079 1 also expresses that DPO is a form of imitation learning .", "subpage_snippet": "", "source": "congchan.github.io", "link": "https://congchan.github.io/posts/connection-between-imitation-learning-and-rlhf/", "content": "The paper, Xiao, Teng, et al. On a Connection Between Imitation Learning and RLHF . arXiv:2503.05079 1 also expresses that DPO is a form of imitation learning ."}
+{"idx": 2, "title": "On a Connection Between Imitation Learningand RLHF", "date": "", "ddg_snippet": "RLHF Step 2: Reinforcement Learning Reinforcement learning objective: KL-regularized reward maximization Reward model KL regularization (proxy human preference) (closed to reference model) Complexity and poor stability due to the high variance in optimization", "subpage_snippet": "", "source": "aitime-lundao.oss-cn-beijing.aliyuncs.com", "link": "https://aitime-lundao.oss-cn-beijing.aliyuncs.com/AitimeReport/20250312/1741781794566", "content": "RLHF Step 2: Reinforcement Learning Reinforcement learning objective: KL-regularized reward maximization Reward model KL regularization (proxy human preference) (closed to reference model) Complexity and poor stability due to the high variance in optimization"}
+{"idx": 3, "title": "On a Connection Between Imitation Learning and RLHF | AI Research Paper ...", "date": "", "ddg_snippet": "This paper makes a significant contribution by establishing a formal connection between imitation learning and RLHF , offering a simpler alternative for aligning language models with human preferences. The ILHF approach demonstrates that we can achieve results comparable to RLHF through careful selection and imitation of high-quality examples.", "subpage_snippet": "", "source": "www.aimodels.fyi", "link": "https://www.aimodels.fyi/papers/arxiv/connection-between-imitation-learning-rlhf", "content": "This paper makes a significant contribution by establishing a formal connection between imitation learning and RLHF , offering a simpler alternative for aligning language models with human preferences. The ILHF approach demonstrates that we can achieve results comparable to RLHF through careful selection and imitation of high-quality examples."}
+{"idx": 4, "title": "PDF On a Connection Between Imitation Learning and Rlhf", "date": "", "ddg_snippet": "This work studies the alignment of large language models with preference data from an imitation learning perspective. We establish a close theoretical connection be-tween reinforcement learning from human feedback ( RLHF ) and imitation learning (IL), revealing that RLHF implicitly performs imitation learning on the preference data distribution.", "subpage_snippet": "", "source": "proceedings.iclr.cc", "link": "https://proceedings.iclr.cc/paper_files/paper/2025/file/acf4a08f67724e9d2de34099f57a9c25-Paper-Conference.pdf", "content": "This work studies the alignment of large language models with preference data from an imitation learning perspective. We establish a close theoretical connection be-tween reinforcement learning from human feedback ( RLHF ) and imitation learning (IL), revealing that RLHF implicitly performs imitation learning on the preference data distribution."}
+{"idx": 5, "title": "On a Connection Between Imitation Learning and RLHF | alphaXiv", "date": "", "ddg_snippet": "View recent discussion. Abstract: This work studies the alignment of large language models with preference data from an imitation learning perspective. We establish a close theoretical connection between reinforcement learning from human feedback RLHF and imitation learning (IL), revealing that RLHF implicitly performs imitation learning on the preference data distribution. Building on this ...", "subpage_snippet": "", "source": "www.alphaxiv.org", "link": "https://www.alphaxiv.org/overview/2503.05079v1", "content": "View recent discussion. Abstract: This work studies the alignment of large language models with preference data from an imitation learning perspective. We establish a close theoretical connection between reinforcement learning from human feedback RLHF and imitation learning (IL), revealing that RLHF implicitly performs imitation learning on the preference data distribution. Building on this ..."}
+{"idx": 6, "title": "dblp: On a Connection Between Imitation Learning and RLHF.", "date": "", "ddg_snippet": "Bibliographic details on On a Connection Between Imitation Learning and RLHF .", "subpage_snippet": "", "source": "dblp.org", "link": "https://dblp.org/rec/conf/iclr/XiaoYLCH25", "content": "Bibliographic details on On a Connection Between Imitation Learning and RLHF ."}
+{"idx": 7, "title": "On a Connection Between Imitation Learning and RLHF", "date": "", "ddg_snippet": "DIL is proposed, a principled framework that directly optimizes the imitation learning objective and provides a unified imitation learning perspective on alignment, encompassing existing alignment algorithms as special cases while naturally introducing new variants. This work studies the alignment of large language models with preference data from an imitation learning perspective. We ...", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/On-a-Connection-Between-Imitation-Learning-and-RLHF-Xiao-Yuan/9b4ecc297389ca6753817ce3d3dfb3057c34ae76", "content": "DIL is proposed, a principled framework that directly optimizes the imitation learning objective and provides a unified imitation learning perspective on alignment, encompassing existing alignment algorithms as special cases while naturally introducing new variants. This work studies the alignment of large language models with preference data from an imitation learning perspective. We ..."}
+{"idx": 8, "title": "PDF Lecture 8: Imitation Learning and RLHF - web.stanford.edu", "date": "", "ddg_snippet": "Imitation Learning Summary Imitation learning can greatly reduce the amount of data need to learn a good policy Challenges remain and one exciting area is combining inverse RL / learning from demonstration and online reinforcement learning For a look into some of the theory between imitation learning and RL, see Sun, Venkatraman, Gordon, Boots, Bagnell (ICML 2017)", "subpage_snippet": "", "source": "web.stanford.edu", "link": "https://web.stanford.edu/class/cs234/CS234Spr2024/slides/lecture8post.pdf", "content": "Imitation Learning Summary Imitation learning can greatly reduce the amount of data need to learn a good policy Challenges remain and one exciting area is combining inverse RL / learning from demonstration and online reinforcement learning For a look into some of the theory between imitation learning and RL, see Sun, Venkatraman, Gordon, Boots, Bagnell (ICML 2017)"}
+{"idx": 9, "title": "On a Connection Between Imitation Learning and RLHF", "date": "", "ddg_snippet": "This work studies the alignment of large language models with preference data from an imitation learning perspective. We establish a close theoretical connection between reinforcement learning from human feedback ( RLHF ) and imitation learning (IL), revealing that RLHF implicitly performs imitation learning on the preference data distribution.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2503.05079v1", "content": "This work studies the alignment of large language models with preference data from an imitation learning perspective. We establish a close theoretical connection between reinforcement learning from human feedback ( RLHF ) and imitation learning (IL), revealing that RLHF implicitly performs imitation learning on the preference data distribution."}

data/sampled_jsons/Origin_Identification_Text-Guided_Image-to-Image_Diffusion_Models_Section_G_IP-Adapter_CLIP.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Origin Identification for Text-Guided Image-to-Image Diffusion Models", "date": "", "ddg_snippet": "Text-guided image-to-image diffusion models excel in translating images based on textual prompts, allowing for precise and creative visual modifications. However, such a powerful technique can be misused for spreading misinformation, infringing on copyrights, and evading content tracing.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2501.02376", "content": "Text-guided image-to-image diffusion models excel in translating images based on textual prompts, allowing for precise and creative visual modifications. However, such a powerful technique can be misused for spreading misinformation, infringing on copyrights, and evading content tracing."}
+{"idx": 1, "title": "[ICML 2025] The official implementation of \"Origin Identification for ...", "date": "", "ddg_snippet": "ID2 [ICML 2025] The official implementation of \" Origin Identification for Text-Guided Image-to-Image Diffusion Models \".", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/WangWenhao0716/ID2", "content": "ID2 [ICML 2025] The official implementation of \" Origin Identification for Text-Guided Image-to-Image Diffusion Models \"."}
+{"idx": 2, "title": "Origin Identification for Text-Guided Image-to-Image Diffusion Models", "date": "", "ddg_snippet": "This motivates us to introduce the task of ori - gin IDentification for text-guided Image-to-image Diffusion models (ID2), aiming to retrieve the original image of a given translated query. A straightforward solution to ID2involves training a specialized deep embedding model to extract and compare features from both query and refer- ence images .", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=46n3izUNiv", "content": "This motivates us to introduce the task of ori - gin IDentification for text-guided Image-to-image Diffusion models (ID2), aiming to retrieve the original image of a given translated query. A straightforward solution to ID2involves training a specialized deep embedding model to extract and compare features from both query and refer- ence images ."}
+{"idx": 3, "title": "PDF Detecting Origin Attribution for Text-to-Image Diffusion Models", "date": "", "ddg_snippet": "Abstract Modern text - to - image (T2I) diffusion models can gener-ate images with remarkable realism and creativity. These advancements have sparked research in fake image detec-tion and attribution, yet prior studies have not fully explored the practical and scientific dimensions of this task. In addi-tion to attributing images to 12 state-of-the-art T2I genera-tors, we provide extensive ...", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/WACV2025/papers/Xu_Detecting_Origin_Attribution_for_Text-to-Image_Diffusion_Models_WACV_2025_paper.pdf", "content": "Abstract Modern text - to - image (T2I) diffusion models can gener-ate images with remarkable realism and creativity. These advancements have sparked research in fake image detec-tion and attribution, yet prior studies have not fully explored the practical and scientific dimensions of this task. In addi-tion to attributing images to 12 state-of-the-art T2I genera-tors, we provide extensive ..."}
+{"idx": 4, "title": "Generalizable Origin Identification for Text-Guided Image-to-Image ...", "date": "", "ddg_snippet": "This motivates us to introduce the task of origin IDentification for text-guided Image-to-image Diffusion models (ID^2), aiming to retrieve the original image of a given translated query. A straightforward solution to ID^2 involves training a specialized deep embedding model to extract and compare features from both query and reference images .", "subpage_snippet": "", "source": "huggingface.co", "link": "https://huggingface.co/papers/2501.02376", "content": "This motivates us to introduce the task of origin IDentification for text-guided Image-to-image Diffusion models (ID^2), aiming to retrieve the original image of a given translated query. A straightforward solution to ID^2 involves training a specialized deep embedding model to extract and compare features from both query and reference images ."}
+{"idx": 5, "title": "Detecting Origin Attribution for Text-to-Image Diffusion Models", "date": "", "ddg_snippet": "Modern text - to - image (T2I) diffusion models can generate images with remarkable realism and creativity. These advancements have sparked research in fake image detection and attribution, yet prior studies have not fully explored the practical and scientific dimensions of this task. In addition to attributing images to 12 state-of-the-art T2I generators, we provide extensive analyses on what ...", "subpage_snippet": "", "source": "ieeexplore.ieee.org", "link": "https://ieeexplore.ieee.org/abstract/document/10944006", "content": "Modern text - to - image (T2I) diffusion models can generate images with remarkable realism and creativity. These advancements have sparked research in fake image detection and attribution, yet prior studies have not fully explored the practical and scientific dimensions of this task. In addition to attributing images to 12 state-of-the-art T2I generators, we provide extensive analyses on what ..."}
+{"idx": 6, "title": "Generalizable Origin Identification for Text-Guided Image-to-Image ...", "date": "", "ddg_snippet": "This motivates us to introduce the task of origin IDentification for text-guided Image-to-image Diffusion models (ID 2 ^2), aiming to retrieve the original image of a given translated query.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/387767437_Generalizable_Origin_Identification_for_Text-Guided_Image-to-Image_Diffusion_Models", "content": "This motivates us to introduce the task of origin IDentification for text-guided Image-to-image Diffusion models (ID 2 ^2), aiming to retrieve the original image of a given translated query."}
+{"idx": 7, "title": "Origin Identification for Text-Guided Image-to-Image Diffusion Models", "date": "", "ddg_snippet": "Text-guided image-to-image diffusion models ex- cel in translating images based on textual prompts, allowing for precise and creative visual modifica- tions. However, such a powerful technique can be misused for spreading misinformation, infring- ing on copyrights, and evading content tracing. This motivates us to introduce the task of ori - gin IDentification for text-guidedImage-to-image ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2501.02376", "content": "Text-guided image-to-image diffusion models ex- cel in translating images based on textual prompts, allowing for precise and creative visual modifica- tions. However, such a powerful technique can be misused for spreading misinformation, infring- ing on copyrights, and evading content tracing. This motivates us to introduce the task of ori - gin IDentification for text-guidedImage-to-image ..."}
+{"idx": 8, "title": "ICML Poster Origin Identification for Text-Guided Image-to-Image ...", "date": "", "ddg_snippet": "Abstract: Text-guided image-to-image diffusion models excel in translating images based on textual prompts, allowing for precise and creative visual modifications. However, such a powerful technique can be misused for *spreading misinformation*, *infringing on copyrights*, and *evading content tracing*.", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/46505", "content": "Abstract: Text-guided image-to-image diffusion models excel in translating images based on textual prompts, allowing for precise and creative visual modifications. However, such a powerful technique can be misused for *spreading misinformation*, *infringing on copyrights*, and *evading content tracing*."}
+{"idx": 9, "title": "Generalizable Origin Identification for Text-Guided Image-to-Image ...", "date": "", "ddg_snippet": "Text-guided image-to-image diffusion models excel in translating images based on textual prompts, allowing for precise and creative visual modifications. However, such a powerful technique can be misused for *spreading misinformation*, *infringing on copyrights*, and *evading content tracing*.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=daRu82GAoZ", "content": "Text-guided image-to-image diffusion models excel in translating images based on textual prompts, allowing for precise and creative visual modifications. However, such a powerful technique can be misused for *spreading misinformation*, *infringing on copyrights*, and *evading content tracing*."}

data/sampled_jsons/PS-EIP_EventPS_MAE_13.66_degrees_conclusion_section_8.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Международно-правовой статус Государства Палестина...", "date": "", "ddg_snippet": "При этом 13 сентября 1993 года в результате Соглашений «Осло» между Израилем и Организацией освобождения Палестины (ООП) была подписана Декларация о создании Временной Палестинской самоуправляемой администрации (ПНА).", "subpage_snippet": "", "source": "ru.wikipedia.org", "link": "https://ru.wikipedia.org/wiki/Международно-правовой_статус_Государства_Палестина", "content": "При этом 13 сентября 1993 года в результате Соглашений «Осло» между Израилем и Организацией освобождения Палестины (ООП) была подписана Декларация о создании Временной Палестинской самоуправляемой администрации (ПНА)."}
+{"idx": 1, "title": "PS - EIP : Robust Photometric Stereo Based on Event Interval Profile", "date": "", "ddg_snippet": "8 . Conclusion . This paper presents EIP - PS , a robust event -based photomet-ric stereo method. The average MAEs for all 3D-printed objects was 8 .12 for EIP - PS , in contract to EventPS , which resulted in 13 . 66 .", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/papers/Kitazawa_PS-EIP_Robust_Photometric_Stereo_Based_on_Event_Interval_Profile_CVPR_2025_paper.pdf", "content": "8 . Conclusion . This paper presents EIP - PS , a robust event -based photomet-ric stereo method. The average MAEs for all 3D-printed objects was 8 .12 for EIP - PS , in contract to EventPS , which resulted in 13 . 66 ."}
+{"idx": 2, "title": "Procedure of the proposed method: Events are recorded under moving...", "date": "", "ddg_snippet": "PS - EIP : Robust Photometric Stereo Based on Event Interval Profile.1. Unlike EventPS , which treats each event interval independently, our approach considers a time-series profile formed by event intervals, taking into account the relationships between adjacent intervals.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/figure/Procedure-of-the-proposed-method-Events-are-recorded-under-moving-light-conditions-The_fig1_390142307", "content": "PS - EIP : Robust Photometric Stereo Based on Event Interval Profile.1. Unlike EventPS , which treats each event interval independently, our approach considers a time-series profile formed by event intervals, taking into account the relationships between adjacent intervals."}
+{"idx": 3, "title": "ГДЗ по английскому языку 6 класс (spotlight) Ваулина - рабочая...", "date": "", "ddg_snippet": "Pairwork activities 65. Student A 65 Student B 71. Revision Section 77.", "subpage_snippet": "", "source": "gdz.top", "link": "https://gdz.top/6-klass/english/vaulina-spotlight-rabochaja-tetrad", "content": "Pairwork activities 65. Student A 65 Student B 71. Revision Section 77."}
+{"idx": 4, "title": "Celsius (°C) Conversion Calculator - Inch Calculator", "date": "", "ddg_snippet": "Convert degrees Celsius (°C) to another temperature scale such as fahrenheit, kelvins, or rankine. Learn the formulas for Celsius temp conversions.", "subpage_snippet": "", "source": "www.inchcalculator.com", "link": "https://www.inchcalculator.com/convert/from-celsius/", "content": "Convert degrees Celsius (°C) to another temperature scale such as fahrenheit, kelvins, or rankine. Learn the formulas for Celsius temp conversions."}
+{"idx": 5, "title": "Login | Figma", "date": "", "ddg_snippet": "Create the section heading, paragraph text, and quote block Sign in to view 4m.", "subpage_snippet": "", "source": "www.figma.com", "link": "https://www.figma.com/login", "content": "Create the section heading, paragraph text, and quote block Sign in to view 4m."}
+{"idx": 6, "title": "ESET NOD32 | Свежие Ключи 2025 | Бесплатно | СТЕНА – Telegram", "date": "", "ddg_snippet": "ESET HOME Security Premium | До 15-10-2025 1 | WSFE-XDJT-DAAE-BBSS-MK3K 2 | M5KH-X7 PS -WVWD-4VKF-MHJ 8 3 | HC5B-XH5N-XADK-KXEG-G7GM 4 | FEP6-XPVU-PWSW-N 8 SK-9BM9 5 | 5SUB-X634-SNVV-HABP-4TXS 6 |. 73JE-XPFG-P 8 CM-AE7W-WGNF 7...", "subpage_snippet": "", "source": "t.me", "link": "https://t.me/s/eset_nod32_free", "content": "ESET HOME Security Premium | До 15-10-2025 1 | WSFE-XDJT-DAAE-BBSS-MK3K 2 | M5KH-X7 PS -WVWD-4VKF-MHJ 8 3 | HC5B-XH5N-XADK-KXEG-G7GM 4 | FEP6-XPVU-PWSW-N 8 SK-9BM9 5 | 5SUB-X634-SNVV-HABP-4TXS 6 |. 73JE-XPFG-P 8 CM-AE7W-WGNF 7..."}
+{"idx": 7, "title": "Получить описание изображения онлайн", "date": "", "ddg_snippet": "Опишем ваше фото с помощью нейросети. Сгенерируем текстовое опис��ние к изображению.", "subpage_snippet": "", "source": "facee.ru", "link": "https://facee.ru/describe-image/", "content": "Опишем ваше фото с помощью нейросети. Сгенерируем текстовое описание к изображению."}
+{"idx": 8, "title": "Notices to Mariners - Weekly", "date": "", "ddg_snippet": "Radio Navigation Warnings. Sign in. Notices to Mariners. Value Added Resellers. About.", "subpage_snippet": "", "source": "msi.admiralty.co.uk", "link": "https://msi.admiralty.co.uk/NoticesToMariners/Weekly", "content": "Radio Navigation Warnings. Sign in. Notices to Mariners. Value Added Resellers. About."}
+{"idx": 9, "title": "Циан - база недвижимости в Ленинградской области | Продажа...", "date": "", "ddg_snippet": "от 13 848 445 ₽. Комендантский проспект. 8 мин. ЖК Морская миля.20-я Васильевского острова линия, 13Б.", "subpage_snippet": "", "source": "spb.cian.ru", "link": "https://spb.cian.ru/", "content": "от 13 848 445 ₽. Комендантский проспект. 8 мин. ЖК Морская миля.20-я Васильевского острова линия, 13Б."}

data/sampled_jsons/Parallel_Simulation_for_Log-concave_Sampling_and_Score-based_Diffusion_Models_Algorithm_1_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "PDF Parallel Simulation for Log-concave Sampling and Score-based Diffusion ...", "date": "", "ddg_snippet": "In this section, we present parallel Picard methods for strongly log-concave sampling ( Algorithm 1 ) and show it holds improved convergence rate w.r.t. the KL divergence and total variance (Theorem 4.2 and Corollary 4.3).", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/attachment?id=qtuxDy2qEB&name=pdf", "content": "In this section, we present parallel Picard methods for strongly log-concave sampling ( Algorithm 1 ) and show it holds improved convergence rate w.r.t. the KL divergence and total variance (Theorem 4.2 and Corollary 4.3)."}
+{"idx": 1, "title": "Parallel Simulation for Log-concave Sampling and Score-based Diffusion ...", "date": "", "ddg_snippet": "TL;DR: We propose new parallel algorithms for log-concave sampling and diffusion models , and rigorously prove that our algorithms enjoy $\\ log d$ iteration complexity.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=qtuxDy2qEB", "content": "TL;DR: We propose new parallel algorithms for log-concave sampling and diffusion models , and rigorously prove that our algorithms enjoy $\\ log d$ iteration complexity."}
+{"idx": 2, "title": "Parallel Simulation for Log-concave Sampling and Score-based Diffusion ...", "date": "", "ddg_snippet": "Spotlight Poster Parallel Simulation for Log-concave Sampling and Score-based Diffusion Models Huanjian Zhou · Masashi Sugiyama East Exhibition Hall A-B #E-1103", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/43916", "content": "Spotlight Poster Parallel Simulation for Log-concave Sampling and Score-based Diffusion Models Huanjian Zhou · Masashi Sugiyama East Exhibition Hall A-B #E-1103"}
+{"idx": 3, "title": "Parallel simulation for sampling under isoperimetry and score-based ...", "date": "", "ddg_snippet": "Our work highlights the potential advantages of simulation methods in scientific computation for dynamics- based sampling and diffusion models .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2412.07435v1", "content": "Our work highlights the potential advantages of simulation methods in scientific computation for dynamics- based sampling and diffusion models ."}
+{"idx": 4, "title": "Parallel Simulation for Log-concave Sampling and Score-based Diffusion ...", "date": "", "ddg_snippet": "This research paper presents a new way to sample from complex probability distributions in machine learning more quickly and efficiently by using parallel computing techniques. The authors compare...", "subpage_snippet": "", "source": "bytez.com", "link": "https://bytez.com/docs/icml/43916/paper", "content": "This research paper presents a new way to sample from complex probability distributions in machine learning more quickly and efficiently by using parallel computing techniques. The authors compare..."}
+{"idx": 5, "title": "Parallel Simulation for Sampling Under Isoperimetry and Score Based ...", "date": "", "ddg_snippet": "In recent years, there has been a surge of interest in proving discretization bounds for sampling under isoperimetry and for diffusion models . As data size grows, reducing the iteration cost becomes an important goal. Inspired by the great success of the parallel simulation of the initial value problem in scientific computation, we propose parallel Picard methods for sampling tasks. Rigorous ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=6Gb7VfTKY7", "content": "In recent years, there has been a surge of interest in proving discretization bounds for sampling under isoperimetry and for diffusion models . As data size grows, reducing the iteration cost becomes an important goal. Inspired by the great success of the parallel simulation of the initial value problem in scientific computation, we propose parallel Picard methods for sampling tasks. Rigorous ..."}
+{"idx": 6, "title": "Parallel simulation for sampling under isoperimetry and score-based ...", "date": "", "ddg_snippet": "This convergence analysis is based on a randomized midpoint method, which is first proposed for log-concave sampling (Shen and Lee, 2019), and then extended to diffusion models by Gupta et al. (2024).", "subpage_snippet": "", "source": "bohrium.dp.tech", "link": "https://bohrium.dp.tech/paper/arxiv/2412.07435", "content": "This convergence analysis is based on a randomized midpoint method, which is first proposed for log-concave sampling (Shen and Lee, 2019), and then extended to diffusion models by Gupta et al. (2024)."}
+{"idx": 7, "title": "PDF The Adaptive Complexity of Parallelized Log Concave Sampling", "date": "", "ddg_snippet": "ABSTRACT In large-data applications, such as the inference process of diffusion models , it is desirable to design sampling algorithms with a high degree of parallelization. In this work, we study the adaptive complexity of sampling , which is the minimum number of sequential rounds required to achieve sampling given polynomially many queries executed in parallel at each round. For unconstrained ...", "subpage_snippet": "", "source": "proceedings.iclr.cc", "link": "https://proceedings.iclr.cc/paper_files/paper/2025/file/297a7a54da76d95f02b04d957a53c7ba-Paper-Conference.pdf", "content": "ABSTRACT In large-data applications, such as the inference process of diffusion models , it is desirable to design sampling algorithms with a high degree of parallelization. In this work, we study the adaptive complexity of sampling , which is the minimum number of sequential rounds required to achieve sampling given polynomially many queries executed in parallel at each round. For unconstrained ..."}
+{"idx": 8, "title": "score-baseddiffusionmodels - arXiv.org", "date": "", "ddg_snippet": "In recent years, there has been a surge of interest in proving discretization bounds for sampling under isoperimetry and for difusion models . As data size grows, reducing the iteration cost becomes an important goal. Inspired by the great success of the parallel simulation of the initial value problem in scientific computation, we propose parallel Picard methods for sampling tasks. Rigorous ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2412.07435v1", "content": "In recent years, there has been a surge of interest in proving discretization bounds for sampling under isoperimetry and for difusion models . As data size grows, reducing the iteration cost becomes an important goal. Inspired by the great success of the parallel simulation of the initial value problem in scientific computation, we propose parallel Picard methods for sampling tasks. Rigorous ..."}
+{"idx": 9, "title": "PDF Accelerating Diffusion Models with Parallel Sampling: Inference at Sub ...", "date": "", "ddg_snippet": "Abstract Diffusion models have become a leading method for generative modeling of both image and scientific data. As these models are costly to train and evaluate, re-ducing the inference cost for diffusion models remains a major goal. Inspired by the recent empirical success in accelerating diffusion models via the parallel sam-pling technique [ 1 ], we propose to divide the sampling process ...", "subpage_snippet": "", "source": "proceedings.neurips.cc", "link": "https://proceedings.neurips.cc/paper_files/paper/2024/file/f162fa05675e3db4a733aafc081653cf-Paper-Conference.pdf", "content": "Abstract Diffusion models have become a leading method for generative modeling of both image and scientific data. As these models are costly to train and evaluate, re-ducing the inference cost for diffusion models remains a major goal. Inspired by the recent empirical success in accelerating diffusion models via the parallel sam-pling technique [ 1 ], we propose to divide the sampling process ..."}