Add files using upload-large-folder tool

data/sampled_jsons/(self-paced_learning_OR_curriculum_learning)_AND_(physics-informed_neural_networks_OR_PINN)_before20.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Training physics-informed neural networks: One learning to ...", "date": "", "ddg_snippet": "by S Monaco · 2023 · Cited by 41 — Curriculum learning was first introduced in the context of PINNs by Krishnapriyan et al. [27]. The basic idea is that PINN convergence fails when the ...", "subpage_snippet": "", "source": "www.sciencedirect.com", "link": "https://www.sciencedirect.com/science/article/pii/S2590123023001500", "content": "by S Monaco · 2023 · Cited by 41 — Curriculum learning was first introduced in the context of PINNs by Krishnapriyan et al. [27]. The basic idea is that PINN convergence fails when the ..."}
+{"idx": 1, "title": "jaeminoh/Siren_PINNs: Solving various PDEs by ...", "date": "", "ddg_snippet": "8 Sept 2023 — ... Physics-Informed Neural Networks (PINNs). To address this issue, Krishnapriyan et al. propose a \" curriculum\" learning ... PINN \". Burgers, advection, reaction ...", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/jaeminoh/Siren_PINNs", "content": "8 Sept 2023 — ... Physics-Informed Neural Networks (PINNs). To address this issue, Krishnapriyan et al. propose a \" curriculum\" learning ... PINN \". Burgers, advection, reaction ..."}
+{"idx": 2, "title": "A Curriculum-Training-Based Strategy for Distributing ...", "date": "", "ddg_snippet": "by M Münzer · 2022 · Cited by 6 — Physics-informed Neural Networks (PINNs) often have, in their loss functions ... We apply this method to a PINN which recovers a full two-dimensional magnetohy-.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2211.11396", "content": "by M Münzer · 2022 · Cited by 6 — Physics-informed Neural Networks (PINNs) often have, in their loss functions ... We apply this method to a PINN which recovers a full two-dimensional magnetohy-."}
+{"idx": 3, "title": "DATS: Difficulty-Aware Task Sampler for Meta-Learning...", "date": "", "ddg_snippet": "by M Toloubidokhti · Cited by 13 — \"GPT- PINN : Generative Pre-Trained Physics-Informed Neural Networks toward ... \"Selectnet: Self-paced learning for high-dimensional partial differential equations.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=EvyYFSxdgB", "content": "by M Toloubidokhti · Cited by 13 — \"GPT- PINN : Generative Pre-Trained Physics-Informed Neural Networks toward ... \"Selectnet: Self-paced learning for high-dimensional partial differential equations."}
+{"idx": 4, "title": "Characterizing possible failure modes in physics-informed ...", "date": "", "ddg_snippet": "by A Krishnapriyan · 2021 · Cited by 1080 — A recent line of work involves Physics-Informed Neural Network ( PINN ) models, which aim to incorporate physical domain knowledge as soft constraints on an ... 13 pages", "subpage_snippet": "", "source": "proceedings.neurips.cc", "link": "https://proceedings.neurips.cc/paper/2021/file/df438e5206f31600e6ae4af72f2725f1-Paper.pdf", "content": "by A Krishnapriyan · 2021 · Cited by 1080 — A recent line of work involves Physics-Informed Neural Network ( PINN ) models, which aim to incorporate physical domain knowledge as soft constraints on an ... 13 pages"}
+{"idx": 5, "title": "Physics Informed Neural Networks", "date": "", "ddg_snippet": "16 Mar 2023 — Rethinking PINNs: Curriculum Learning . • The main idea is to start the training ... – Physics Informed Neural Networks ( PINN ). – Physics Informed Neural ... 53 pages", "subpage_snippet": "", "source": "jduarte.physics.ucsd.edu", "link": "https://jduarte.physics.ucsd.edu/phys139_239/lectures/19_PINNs.pdf", "content": "16 Mar 2023 — Rethinking PINNs: Curriculum Learning . • The main idea is to start the training ... – Physics Informed Neural Networks ( PINN ). – Physics Informed Neural ... 53 pages"}
+{"idx": 6, "title": "Learning Specialized Activation Functions for Physics ...", "date": "", "ddg_snippet": "by H Wang · Cited by 36 — ... physics-informed neural networks (PINNs). It is observed that PINNs exhibit high sensitivity to activation functions due to the various characteristics of ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=MpGP-z07TmM", "content": "by H Wang · Cited by 36 — ... physics-informed neural networks (PINNs). It is observed that PINNs exhibit high sensitivity to activation functions due to the various characteristics of ..."}
+{"idx": 7, "title": "Progressive Learning for Physics-informed Neural Motion ...", "date": "", "ddg_snippet": "14 Jul 2023 — In PINNs, such phenomena are often coined as curriculum learning [15]. However, the curriculum learning for PINN focuses more on 1-dimensional PDE with.", "subpage_snippet": "", "source": "www.roboticsproceedings.org", "link": "https://www.roboticsproceedings.org/rss19/p063.pdf", "content": "14 Jul 2023 — In PINNs, such phenomena are often coined as curriculum learning [15]. However, the curriculum learning for PINN focuses more on 1-dimensional PDE with."}
+{"idx": 8, "title": "[2210.12685] Less Emphasis on Difficult Layer Regions", "date": "", "ddg_snippet": "by Y Wang · 2022 · Cited by 4 — A novel curriculum learning method that encourages neural networks to prioritize learning on easier non-layer regions while downplaying learning on harder ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2210.12685", "content": "by Y Wang · 2022 · Cited by 4 — A novel curriculum learning method that encourages neural networks to prioritize learning on easier non-layer regions while downplaying learning on harder ..."}
+{"idx": 9, "title": "Pre-training strategy for solving evolution equations based ...", "date": "", "ddg_snippet": "by J Guo · 2023 · Cited by 45 — ... physics informed neural networks ( PINN ) and applied them to solve various PDEs. PINN is a deep learning framework for solving forward and inverse problems ...", "subpage_snippet": "", "source": "www.sciencedirect.com", "link": "https://www.sciencedirect.com/science/article/abs/pii/S0021999123003534", "content": "by J Guo · 2023 · Cited by 45 — ... physics informed neural networks ( PINN ) and applied them to solve various PDEs. PINN is a deep learning framework for solving forward and inverse problems ..."}

data/sampled_jsons/1ZC4RNjqzU_Position-_Evaluating_Generative_AI_Systems_Is_a_Social_Science_Measurement_Challenge_cons.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Position : Evaluating Generative AI Systems Is a Social Science ...", "date": "", "ddg_snippet": "The measurement tasks involved in evaluating generative AI (GenAI) systems lack sufficient scientific rigor, leading to what has been described as “a tangle of sloppy tests [and] apples-to-oranges comparisons” (Roose, 2024) .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2502.00561v2", "content": "The measurement tasks involved in evaluating generative AI (GenAI) systems lack sufficient scientific rigor, leading to what has been described as “a tangle of sloppy tests [and] apples-to-oranges comparisons” (Roose, 2024) ."}
+{"idx": 1, "title": "Position : Evaluating Generative AI Systems is a Social Science ...", "date": "", "ddg_snippet": "The measurement tasks involved in evaluating generative AI (GenAI) systems are especially difficult, leading to what has been described as”a tangle of sloppy tests [and] apples-to-oranges comparisons” (Roose, 2024).", "subpage_snippet": "", "source": "www.microsoft.com", "link": "https://www.microsoft.com/en-us/research/publication/position-evaluating-generative-ai-systems-is-a-social-science-measurement-challenge/", "content": "The measurement tasks involved in evaluating generative AI (GenAI) systems are especially difficult, leading to what has been described as”a tangle of sloppy tests [and] apples-to-oranges comparisons” (Roose, 2024)."}
+{"idx": 2, "title": "(PDF) Position : Evaluating Generative AI Systems is a Social ...", "date": "", "ddg_snippet": "The measurement tasks involved in evaluating generative AI (GenAI) systems are especially difficult, leading to what has been described as \"a tangle of sloppy tests [and] apples-to-oranges comparisons\" (Roose, 2024).", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/388657599_Position_Evaluating_Generative_AI_Systems_is_a_Social_Science_Measurement_Challenge", "content": "The measurement tasks involved in evaluating generative AI (GenAI) systems are especially difficult, leading to what has been described as \"a tangle of sloppy tests [and] apples-to-oranges comparisons\" (Roose, 2024)."}
+{"idx": 3, "title": "NeurIPS Evaluating Generative AI Systems is a Social Science ...", "date": "", "ddg_snippet": "Across academia, industry, and government, there is an increasing awareness that evaluating generative AI (GenAI) systems is challenging , as concepts related to their capabilities (e.g., intelligence, reasoning) and risks (e.g., stereotyping, anthropomorphism) are especially...", "subpage_snippet": "", "source": "nips.cc", "link": "https://nips.cc/virtual/2024/105556", "content": "Across academia, industry, and government, there is an increasing awareness that evaluating generative AI (GenAI) systems is challenging , as concepts related to their capabilities (e.g., intelligence, reasoning) and risks (e.g., stereotyping, anthropomorphism) are especially..."}
+{"idx": 4, "title": "Evaluating Generative AI Systems is a Social Science ...", "date": "", "ddg_snippet": "generative AI systems that borrow from how social scientists measure human behaviors and abilities. Think of current AI evaluation like using a ruler made of rubber - it stretches and bends, giving different measurements each time.", "subpage_snippet": "", "source": "www.aimodels.fyi", "link": "https://www.aimodels.fyi/papers/arxiv/evaluating-generative-ai-systems-is-social-science", "content": "generative AI systems that borrow from how social scientists measure human behaviors and abilities. Think of current AI evaluation like using a ruler made of rubber - it stretches and bends, giving different measurements each time."}
+{"idx": 5, "title": "Downes.ca ~ Stephen's Web ~ Evaluating Generative AI Systems is ...", "date": "", "ddg_snippet": "The argument in this short paper (6 page PDF) is that \" measurement tasks involved in evaluating GenAI systems are highly reminiscent of measurement tasks found throughout the social sciences \" and thus \"the ML community would benefit from learning from and drawing on the social ...", "subpage_snippet": "", "source": "www.downes.ca", "link": "https://www.downes.ca/post/77850", "content": "The argument in this short paper (6 page PDF) is that \" measurement tasks involved in evaluating GenAI systems are highly reminiscent of measurement tasks found throughout the social sciences \" and thus \"the ML community would benefit from learning from and drawing on the social ..."}
+{"idx": 6, "title": "Evaluating Evaluations : Examining Best Practices for Measuring ...", "date": "", "ddg_snippet": "- Evaluating Generative AI Systems is a Social Science Measurement Challenge ( Oral ) >. 20 presenters.It is a vector graphic and may be used at any scale.", "subpage_snippet": "", "source": "neurips.cc", "link": "https://neurips.cc/virtual/2024/workshop/84734", "content": "- Evaluating Generative AI Systems is a Social Science Measurement Challenge ( Oral ) >. 20 presenters.It is a vector graphic and may be used at any scale."}
+{"idx": 7, "title": "Articles by Nicholas Pangakis | Synthical", "date": "", "ddg_snippet": "Position : Evaluating Generative AI Systems is a Social Science Measurement Challenge .Computers and Society . A Shared Standard for Valid Measurement of Generative AI Systems ' Capabilities, Risks, and Impacts.", "subpage_snippet": "", "source": "synthical.com", "link": "https://synthical.com/profile/b226af83-c10f-4fe6-8f37-521ba59e4dfc/articles", "content": "Position : Evaluating Generative AI Systems is a Social Science Measurement Challenge .Computers and Society . A Shared Standard for Valid Measurement of Generative AI Systems ' Capabilities, Risks, and Impacts."}
+{"idx": 8, "title": "How to build a better AI benchmark | MIT Technology Review", "date": "", "ddg_snippet": "A February position paper argued that “ evaluating GenAI systems is a social science measurement challenge ,” specifically unpacking how the validity systems used in social measurements can be applied to AI benchmarking.", "subpage_snippet": "", "source": "www.technologyreview.com", "link": "https://www.technologyreview.com/2025/05/08/1116192/how-to-build-a-better-ai-benchmark/", "content": "A February position paper argued that “ evaluating GenAI systems is a social science measurement challenge ,” specifically unpacking how the validity systems used in social measurements can be applied to AI benchmarking."}
+{"idx": 9, "title": "Towards Interactive Evaluations for Interaction Harms in Human- AI ...", "date": "", "ddg_snippet": "2025. Position : Evaluating Generative AI Systems is a Social Science Measurement Challenge . arXiv preprint arXiv:2502.00561. Wang, A.; Morgenstern, J.; and Dickerson, J. P. 2025. Large language models that replace human participants can harm fully misportray and flatten identity...", "subpage_snippet": "", "source": "knightcolumbia.org", "link": "https://knightcolumbia.org/content/towards-interactive-evaluations-for-interaction-harms-in-human-ai-systems", "content": "2025. Position : Evaluating Generative AI Systems is a Social Science Measurement Challenge . arXiv preprint arXiv:2502.00561. Wang, A.; Morgenstern, J.; and Dickerson, J. P. 2025. Large language models that replace human participants can harm fully misportray and flatten identity..."}

data/sampled_jsons/23zxLtvder_SPD_Sync-Point_Drop_Algorithm_1_sensitivity_threshold_τ1_τ2_optimization.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "SPD: Sync-Point Drop for Efficient Tensor Parallelism of ... - OpenReview", "date": "", "ddg_snippet": "In this paper, we present Sync-Point Drop ( SPD ), a novel optimization technique that improves the latency of LLMs on distributed inference systems. By adopting a new block design and separated approaches based on block-wisely identified sensitivity for lack of sync-point , SPD enables eficient deployment across multiple computing units with ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=23zxLtvder", "content": "In this paper, we present Sync-Point Drop ( SPD ), a novel optimization technique that improves the latency of LLMs on distributed inference systems. By adopting a new block design and separated approaches based on block-wisely identified sensitivity for lack of sync-point , SPD enables eficient deployment across multiple computing units with ..."}
+{"idx": 1, "title": "SPD: Sync-Point Drop for efficient tensor parallelism of Large Language ...", "date": "", "ddg_snippet": "Therefore, we introduce a novel optimization technique, Sync-Point Drop ( SPD ), to reduce communication overheads in tensor parallelism by selectively dropping synchronization on attention outputs. In detail, we first propose a block design that allows execution to proceed without communication through SPD .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2502.20727v2", "content": "Therefore, we introduce a novel optimization technique, Sync-Point Drop ( SPD ), to reduce communication overheads in tensor parallelism by selectively dropping synchronization on attention outputs. In detail, we first propose a block design that allows execution to proceed without communication through SPD ."}
+{"idx": 2, "title": "SPD: Sync-Point Drop for Efficient Tensor Parallelism of ... - LinkedIn", "date": "", "ddg_snippet": "Our work, Sync-Point Drop ( SPD ), introduces a method to selectively remove unnecessary synchronization points in distributed inference.", "subpage_snippet": "", "source": "www.linkedin.com", "link": "https://www.linkedin.com/posts/minsik-cho-1a51619_spd-sync-point-drop-for-efficient-tensor-activity-7351297565960646659-ShfF", "content": "Our work, Sync-Point Drop ( SPD ), introduces a method to selectively remove unnecessary synchronization points in distributed inference."}
+{"idx": 3, "title": "ICML Poster SPD: Sync-Point Drop for Efficient Tensor Parallelism of ...", "date": "", "ddg_snippet": "Poster SPD : Sync-Point Drop for Efficient Tensor Parallelism of Large Language Models Han-Byul Kim · Duc Hoang · Arnav Kundu · Mohammad Samragh · Minsik Cho West Exhibition Hall B2-B3 #W-507", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/46606", "content": "Poster SPD : Sync-Point Drop for Efficient Tensor Parallelism of Large Language Models Han-Byul Kim · Duc Hoang · Arnav Kundu · Mohammad Samragh · Minsik Cho West Exhibition Hall B2-B3 #W-507"}
+{"idx": 4, "title": "SPD: Sync-Point Drop for Efficient Tensor Parallelism of Large Language ...", "date": "", "ddg_snippet": "The paper introduces Sync-Point Drop ( SPD ), an optimization technique that reduces communication overhead in Tensor Parallelism for large language models, achieving approximately 20% lower inference latency with less than 1 % accuracy degradation.", "subpage_snippet": "", "source": "chatpaper.com", "link": "https://chatpaper.com/chatpaper/paper/166779", "content": "The paper introduces Sync-Point Drop ( SPD ), an optimization technique that reduces communication overhead in Tensor Parallelism for large language models, achieving approximately 20% lower inference latency with less than 1 % accuracy degradation."}
+{"idx": 5, "title": "(PDF) SPD: Sync-Point Drop for efficient tensor ... - ResearchGate", "date": "", "ddg_snippet": "Therefore, we introduce a novel optimization technique, Sync-Point Drop ( SPD ), to reduce communication overheads in tensor parallelism by selectively dropping synchronization on attention outputs.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/389510233_SPD_Sync-Point_Drop_for_efficient_tensor_parallelism_of_Large_Language_Models", "content": "Therefore, we introduce a novel optimization technique, Sync-Point Drop ( SPD ), to reduce communication overheads in tensor parallelism by selectively dropping synchronization on attention outputs."}
+{"idx": 6, "title": "\"SPD: Sync-Point Drop for efficient tensor parallelism of Large ... - dblp", "date": "", "ddg_snippet": "Bibliographic details on SPD : Sync-Point Drop for efficient tensor parallelism of Large Language Models.", "subpage_snippet": "", "source": "dblp.org", "link": "https://dblp.org/rec/journals/corr/abs-2502-20727", "content": "Bibliographic details on SPD : Sync-Point Drop for efficient tensor parallelism of Large Language Models."}
+{"idx": 7, "title": "[2502.20727] SPD: Sync-Point Drop for Efficient Tensor Parallelism of ...", "date": "", "ddg_snippet": "Therefore, we introduce a novel optimization technique, Sync-Point Drop ( SPD ), to reduce communication overheads in tensor parallelism by selectively dropping synchronization on attention outputs. In detail, we first propose a block design that allows execution to proceed without communication through SPD .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2502.20727", "content": "Therefore, we introduce a novel optimization technique, Sync-Point Drop ( SPD ), to reduce communication overheads in tensor parallelism by selectively dropping synchronization on attention outputs. In detail, we first propose a block design that allows execution to proceed without communication through SPD ."}
+{"idx": 8, "title": "Optimizing LLM Inference Across Multiple GPUs - zerna.io", "date": "", "ddg_snippet": "Sync-Point Drop ( SPD ) is a novel optimization technique that selectively eliminates synchronization points in tensor-parallel LLM inference, significantly reducing communication overhead.", "subpage_snippet": "", "source": "zerna.io", "link": "http://zerna.io/en/page/engineering/presentation_set/engineering-llm-research/presentation/engineering-model-optimization/slide/engineering-paper-2502_20727", "content": "Sync-Point Drop ( SPD ) is a novel optimization technique that selectively eliminates synchronization points in tensor-parallel LLM inference, significantly reducing communication overhead."}
+{"idx": 9, "title": "Han-Byul Kim", "date": "", "ddg_snippet": "I mostly focus on optimizing neural networks on deployment in the aspect of algorithms and model architectures targeting system and hardware implementation. My researches explore techniques like quantization and neural architecture search to achieve this.", "subpage_snippet": "", "source": "hanbyulkim.github.io", "link": "https://hanbyulkim.github.io/", "content": "I mostly focus on optimizing neural networks on deployment in the aspect of algorithms and model architectures targeting system and hardware implementation. My researches explore techniques like quantization and neural architecture search to achieve this."}

data/sampled_jsons/23zxLtvder_SPD_Sync-Point_Drop_Tensor_Parallelism_Large_Language_Models.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "SPD : Sync - Point Drop for Efficient Tensor Parallelism of Large ...", "date": "", "ddg_snippet": "Tensor parallelism provides an effective way to increase server large language model (LLM) inference efficiency despite adding an additional communication cost.", "subpage_snippet": "", "source": "machinelearning.apple.com", "link": "https://machinelearning.apple.com/research/sync-point-drop", "content": "Tensor parallelism provides an effective way to increase server large language model (LLM) inference efficiency despite adding an additional communication cost."}
+{"idx": 1, "title": "SPD : Sync - Point Drop for efficient tensor parallelism of Large ...", "date": "", "ddg_snippet": "Tensor Parallelism (TP) (Shoeybi et al., 2019) is a systematic computing technique on a distributed environment used to accelerate large -scale language models .1: SPD : sync - point drop . 2:B2B: block-to-block distillation. 3:HG: attention head grouping initialization.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2502.20727v1", "content": "Tensor Parallelism (TP) (Shoeybi et al., 2019) is a systematic computing technique on a distributed environment used to accelerate large -scale language models .1: SPD : sync - point drop . 2:B2B: block-to-block distillation. 3:HG: attention head grouping initialization."}
+{"idx": 2, "title": "SPD : Sync - Point Drop for efficient tensor parallelism of Large ...", "date": "", "ddg_snippet": "Overview SPD ( Sync - Point Drop ) reduces communication overhead in tensor parallelism for LLMsIdentifies and selectively drops unnecessary synchronization operationsTraining and running large language models is a bit like trying to cook a massive meal in a...", "subpage_snippet": "", "source": "www.aimodels.fyi", "link": "https://www.aimodels.fyi/papers/arxiv/spd-sync-point-drop-efficient-tensor-parallelism", "content": "Overview SPD ( Sync - Point Drop ) reduces communication overhead in tensor parallelism for LLMsIdentifies and selectively drops unnecessary synchronization operationsTraining and running large language models is a bit like trying to cook a massive meal in a..."}
+{"idx": 3, "title": "Sync - Point Drop for Efficient Tensor Parallelism - Kifinity", "date": "", "ddg_snippet": "The rapid expansion of large language models (LLMs) necessitates efficient distributed inference across multiple computing units. Communication overheads from techniques like Tensor Parallelism hinder scalability and low latency.", "subpage_snippet": "", "source": "www.kifinity.com", "link": "https://www.kifinity.com/post/sync-point-drop-machinelearning-apple-e5f9168f", "content": "The rapid expansion of large language models (LLMs) necessitates efficient distributed inference across multiple computing units. Communication overheads from techniques like Tensor Parallelism hinder scalability and low latency."}
+{"idx": 4, "title": "Figure 1. Tensor parallelism applied on transformer decoder block (in...", "date": "", "ddg_snippet": "SPD : Sync - Point Drop for efficient tensor parallelism of Large Language Models .With the rapid expansion in the scale of large language models (LLMs), enabling efficient distributed inference across multiple computing units has become increasingly critical.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/figure/Tensor-parallelism-applied-on-transformer-decoder-block-in-2-GPUs-distributed-inference_fig1_389510233", "content": "SPD : Sync - Point Drop for efficient tensor parallelism of Large Language Models .With the rapid expansion in the scale of large language models (LLMs), enabling efficient distributed inference across multiple computing units has become increasingly critical."}
+{"idx": 5, "title": "How to Implement Model Parallelism for Large Language Models ...", "date": "", "ddg_snippet": "Hybrid Model Parallelism . Combining tensor and pipeline parallelism maximizes efficiency for very large models . class HybridParallelTransformer(nn.Module): def __init__(self, config, tensor _ parallel _size, pipeline_ parallel _size)", "subpage_snippet": "", "source": "markaicode.com", "link": "https://markaicode.com/model-parallelism-large-language-models/", "content": "Hybrid Model Parallelism . Combining tensor and pipeline parallelism maximizes efficiency for very large models . class HybridParallelTransformer(nn.Module): def __init__(self, config, tensor _ parallel _size, pipeline_ parallel _size)"}
+{"idx": 6, "title": "Understanding tensor parallelism to fit larger models on... | GoPenAI", "date": "", "ddg_snippet": "Tensor parallelism divides model weights onto multiple devices to fit larger models that cannot fit into single device memory..", "subpage_snippet": "", "source": "blog.gopenai.com", "link": "https://blog.gopenai.com/understanding-tensor-parallelism-to-fit-larger-models-on-multiple-devices-part-2-ee8a2ab7f017", "content": "Tensor parallelism divides model weights onto multiple devices to fit larger models that cannot fit into single device memory.."}
+{"idx": 7, "title": "Promoting openness in scientific communication and the peer-review...", "date": "", "ddg_snippet": "SPD : Sync - Point Drop for efficient tensor parallelism of Large Language Models .KV-Runahead: Scalable Causal LLM Inference by Parallel Key-Value Cache Generation.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/search?term=~Minsik_Cho1&content=authors&group=all&source=forum&sort=cdate:desc", "content": "SPD : Sync - Point Drop for efficient tensor parallelism of Large Language Models .KV-Runahead: Scalable Causal LLM Inference by Parallel Key-Value Cache Generation."}
+{"idx": 8, "title": "GitHub - Toseic/LLM-inference-arxiv-daily: Automatically Update...", "date": "", "ddg_snippet": "SPD : Sync - Point Drop for efficient tensor parallelism of Large Language Models . Han-Byul Kim et.al.Tender: Accelerating Large Language Models via Tensor Decomposition and Runtime Requantization.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/Toseic/LLM-inference-arxiv-daily", "content": "SPD : Sync - Point Drop for efficient tensor parallelism of Large Language Models . Han-Byul Kim et.al.Tender: Accelerating Large Language Models via Tensor Decomposition and Runtime Requantization."}
+{"idx": 9, "title": "Reducing LLM Inference Costs While Preserving Performance", "date": "", "ddg_snippet": "Model Parallelism : To serve very large models (tens to hundreds of billions of parameters), model parallelism is necessary – splitting the model across multiple GPUs or nodes.", "subpage_snippet": "", "source": "www.rohan-paul.com", "link": "https://www.rohan-paul.com/p/reducing-llm-inference-costs-while", "content": "Model Parallelism : To serve very large models (tens to hundreds of billions of parameters), model parallelism is necessary – splitting the model across multiple GPUs or nodes."}

data/sampled_jsons/2408.10672_Section_3.2_Appendix_A.1_Ts-Attn_tensor_shape.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "A arXiv:2408.10672v3 [cs.LG] 27 Mar 2025", "date": "", "ddg_snippet": "olds identical shape with the input Xin. In our Ts-Attn block, we employ an Attn block Attninter for the first cross-solution information sharing stage, and the other Attn block Attnintra for the second cross-dimension information sharing stage (illustrated i", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2408.10672", "content": "olds identical shape with the input Xin. In our Ts-Attn block, we employ an Attn block Attninter for the first cross-solution information sharing stage, and the other Attn block Attnintra for the second cross-dimension information sharing stage (illustrated i"}
+{"idx": 1, "title": "arXiv:2408.10672v2 [cs.LG] 26 Sep 2024", "date": "", "ddg_snippet": "ds identical shape with the input Xin. In our Ts-Attn block, we employ an Attn block Attninter for the first cross-solution information sharing stage, and the other Attn block Attnintra for the second cross-dimension information sharing stage", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2408.10672v2", "content": "ds identical shape with the input Xin. In our Ts-Attn block, we employ an Attn block Attninter for the first cross-solution information sharing stage, and the other Attn block Attnintra for the second cross-dimension information sharing stage"}
+{"idx": 2, "title": "[ 2408 . 10672 ] Neural Exploratory Landscape Analysis for...", "date": "", "ddg_snippet": "To address the gap, this paper proposes Neural Exploratory Landscape Analysis (NeurELA), a novel framework that dynamically profiles landscape features through a two -stage, attention-based neural network, executed in an entirely end-to-end fashion.arXiv: 2408 . 10672 [cs.LG].", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2408.10672", "content": "To address the gap, this paper proposes Neural Exploratory Landscape Analysis (NeurELA), a novel framework that dynamically profiles landscape features through a two -stage, attention-based neural network, executed in an entirely end-to-end fashion.arXiv: 2408 . 10672 [cs.LG]."}
+{"idx": 3, "title": "Tensor System and Data Types | tensorflow/tensorflow | DeepWiki", "date": "", "ddg_snippet": "This document covers TensorFlow's core tensor abstraction layer, shape system, data type representations, and the SavedModel format for model serialization and compatibility.", "subpage_snippet": "", "source": "deepwiki.com", "link": "https://deepwiki.com/tensorflow/tensorflow/2.2-tensor-system-and-data-types", "content": "This document covers TensorFlow's core tensor abstraction layer, shape system, data type representations, and the SavedModel format for model serialization and compatibility."}
+{"idx": 4, "title": "Installing flash- attn without compiling it | Simon Willison’s TILs", "date": "", "ddg_snippet": "If you ever run into instructions that tell you to do this: pip install flash- attn --no-build-isolation.In browsing through the list of 83 options I thought flash_ attn -2.6.3+cu123torch2.4cxx11abiFALSE-cp310-cp310-linux_x86_64.whl might be the right one (shrug?).", "subpage_snippet": "", "source": "til.simonwillison.net", "link": "https://til.simonwillison.net/python/installing-flash-attention", "content": "If you ever run into instructions that tell you to do this: pip install flash- attn --no-build-isolation.In browsing through the list of 83 options I thought flash_ attn -2.6.3+cu123torch2.4cxx11abiFALSE-cp310-cp310-linux_x86_64.whl might be the right one (shrug?)."}
+{"idx": 5, "title": "The Meaning of the Metric Tensor", "date": "", "ddg_snippet": "", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=Dn0ZZRVuJcU", "content": ""}
+{"idx": 6, "title": "Abstract - arXiv.org", "date": "", "ddg_snippet": "on [55]. Ts-Attn receives Et and then advances the information sharing at both cross-solution and cross-dimensio levels. 1 ) Cross-solution attention: We utilize an Attn block to enable same dimensions shared by different candidate solutions within the population to exchange inf", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2408.10672v1", "content": "on [55]. Ts-Attn receives Et and then advances the information sharing at both cross-solution and cross-dimensio levels. 1 ) Cross-solution attention: We utilize an Attn block to enable same dimensions shared by different candidate solutions within the population to exchange inf"}
+{"idx": 7, "title": "(PDF) Semantic Physics II: A Drop in Field Substrate for ...", "date": "", "ddg_snippet": "Appendix F. TE & Drift-Heat Panels: Diagnostic Dashboards Purpose. The TE & Drift-Heat dashboards turn SP-II’s field observables into actionable telemetry: they quantify where, when, and why a generation begins to drift, and attribute likely drivers via directed information flow.", "subpage_snippet": "", "source": "www.academia.edu", "link": "https://www.academia.edu/144021639/Semantic_Physics_II_A_Drop_in_Field_Substrate_for_Reliable_Reasoning", "content": "Appendix F. TE & Drift-Heat Panels: Diagnostic Dashboards Purpose. The TE & Drift-Heat dashboards turn SP-II’s field observables into actionable telemetry: they quantify where, when, and why a generation begins to drift, and attribute likely drivers via directed information flow."}
+{"idx": 8, "title": "Neural Exploratory Landscape Analysis for Meta-Black-Box ...", "date": "", "ddg_snippet": "27 Mar 2025 — The computation graph of the Ts - Attn is illustrated on the right side of Figure 2, with a basic component being the attention block ( A t t ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2408.10672v3", "content": "27 Mar 2025 — The computation graph of the Ts - Attn is illustrated on the right side of Figure 2, with a basic component being the attention block ( A t t ..."}
+{"idx": 9, "title": "PixelCNN.ipynb - Colab", "date": "", "ddg_snippet": "PixelCNN implementation details. Question 1 . : Where can we apply convolutions of type B to preserve autoregressive property? Question 2. : Input tensor shapes ?def forward(self, x: torch. Tensor ) -> torch. Tensor : x = x.permute(0, 2, 3, 1 ).contiguous().", "subpage_snippet": "", "source": "colab.research.google.com", "link": "https://colab.research.google.com/github/r-isachenko/2024-DGM-MIPT-YSDA-course/blob/main/seminars/seminar1/PixelCNN.ipynb", "content": "PixelCNN implementation details. Question 1 . : Where can we apply convolutions of type B to preserve autoregressive property? Question 2. : Input tensor shapes ?def forward(self, x: torch. Tensor ) -> torch. Tensor : x = x.permute(0, 2, 3, 1 ).contiguous()."}

data/sampled_jsons/27tMzmzDjO_A_Geometric_Approach_Personalized_Recommendation_MF-GEOMETRIC_Table_3_vector_addition_sub.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Vector (mathematics and physics) - Wikipedia", "date": "", "ddg_snippet": "Both geometric vectors and tuples can be added and scaled, and these vector operations led to the concept of a vector space, which is a set equipped with a vector addition and a scalar multiplication that satisfy some axioms generalizing the main properties of operations on the above...", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/Vector_(mathematics_and_physics)", "content": "Both geometric vectors and tuples can be added and scaled, and these vector operations led to the concept of a vector space, which is a set equipped with a vector addition and a scalar multiplication that satisfy some axioms generalizing the main properties of operations on the above..."}
+{"idx": 1, "title": "A Geometric Approach to Personalized Recommendation with...", "date": "", "ddg_snippet": "Personalized item recommendation typically suffers from data sparsity, which is most often addressed by learning vector representations of users and items via low-rank matrix factorization.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=27tMzmzDjO&referrer=[the+profile+of+Andrew+McCallum](/profile?id=~Andrew_McCallum1)", "content": "Personalized item recommendation typically suffers from data sparsity, which is most often addressed by learning vector representations of users and items via low-rank matrix factorization."}
+{"idx": 2, "title": "Difference Between Scalar and Vector Quantities - GeeksforGeeks", "date": "", "ddg_snippet": "Simple arithmetic operations ( addition , subtraction , multiplication, division). It requires vector addition and subtraction , dot and cross products. In scalar numerical value is Notable.", "subpage_snippet": "", "source": "www.geeksforgeeks.org", "link": "https://www.geeksforgeeks.org/maths/difference-between-scalar-and-vector-quantities/", "content": "Simple arithmetic operations ( addition , subtraction , multiplication, division). It requires vector addition and subtraction , dot and cross products. In scalar numerical value is Notable."}
+{"idx": 3, "title": "byjus.com/maths/ vectors", "date": "", "ddg_snippet": "The vectors are defined as an object containing both magnitude and direction. Vector describes the movement of an object from one point to another. Vector math can be geometrically picturised by the directed line segment.", "subpage_snippet": "", "source": "byjus.com", "link": "https://byjus.com/maths/vectors/", "content": "The vectors are defined as an object containing both magnitude and direction. Vector describes the movement of an object from one point to another. Vector math can be geometrically picturised by the directed line segment."}
+{"idx": 4, "title": "Geometric Shapes - Definition, Types, List | Geometric Figures", "date": "", "ddg_snippet": "Three -dimensional geometric shapes: These are 3 D shapes that have an x-axis, y-axis, and z-axis. The z-axis represents the height of the object.", "subpage_snippet": "", "source": "www.cuemath.com", "link": "https://www.cuemath.com/geometry/geometric-shapes/", "content": "Three -dimensional geometric shapes: These are 3 D shapes that have an x-axis, y-axis, and z-axis. The z-axis represents the height of the object."}
+{"idx": 5, "title": "Windows. Ключи KMS | Д. С. Кулябов", "date": "", "ddg_snippet": "A Geometric Approach to the Lagrangian and Hamiltonian Formalism of Electrodynamics.Quantum Field Theory Approach to the Analysis of One-Step Models.", "subpage_snippet": "", "source": "yamadharma.github.io", "link": "https://yamadharma.github.io/ru/post/2023/06/08/windows-kms-keys/", "content": "A Geometric Approach to the Lagrangian and Hamiltonian Formalism of Electrodynamics.Quantum Field Theory Approach to the Analysis of One-Step Models."}
+{"idx": 6, "title": "TN 112_Lecture_6_22nd_Jan_2025 (1).pptx g | PPT", "date": "", "ddg_snippet": "This document provides an introduction to vectors using a geometric approach . It begins by defining vectors as oriented line segments representing displacements, velocities, and forces. Key concepts introduced include vector addition and scalar multiplication.", "subpage_snippet": "", "source": "www.slideshare.net", "link": "https://www.slideshare.net/slideshow/tn-112_lecture_6_22nd_jan_2025-1-pptx-g/278546765", "content": "This document provides an introduction to vectors using a geometric approach . It begins by defining vectors as oriented line segments representing displacements, velocities, and forces. Key concepts introduced include vector addition and scalar multiplication."}
+{"idx": 7, "title": "Find the volume of parallelopiped • Physics Forums", "date": "", "ddg_snippet": "You could approach it as a geometry question (have you worked out what shape the origin and the endpoints of the three vectors give you?). It's not obvious to me how to solve it with a purely vectorial approach .", "subpage_snippet": "", "source": "www.physicsforums.com", "link": "https://www.physicsforums.com/threads/find-the-volume-of-parallelopiped.706789/", "content": "You could approach it as a geometry question (have you worked out what shape the origin and the endpoints of the three vectors give you?). It's not obvious to me how to solve it with a purely vectorial approach ."}
+{"idx": 8, "title": "A new view of spaces and their properties in the sense of... | PLOS One", "date": "", "ddg_snippet": "This study presents a novel approach to metric spaces through the lens of geometric calculus, redefining traditional structures with new operations and properties derived from non-Newtonian measures.", "subpage_snippet": "", "source": "journals.plos.org", "link": "https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0315942", "content": "This study presents a novel approach to metric spaces through the lens of geometric calculus, redefining traditional structures with new operations and properties derived from non-Newtonian measures."}
+{"idx": 9, "title": "10 Best Google Fonts for Your Website in 2025 | Socialectric", "date": "", "ddg_snippet": "A modern, approachable look with a mechanical skeleton and largely geometric forms. Its open curves make it readable and friendly, perfect for both screen and print.", "subpage_snippet": "", "source": "www.socialectric.com", "link": "https://www.socialectric.com/insights/10-best-google-fonts-for-your-website", "content": "A modern, approachable look with a mechanical skeleton and largely geometric forms. Its open curves make it readable and friendly, perfect for both screen and print."}

data/sampled_jsons/7uqVfZW6Mo_SDXL_SDv1.5_architectural_difference_attention_mechanism_underperformance.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Stable Diffusion - Wikipedia", "date": "", "ddg_snippet": "The denoising process used by Stable Diffusion. The model generates images by iteratively denoising random noise until a configured number of steps have been reached, guided by the CLIP text encoder pretrained on concepts along with the attention mechanism ...", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/Stable_Diffusion", "content": "The denoising process used by Stable Diffusion. The model generates images by iteratively denoising random noise until a configured number of steps have been reached, guided by the CLIP text encoder pretrained on concepts along with the attention mechanism ..."}
+{"idx": 1, "title": "Attention (machine learning) - Wikipedia", "date": "", "ddg_snippet": "In machine learning, attention is a method that determines the importance of each component in a sequence relative to the other components in that sequence. In natural language processing, importance is represented by \"soft\" weights assigne...", "subpage_snippet": "", "source": "en.m.wikipedia.org", "link": "https://en.m.wikipedia.org/wiki/Attention_(machine_learning)", "content": "In machine learning, attention is a method that determines the importance of each component in a sequence relative to the other components in that sequence. In natural language processing, importance is represented by \"soft\" weights assigne..."}
+{"idx": 2, "title": "Abstract page for arXiv paper 1706.03762: Attention Is All You Need", "date": "", "ddg_snippet": "The best performing models also connect the encoder and decoder through an attention mechanism . We propose a new simple network architecture , the Transformer, based solely on attention mechanisms , dispensing with recurrence and convolutions entirely.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/1706.03762", "content": "The best performing models also connect the encoder and decoder through an attention mechanism . We propose a new simple network architecture , the Transformer, based solely on attention mechanisms , dispensing with recurrence and convolutions entirely."}
+{"idx": 3, "title": "Stable Diffusion XL — Nunchaku 1.0.1 documentation", "date": "", "ddg_snippet": "CPU Offload. FP16 Attention . First-Block Cache.Running Nunchaku SDXL -Turbo (examples/ v 1/ sdxl -turbo.py)#.", "subpage_snippet": "", "source": "nunchaku.tech", "link": "https://nunchaku.tech/docs/nunchaku/usage/sdxl.html", "content": "CPU Offload. FP16 Attention . First-Block Cache.Running Nunchaku SDXL -Turbo (examples/ v 1/ sdxl -turbo.py)#."}
+{"idx": 4, "title": "Mage | Free, Fast, Unlimited Stable Diffusion", "date": "", "ddg_snippet": "sdv 2.1. | new. imported.Multi-LoRA Generation for SDXL .", "subpage_snippet": "", "source": "www.mage.space", "link": "https://www.mage.space/?ref=seekme", "content": "sdv 2.1. | new. imported.Multi-LoRA Generation for SDXL ."}
+{"idx": 5, "title": "Hotline Miami v 1.0.43 (Полная версия) - скачать на Андроид", "date": "", "ddg_snippet": "Hotline Miami MOD APK (Полная версия) v 1.0.43.Character AI PREMIUM Android 7.0 v 1.12.4.", "subpage_snippet": "", "source": "5play.games", "link": "https://5play.games/hotline-miami", "content": "Hotline Miami MOD APK (Полная версия) v 1.0.43.Character AI PREMIUM Android 7.0 v 1.12.4."}
+{"idx": 6, "title": "PDF в JPG — Конвертируйте PDF в изображения онлайн бесплатно", "date": "", "ddg_snippet": "Удобный онлайн-инструмент конвертации страниц PDF в изображения или извлечения отдельных изображений из PDF. Бесплатно, без загрузок и водяных знаков.", "subpage_snippet": "", "source": "smallpdf.com", "link": "https://smallpdf.com/ru/pdf-to-jpg", "content": "Удобный онлайн-инструмент конвертации страниц PDF в изображения или извлечения отдельных изображений из PDF. Бесплатно, без загрузок и водяных знаков."}
+{"idx": 7, "title": "Ключи активации Windows 10 | Ответы Mail", "date": "", "ddg_snippet": "Смотреть все.", "subpage_snippet": "", "source": "otvet.mail.ru", "link": "https://otvet.mail.ru/question/237199183", "content": "Смотреть все."}
+{"idx": 8, "title": "(Решено) Упр.16 ГДЗ Макарычев 7 класс по алгебре", "date": "", "ddg_snippet": "Решение #1. Изображение Найдите значение выражения:а) 3,6 : 0,08 + 5,2 * 2,5; б) (9,885 - 0,365) : 1,7 +... Рассмотрим вариант решения задания из учебника Макарычев, Миндюк 7 класс, Просвещение: Найдите значение выражения: а) 3,6 : 0,08 + 5,2 * 2,5; ...", "subpage_snippet": "", "source": "reshak.ru", "link": "https://reshak.ru/otvet/makar7.php?otvet1=new/16", "content": "Решение #1. Изображение Найдите значение выражения:а) 3,6 : 0,08 + 5,2 * 2,5; б) (9,885 - 0,365) : 1,7 +... Рассмотрим вариант решения задания из учебника Макарычев, Миндюк 7 класс, Просвещение: Найдите значение выражения: а) 3,6 : 0,08 + 5,2 * 2,5; ..."}
+{"idx": 9, "title": "GISMETEO: Погода в Старом Осколе сегодня, прогноз погоды...", "date": "", "ddg_snippet": "Подробный прогноз погоды в Старом Осколе на сегодня.", "subpage_snippet": "", "source": "www.gismeteo.ru", "link": "https://www.gismeteo.ru/weather-stary-oskol-5024/", "content": "Подробный прогноз погоды в Старом Осколе на сегодня."}

data/sampled_jsons/92%_climate_activism_reddit_subreddits_three_subreddits.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "arXiv:2107.06970v2 [cs.HC] 18 Jan 2022", "date": "", "ddg_snippet": "by N TeBlunthuis · 2021 · Cited by 21 — We detect three reciprocal competitive interac- tions among the three subreddits that focus on real estate. The edges from r/fatfire to r ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2107.06970", "content": "by N TeBlunthuis · 2021 · Cited by 21 — We detect three reciprocal competitive interac- tions among the three subreddits that focus on real estate. The edges from r/fatfire to r ..."}
+{"idx": 1, "title": "Identifying Competition and Mutualism between Online ...", "date": "", "ddg_snippet": "by N TeBlunthuis · 2022 · Cited by 20 — We detect three reciprocal competitive inter- actions among the three subreddits that focus on real es- tate. The edges from r/fatfire to r/commercial ...", "subpage_snippet": "", "source": "par.nsf.gov", "link": "https://par.nsf.gov/servlets/purl/10348341", "content": "by N TeBlunthuis · 2022 · Cited by 20 — We detect three reciprocal competitive inter- actions among the three subreddits that focus on real es- tate. The edges from r/fatfire to r/commercial ..."}
+{"idx": 2, "title": "DEBAGREEMENT: A comment-reply dataset for (dis) ...", "date": "", "ddg_snippet": "by J Pougué-Biyong · Cited by 42 — We pull data from three subreddits of social movements r/Brexit, r/BlackLivesMatter, r/ climate , and two subreddits of political affiliations r/Republican,.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=udVUN__gFO", "content": "by J Pougué-Biyong · Cited by 42 — We pull data from three subreddits of social movements r/Brexit, r/BlackLivesMatter, r/ climate , and two subreddits of political affiliations r/Republican,."}
+{"idx": 3, "title": "WOAH 2021 The 5th Workshop on Online Abuse and ...", "date": "", "ddg_snippet": "6 Aug 2021 — ... Reddit , more specifically, from three subreddits r/RoastMe,. 1Source: https://www.stopbullying.gov/resources/facts. Figure 1: Examples of ... 242 pages", "subpage_snippet": "", "source": "aclanthology.org", "link": "https://aclanthology.org/2021.woah-1.pdf", "content": "6 Aug 2021 — ... Reddit , more specifically, from three subreddits r/RoastMe,. 1Source: https://www.stopbullying.gov/resources/facts. Figure 1: Examples of ... 242 pages"}
+{"idx": 4, "title": "Health Information Processing", "date": "", "ddg_snippet": "SuicideED [ 99]: Researchers selected three subreddits with a high propor- tion of suicide-related posts (r/SuicideWatch, r/depression, and r/mentalhealth) ...", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/content/pdf/10.1007/978-981-96-3755-3.pdf", "content": "SuicideED [ 99]: Researchers selected three subreddits with a high propor- tion of suicide-related posts (r/SuicideWatch, r/depression, and r/mentalhealth) ..."}
+{"idx": 5, "title": "Aligning AI Systems with User Needs and Stakeholder Values ...", "date": "", "ddg_snippet": "by Y Cao · 2024 — Our analysis shows the majority of moderation rules from the three subreddits (approximately 80%) are unrelated to toxicity detection, with nearly 70% lacking ...", "subpage_snippet": "", "source": "drum.lib.umd.edu", "link": "https://drum.lib.umd.edu/bitstreams/a8326a37-9c45-42e5-9ce7-be24b31d2541/download", "content": "by Y Cao · 2024 — Our analysis shows the majority of moderation rules from the three subreddits (approximately 80%) are unrelated to toxicity detection, with nearly 70% lacking ..."}
+{"idx": 6, "title": "© 2020 Kanika Narang - IDEALS", "date": "", "ddg_snippet": "by K Narang · 2020 — On all three subreddits , the model converges after only about six iterations indicating our model is quick to approximate a solution. In general, the.", "subpage_snippet": "", "source": "www.ideals.illinois.edu", "link": "https://www.ideals.illinois.edu/items/115592/bitstreams/378146/stream", "content": "by K Narang · 2020 — On all three subreddits , the model converges after only about six iterations indicating our model is quick to approximate a solution. In general, the."}
+{"idx": 7, "title": "WOAH 2022 The Sixth Workshop on Online Abuse and ...", "date": "", "ddg_snippet": "14 Jul 2022 — ... three subreddits by cosine similarity to each subreddit in bold (experiments run on top five). (BERT) Our second classifier is BERT. We use. 276 pages", "subpage_snippet": "", "source": "aclanthology.org", "link": "https://aclanthology.org/2022.woah-1.pdf", "content": "14 Jul 2022 — ... three subreddits by cosine similarity to each subreddit in bold (experiments run on top five). (BERT) Our second classifier is BERT. We use. 276 pages"}
+{"idx": 8, "title": "Computational Science and Computational Intelligence", "date": "", "ddg_snippet": "ining trends across all three subreddits , as well as individually, the study sought to understand how mental health discussions evolve within Red- dit's ...", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/content/pdf/10.1007/978-3-031-95127-5.pdf", "content": "ining trends across all three subreddits , as well as individually, the study sought to understand how mental health discussions evolve within Red- dit's ..."}
+{"idx": 9, "title": "AFRL-RI-RS-TR-2018-101 - DTIC", "date": "", "ddg_snippet": "by O Rambow · 2018 · Cited by 2 — In experiments on three subreddits , we find that context-dependent gating indeed makes text features more useful for prediction (Fang et al., 2016). In the ...", "subpage_snippet": "", "source": "apps.dtic.mil", "link": "https://apps.dtic.mil/sti/pdfs/AD1051862.pdf", "content": "by O Rambow · 2018 · Cited by 2 — In experiments on three subreddits , we find that context-dependent gating indeed makes text features more useful for prediction (Fang et al., 2016). In the ..."}

data/sampled_jsons/AERO_Enhancing_Sharding_Blockchain_via_Deep_Reinforcement_Learning_for_Account_Migration_equations_r.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Book by the seat | The Private Jet Experience | Aero ™", "date": "", "ddg_snippet": "A beyond first-class experience awaits, no membership required. Aero effortlessly merges the worlds of hospitality, design, and travel. Enjoy spacious premium seats, private terminals with no lines or crowds, a dedicated concierge team, and curated amenities.", "subpage_snippet": "", "source": "aero.com", "link": "https://aero.com/", "content": "A beyond first-class experience awaits, no membership required. Aero effortlessly merges the worlds of hospitality, design, and travel. Enjoy spacious premium seats, private terminals with no lines or crowds, a dedicated concierge team, and curated amenities."}
+{"idx": 1, "title": "Seats. aero - Home", "date": "", "ddg_snippet": "Seats. aero is the fastest search engine for award travel. Explore availability across entire regions, search with instant results, create free alerts and more to find the best flights for your points.", "subpage_snippet": "", "source": "seats.aero", "link": "https://seats.aero/", "content": "Seats. aero is the fastest search engine for award travel. Explore availability across entire regions, search with instant results, create free alerts and more to find the best flights for your points."}
+{"idx": 2, "title": "AERO Definition & Meaning - Merriam-Webster", "date": "", "ddg_snippet": "The meaning of AERO is of or relating to aircraft or aeronautics. How to use aero in a sentence.", "subpage_snippet": "", "source": "www.merriam-webster.com", "link": "https://www.merriam-webster.com/dictionary/aero", "content": "The meaning of AERO is of or relating to aircraft or aeronautics. How to use aero in a sentence."}
+{"idx": 3, "title": "Mil-Spec AR Parts, Components & Accessories | Aero Precision", "date": "", "ddg_snippet": "Aero Precision manufacturers mil-spec parts, including AR15 & AR10 uppers, lowers, rifles, handguards, barrels, scope mounts & more.", "subpage_snippet": "", "source": "www.aeroprecisionusa.com", "link": "https://www.aeroprecisionusa.com/", "content": "Aero Precision manufacturers mil-spec parts, including AR15 & AR10 uppers, lowers, rifles, handguards, barrels, scope mounts & more."}
+{"idx": 4, "title": "Aero End of Support FAQs - Adobe Inc.", "date": "", "ddg_snippet": "Aug 7, 2025 · Adobe Aero will be discontinued on iOS, Android, and Creative Cloud Desktop effective November 6, 2025. Existing users can access the application and download their content until December 3, 2025.", "subpage_snippet": "", "source": "helpx.adobe.com", "link": "https://helpx.adobe.com/aero/aero-end-of-support-faq.html", "content": "Aug 7, 2025 · Adobe Aero will be discontinued on iOS, Android, and Creative Cloud Desktop effective November 6, 2025. Existing users can access the application and download their content until December 3, 2025."}
+{"idx": 5, "title": "Trailer Tarp Systems, Accessories | Aero Industries, Inc.", "date": "", "ddg_snippet": "Aero Industries, Inc. is a global leader in the manufacturing of trailer tarp systems and accessories. Founded in 1944, the company’s heritage is rooted in customer service and innovation.", "subpage_snippet": "", "source": "www.aeroindustries.com", "link": "https://www.aeroindustries.com/", "content": "Aero Industries, Inc. is a global leader in the manufacturing of trailer tarp systems and accessories. Founded in 1944, the company’s heritage is rooted in customer service and innovation."}
+{"idx": 6, "title": "Aircraft Fleet | Aero ™", "date": "", "ddg_snippet": "\"I’ve done a lot of traveling in my life, and I’ve never experienced transportation quite like Aero . Exceptional service, luxurious terminal, high quality amenities, top notch staff.\"", "subpage_snippet": "", "source": "aero.com", "link": "https://aero.com/fleet", "content": "\"I’ve done a lot of traveling in my life, and I’ve never experienced transportation quite like Aero . Exceptional service, luxurious terminal, high quality amenities, top notch staff.\""}
+{"idx": 7, "title": "Explore Flights from Los Angeles | Aero ™", "date": "", "ddg_snippet": "Aero is a premium jet service that provides the time-saving convenience and world-class service of private air travel, booked by the seat with no membership required.", "subpage_snippet": "", "source": "aero.com", "link": "https://aero.com/flights?adults=1&infants=0&petInSeat=0&petUnderSeat=0&serviceAnimal=0&type=roundtrip", "content": "Aero is a premium jet service that provides the time-saving convenience and world-class service of private air travel, booked by the seat with no membership required."}
+{"idx": 8, "title": "Our Story | The Private Jet Experience | Aero ™", "date": "", "ddg_snippet": "Aero was created to bring the magic back to flying. We aim to deliver an unforgettable, radically better travel experience. Learn more about how we started, our leadership, and our vision for the future.", "subpage_snippet": "", "source": "aero.com", "link": "https://aero.com/our-story", "content": "Aero was created to bring the magic back to flying. We aim to deliver an unforgettable, radically better travel experience. Learn more about how we started, our leadership, and our vision for the future."}
+{"idx": 9, "title": "Flights To and From Los Angeles | The Private Jet Experience | ...", "date": "", "ddg_snippet": "Wherever you choose to wander, fly in signature Aero style. Aero ’s book-by-the-seat jet service connects travelers in Los Angeles to sought-after leisure destinations and the world's largest entertainment and sporting events.", "subpage_snippet": "", "source": "aero.com", "link": "https://aero.com/destinations/na/los-angeles", "content": "Wherever you choose to wander, fly in signature Aero style. Aero ’s book-by-the-seat jet service connects travelers in Los Angeles to sought-after leisure destinations and the world's largest entertainment and sporting events."}

data/sampled_jsons/ATA_O(log_K)_regret_bound_Theorem_6.1_upper_bound_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "No Weighted- Regret Learning", "date": "", "ddg_snippet": "First , we prove regret bounds also against an adaptive adversary that can choose the cost function in response to the players’ past actions.The following theorem establishes the expected regret bound for FKM with delays.", "subpage_snippet": "", "source": "jmlr.org", "link": "https://jmlr.org/papers/volume23/20-411/20-411.pdf", "content": "First , we prove regret bounds also against an adaptive adversary that can choose the cost function in response to the players’ past actions.The following theorem establishes the expected regret bound for FKM with delays."}
+{"idx": 1, "title": "Improved Regret of Linear Ensemble Sampling", "date": "", "ddg_snippet": "Proof of Regret Bound in Theorem 1.Our result is the first to establish O (d3/2 T ) regret for linear ensemble sampling with an ensemble size sublinear in T , improving the previous bound by the factor d while maintaining the ensemble size to be logarithmic in T .", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=6SSzMq3WTn", "content": "Proof of Regret Bound in Theorem 1.Our result is the first to establish O (d3/2 T ) regret for linear ensemble sampling with an ensemble size sublinear in T , improving the previous bound by the factor d while maintaining the ensemble size to be logarithmic in T ."}
+{"idx": 2, "title": "Batch-Size Independent Regret Bounds for", "date": "", "ddg_snippet": "Regret Analysis for CMAB-T with TPVM Bounded Smoothness (Proofs Related to Theorem 1)Useful Concentration Bounds , Definitions and Inequalities", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2208.14837", "content": "Regret Analysis for CMAB-T with TPVM Bounded Smoothness (Proofs Related to Theorem 1)Useful Concentration Bounds , Definitions and Inequalities"}
+{"idx": 3, "title": "Bourgain’s Theorem", "date": "", "ddg_snippet": "log n. values of j, the trivial union bound implies that the probability that any one of these values of. j.Proof Theorem 6 .10. We will rst prove the theorem for p = 2. We give an upper bound on f (x) − f (y) 2. Recall that K = 576 log 2 n is the number of dimensions of the map f .", "subpage_snippet": "", "source": "home.ttic.edu", "link": "https://home.ttic.edu/~harry/teaching/pdf/lecture3.pdf", "content": "log n. values of j, the trivial union bound implies that the probability that any one of these values of. j.Proof Theorem 6 .10. We will rst prove the theorem for p = 2. We give an upper bound on f (x) − f (y) 2. Recall that K = 576 log 2 n is the number of dimensions of the map f ."}
+{"idx": 4, "title": "Constant regret for sequence prediction with limited advice", "date": "", "ddg_snippet": "following theorem presents a constant bound on the expected regret , with a sketch of the proof.binary tree, it is possible to update these quantities for each new observation and to draw from pˆ with a O ( log K ) cost only.", "subpage_snippet": "", "source": "proceedings.mlr.press", "link": "https://proceedings.mlr.press/v201/saad23a/saad23a.pdf", "content": "following theorem presents a constant bound on the expected regret , with a sketch of the proof.binary tree, it is possible to update these quantities for each new observation and to draw from pˆ with a O ( log K ) cost only."}
+{"idx": 5, "title": "On the Minimax Regret for Contextual Linear", "date": "", "ddg_snippet": "Table 1 : Upper bounds ( O (·)) and lower bounds (Ω(·)) on regret for three problems. BwE: multi-armed bandit with expert advice, LB: linear bandit, CLB: contextual linear bandit. Note that the regret upper bound of O (d T log T ) by Liu et al.", "subpage_snippet": "", "source": "proceedings.neurips.cc", "link": "https://proceedings.neurips.cc/paper_files/paper/2024/file/7169e48889a07662f4168e3911c4a69e-Paper-Conference.pdf", "content": "Table 1 : Upper bounds ( O (·)) and lower bounds (Ω(·)) on regret for three problems. BwE: multi-armed bandit with expert advice, LB: linear bandit, CLB: contextual linear bandit. Note that the regret upper bound of O (d T log T ) by Liu et al."}
+{"idx": 6, "title": "2257_batch_size_independent_ regret", "date": "", "ddg_snippet": "gives batch-size independent regret bounds that totally removes O ( log K ) in the leading term.", "subpage_snippet": "", "source": "www.cse.cuhk.edu.hk", "link": "https://www.cse.cuhk.edu.hk/~cslui/PUBLICATION/Neurips-22.pdf", "content": "gives batch-size independent regret bounds that totally removes O ( log K ) in the leading term."}
+{"idx": 7, "title": "Exploration by Optimization with Hybrid Regularizers: Logarithmic...", "date": "", "ddg_snippet": "The bound for adversarial environments is O ( log k ) times smaller than the existing regret bound . with the BOBW guarantee.The regret upper bound for stochastic environments in Tsuchiya et al.", "subpage_snippet": "", "source": "hal.science", "link": "https://hal.science/hal-04869940v1/document", "content": "The bound for adversarial environments is O ( log k ) times smaller than the existing regret bound . with the BOBW guarantee.The regret upper bound for stochastic environments in Tsuchiya et al."}
+{"idx": 8, "title": "nt.number theory - Upper bound for product of... - MathOverflow", "date": "", "ddg_snippet": "Is $p(n) = O (\\ log ^{ k }(n))$ for some constant $k$? Thanks in advance!Sorted by: Reset to default. Highest score (default) Date modified (newest first ) Date created (oldest first ).", "subpage_snippet": "", "source": "mathoverflow.net", "link": "https://mathoverflow.net/questions/256451/upper-bound-for-product-of-exponents-of-prime-factorization", "content": "Is $p(n) = O (\\ log ^{ k }(n))$ for some constant $k$? Thanks in advance!Sorted by: Reset to default. Highest score (default) Date modified (newest first ) Date created (oldest first )."}
+{"idx": 9, "title": "Stochastic Online Learning with Feedback Graphs", "date": "", "ddg_snippet": "Proof of Theorem 5.2. Regret lower bounds .algorithm whose pseudo- regret is quasi-optimal, both in nite-time and asymptotically and can be upper bounded by O (c∗ log (T ) + d∗). 2 Learning scenario.", "subpage_snippet": "", "source": "cs.nyu.edu", "link": "https://cs.nyu.edu/~mohri/pub/sfg.pdf", "content": "Proof of Theorem 5.2. Regret lower bounds .algorithm whose pseudo- regret is quasi-optimal, both in nite-time and asymptotically and can be upper bounded by O (c∗ log (T ) + d∗). 2 Learning scenario."}

data/sampled_jsons/A_Three-Branch_Checks-and-Balances_Framework_Limitations_contextual_drift_scalability.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "“Lost-in-the-Later” : Framework for Quantifying Contextual", "date": "", "ddg_snippet": "We introduce CoPE 1 1 1 https://github.com/PortNLP/CoPE , a novel evaluation framework that systematically measures contextual knowledge (CK) and ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2507.05424v1", "content": "We introduce CoPE 1 1 1 https://github.com/PortNLP/CoPE , a novel evaluation framework that systematically measures contextual knowledge (CK) and ..."}
+{"idx": 1, "title": "The Shrinking Office: 3 steps to video and voice enablement -", "date": "", "ddg_snippet": "Discover how the new Ansys HFSS-IC can revolutionize the simulation of complex interposers and 3DIC systems, improving design cycles and product ...", "subpage_snippet": "", "source": "www.erp-spain.com", "link": "https://www.erp-spain.com/webinar/10832/the-shrinking-office-3-steps-to-video-and-voice-enablement/polycom", "content": "Discover how the new Ansys HFSS-IC can revolutionize the simulation of complex interposers and 3DIC systems, improving design cycles and product ..."}
+{"idx": 2, "title": "(PDF) AudioSet-Tools: A Python Framework for Taxonomy-Aware", "date": "", "ddg_snippet": "This work presents AudioSet-Tools, a modular and composable Python framework designed to streamline the creation of task-specific datasets derived ...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/392984446_AudioSet-Tools_A_Python_Framework_for_Taxonomy-Aware_AudioSet_Curation_and_Reproducible_Audio_Research", "content": "This work presents AudioSet-Tools, a modular and composable Python framework designed to streamline the creation of task-specific datasets derived ..."}
+{"idx": 3, "title": "RL-Finetuned LLMs for Privacy-Preserving Synthetic Rewriting", "date": "", "ddg_snippet": "To address the challenging issue of balancing user privacy and data utility, we propose a reinforcement learning framework that fine-tunes a large ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2508.19286v1", "content": "To address the challenging issue of balancing user privacy and data utility, we propose a reinforcement learning framework that fine-tunes a large ..."}
+{"idx": 4, "title": "Interpretable AI for Time-Series: Multi-Model Heatmap Fusion", "date": "", "ddg_snippet": "... architectures that balance performance with explainability, culminating in recent advances such as ”Deep learning and pattern-based methodology for ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2507.00234v1", "content": "... architectures that balance performance with explainability, culminating in recent advances such as ”Deep learning and pattern-based methodology for ..."}
+{"idx": 5, "title": "MI9 - Agent Intelligence Protocol: Runtime Governance for", "date": "", "ddg_snippet": "Building on this foundation, recent work has mapped agentic system taxonomies [ 31 , 15 ] , governance frameworks [ 9 , 30 , 8 , 17 ] , and ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2508.03858v1", "content": "Building on this foundation, recent work has mapped agentic system taxonomies [ 31 , 15 ] , governance frameworks [ 9 , 30 , 8 , 17 ] , and ..."}
+{"idx": 6, "title": "UnIT: Scalable Unstructured Inference-Time Pruning for", "date": "", "ddg_snippet": "Demonstrated on the MSP430 microcontroller, UnIT achieves 11.02% to 82.03% MAC reduction, 27.30% to 84.19% faster inference, and 27.33% to 84.38 ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2507.07885v1", "content": "Demonstrated on the MSP430 microcontroller, UnIT achieves 11.02% to 82.03% MAC reduction, 27.30% to 84.19% faster inference, and 27.33% to 84.38 ..."}
+{"idx": 7, "title": "Tags | SoftwarePatternsLexicon.com", "date": "", "ddg_snippet": "Advanced design patterns, best practices, and integration ... Build robust, scalable, and efficient stream processing systems. ... All of categories.", "subpage_snippet": "", "source": "softwarepatternslexicon.com", "link": "https://softwarepatternslexicon.com/tags/", "content": "Advanced design patterns, best practices, and integration ... Build robust, scalable, and efficient stream processing systems. ... All of categories."}
+{"idx": 8, "title": "“Decoding the Scope: Is Judiciary State Covered Under", "date": "", "ddg_snippet": "They are the players in a complex game of checks and balances , ensuring that power is distributed, and no single entity holds sway unchecked.", "subpage_snippet": "", "source": "www.judgedumas2021.com", "link": "https://www.judgedumas2021.com/decoding-the-scope-is-judiciary-state-covered-under-article-12/", "content": "They are the players in a complex game of checks and balances , ensuring that power is distributed, and no single entity holds sway unchecked."}
+{"idx": 9, "title": "Top Talla Alternatives in 2025", "date": "", "ddg_snippet": "Retrieval-augmented generation (RAG) for accurate, contextual , and up-to-date conversational answers around the clock, grounded in your company s ...", "subpage_snippet": "", "source": "slashdot.org", "link": "https://slashdot.org/software/p/Talla/alternatives", "content": "Retrieval-augmented generation (RAG) for accurate, contextual , and up-to-date conversational answers around the clock, grounded in your company s ..."}

data/sampled_jsons/Adaptive_Task_Allocation_for_Efficient_Resource_Management_in_Distributed_Machine_Learning_Equation_.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "ATA: Adaptive Task Allocation for Efficient Resource Management in ...", "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. Through rigorous theoretical analysis, we show that ATAidentifies the optimal task allocation and performs comparably to methods with prior knowledge of computation times.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2502.00775v1", "content": "In this paper, we propose ATA(Adaptive Task Allocation ), a method that adapts to heterogeneous and random distributions of worker computation times. Through rigorous theoretical analysis, we show that ATAidentifies the optimal task allocation and performs comparably to methods with prior knowledge of computation times."}
+{"idx": 1, "title": "ATA: Adaptive Task Allocation for Efficient Resource Management in ...", "date": "", "ddg_snippet": "The general task allocation problem in parallel stochastic optimization leads to resource wastefulness, and addressing it can improve efficiency across various distributed machine learning methods.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=1BaC3AdG1i", "content": "The general task allocation problem in parallel stochastic optimization leads to resource wastefulness, and addressing it can improve efficiency across various distributed machine learning methods."}
+{"idx": 2, "title": "PDF Adaptive Task-Oriented Resource Allocation for Large Dynamic Workflows ...", "date": "", "ddg_snippet": "In this paper, we (1) argue for the need of an adaptive resource allocator capable of allocating tasks at runtime and adjusting to random fluctuations and abrupt changes in a dynamic workflow without requiring any prior knowledge, and (2) introduce Greedy Bucketing and Exhaustive Bucketing: two robust, online, general-purpose, and prior-free allocation algorithms capable of producing quality ...", "subpage_snippet": "", "source": "ccl.cse.nd.edu", "link": "https://ccl.cse.nd.edu/research/papers/adaptive-ipdps-2024.pdf", "content": "In this paper, we (1) argue for the need of an adaptive resource allocator capable of allocating tasks at runtime and adjusting to random fluctuations and abrupt changes in a dynamic workflow without requiring any prior knowledge, and (2) introduce Greedy Bucketing and Exhaustive Bucketing: two robust, online, general-purpose, and prior-free allocation algorithms capable of producing quality ..."}
+{"idx": 3, "title": "ATA: Adaptive Task Allocation for Eficient Resource Management in ...", "date": "", "ddg_snippet": "Abstract Asynchronous methods are fundamental for par-allelizing computations in distributed machine learning . They aim to accelerate training by fully utilizing all available resources . However, their greedy approach can lead to ineficiencies using more computation than required, especially when computation times vary across devices. If the computation times were known in advance, train-ing ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2502.00775", "content": "Abstract Asynchronous methods are fundamental for par-allelizing computations in distributed machine learning . They aim to accelerate training by fully utilizing all available resources . However, their greedy approach can lead to ineficiencies using more computation than required, especially when computation times vary across devices. If the computation times were known in advance, train-ing ..."}
+{"idx": 4, "title": "Dynamic priority-based task scheduling and adaptive resource allocation ...", "date": "", "ddg_snippet": "By implementing dynamic priority-based task scheduling and adaptive resource allocation algorithms, our methodology enhances the handling of resource requests between end devices, edge nodes (ENs), and the cloud. These innovations focus on reducing latency, optimizing resource utilization, and improving overall system performance.", "subpage_snippet": "", "source": "www.sciencedirect.com", "link": "https://www.sciencedirect.com/science/article/pii/S2590123025004232", "content": "By implementing dynamic priority-based task scheduling and adaptive resource allocation algorithms, our methodology enhances the handling of resource requests between end devices, edge nodes (ENs), and the cloud. These innovations focus on reducing latency, optimizing resource utilization, and improving overall system performance."}
+{"idx": 5, "title": "ATA: Adaptive Task Allocation for Efficient Resource Management in ...", "date": "", "ddg_snippet": "View recent discussion. Abstract: Asynchronous methods are fundamental for parallelizing computations in distributed machine learning . They aim to accelerate training by fully utilizing all available resources . However, their greedy approach can lead to inefficiencies using more computation than required, especially when computation times vary across devices. If the computation times were ...", "subpage_snippet": "", "source": "www.alphaxiv.org", "link": "https://www.alphaxiv.org/overview/2502.00775v2", "content": "View recent discussion. Abstract: Asynchronous methods are fundamental for parallelizing computations in distributed machine learning . They aim to accelerate training by fully utilizing all available resources . However, their greedy approach can lead to inefficiencies using more computation than required, especially when computation times vary across devices. If the computation times were ..."}
+{"idx": 6, "title": "Adaptive Task-Oriented Resource Allocation for Large Dynamic Workflows ...", "date": "", "ddg_snippet": "Adaptive Task -Oriented Resource Allocation for Large Dynamic Workflows on Opportunistic Resources Abstract: Dynamic workflow management systems offer a solution to the problem of distributing a local application by packaging individual computations and their dependencies on-the-fly into tasks executable on remote workers.", "subpage_snippet": "", "source": "ieeexplore.ieee.org", "link": "https://ieeexplore.ieee.org/document/10579206", "content": "Adaptive Task -Oriented Resource Allocation for Large Dynamic Workflows on Opportunistic Resources Abstract: Dynamic workflow management systems offer a solution to the problem of distributing a local application by packaging individual computations and their dependencies on-the-fly into tasks executable on remote workers."}
+{"idx": 7, "title": "PDF Learning with Adaptive Resource Allocation - NJU", "date": "", "ddg_snippet": "Abstract The study of machine learning under limited re-sources has gathered increasing attention, con-sidering improving the learning eficiency and effectiveness with budgeted resources . However, previous efforts mainly focus on single learning task , and a common resource -limited scenario is less explored: to handle multiple time-constrained learning tasks concurrently with budgeted com ...", "subpage_snippet": "", "source": "www.lamda.nju.edu.cn", "link": "https://www.lamda.nju.edu.cn/zhaop/publication/ICML'24_LARA.pdf", "content": "Abstract The study of machine learning under limited re-sources has gathered increasing attention, con-sidering improving the learning eficiency and effectiveness with budgeted resources . However, previous efforts mainly focus on single learning task , and a common resource -limited scenario is less explored: to handle multiple time-constrained learning tasks concurrently with budgeted com ..."}
+{"idx": 8, "title": "ATA: Adaptive Task Allocation for Efficient Resource Management in ...", "date": "", "ddg_snippet": "Abstract summary: Asynchronous methods are fundamental for parallelizing computations in distributed machine learning .We propose ATA ( Adaptive Task Allocation ), a method that adapts to heterogeneous and random distributions of computation times.We show that ATA identifies the optimal task allocation and performs comparably to methods with ...", "subpage_snippet": "", "source": "fugumt.com", "link": "https://fugumt.com/fugumt/paper_check/2502.00775v2_enmode", "content": "Abstract summary: Asynchronous methods are fundamental for parallelizing computations in distributed machine learning .We propose ATA ( Adaptive Task Allocation ), a method that adapts to heterogeneous and random distributions of computation times.We show that ATA identifies the optimal task allocation and performs comparably to methods with ..."}
+{"idx": 9, "title": "Unlocking Efficiency: How Adaptive Task Allocation Revolutionizes ...", "date": "", "ddg_snippet": "In the rapidly evolving world of artificial intelligence, distributed machine learning stands as a cornerstone for future developments. Yet, as industries adopt parallelized systems to enhance machine learning operations, the challenge of inefficient resource allocation becomes glaring. Enter Adaptive Task Allocation (ATA), a sophisticated solution designed to address this very problem.", "subpage_snippet": "", "source": "www.lumafeed.com", "link": "https://www.lumafeed.com/article/9d4d8fe1-d044-4756-99ca-33ab376e4e05", "content": "In the rapidly evolving world of artificial intelligence, distributed machine learning stands as a cornerstone for future developments. Yet, as industries adopt parallelized systems to enhance machine learning operations, the challenge of inefficient resource allocation becomes glaring. Enter Adaptive Task Allocation (ATA), a sophisticated solution designed to address this very problem."}

data/sampled_jsons/Attention_Is_All_You_Need_Vaswani_et_al_2017_abstract.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Attention - Wikipedia", "date": "", "ddg_snippet": "Attention or focus, is the concentration of awareness on some phenomenon to the exclusion of other stimuli. [1] It is the selective concentration on discrete information, either subjectively or objectively.", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/Attention", "content": "Attention or focus, is the concentration of awareness on some phenomenon to the exclusion of other stimuli. [1] It is the selective concentration on discrete information, either subjectively or objectively."}
+{"idx": 1, "title": "ATTENTION Definition & Meaning - Merriam-Webster", "date": "", "ddg_snippet": "The meaning of ATTENTION is the act or state of applying the mind to something. How to use attention in a sentence.", "subpage_snippet": "", "source": "www.merriam-webster.com", "link": "https://www.merriam-webster.com/dictionary/attention", "content": "The meaning of ATTENTION is the act or state of applying the mind to something. How to use attention in a sentence."}
+{"idx": 2, "title": "ATTENTION | English meaning - Cambridge Dictionary", "date": "", "ddg_snippet": "ATTENTION definition: 1. notice, thought, or interest: 2. to make someone notice you: 3. to watch, listen to, or think…. Learn more.", "subpage_snippet": "", "source": "dictionary.cambridge.org", "link": "https://dictionary.cambridge.org/dictionary/english/attention", "content": "ATTENTION definition: 1. notice, thought, or interest: 2. to make someone notice you: 3. to watch, listen to, or think…. Learn more."}
+{"idx": 3, "title": "ATTENTION Definition & Meaning | Dictionary .com", "date": "", "ddg_snippet": "Attention definition: the act or faculty of attending, especially by directing the mind to an object.. See examples of ATTENTION used in a sentence.", "subpage_snippet": "", "source": "www.dictionary.com", "link": "https://www.dictionary.com/browse/attention", "content": "Attention definition: the act or faculty of attending, especially by directing the mind to an object.. See examples of ATTENTION used in a sentence."}
+{"idx": 4, "title": "Attention ( Stanford Encyclopedia of Philosophy )", "date": "", "ddg_snippet": "Sep 8, 2009 · Attention is involved in the selective directedness of our mental lives. The nature of this selectivity is one of the principal points of disagreement between the extant theories of attention . Some of the most influential theories treat the selectivity of attention as resulting from limitations in the brain’s capacity to process the complex properties of multiple perceivable stimuli. Other ...", "subpage_snippet": "", "source": "plato.stanford.edu", "link": "https://plato.stanford.edu/entries/attention/", "content": "Sep 8, 2009 · Attention is involved in the selective directedness of our mental lives. The nature of this selectivity is one of the principal points of disagreement between the extant theories of attention . Some of the most influential theories treat the selectivity of attention as resulting from limitations in the brain’s capacity to process the complex properties of multiple perceivable stimuli. Other ..."}
+{"idx": 5, "title": "Attention - definition of attention by The Free Dictionary", "date": "", "ddg_snippet": "attention If you give someone or something your attention , you look at them, listen to them, or think about them carefully. When he had their attention , he began his lecture. He turned his attention back to his magazine. You can also say that someone pays attention to something.", "subpage_snippet": "", "source": "www.thefreedictionary.com", "link": "https://www.thefreedictionary.com/attention", "content": "attention If you give someone or something your attention , you look at them, listen to them, or think about them carefully. When he had their attention , he began his lecture. He turned his attention back to his magazine. You can also say that someone pays attention to something."}
+{"idx": 6, "title": "How Psychologists Define Attention - Verywell Mind", "date": "", "ddg_snippet": "Oct 31, 2024 · Attention is the ability to actively process specific information in the environment while tuning out other details. It's like a highlighter or spotlight and makes what we focus on stand out.", "subpage_snippet": "", "source": "www.verywellmind.com", "link": "https://www.verywellmind.com/what-is-attention-2795009", "content": "Oct 31, 2024 · Attention is the ability to actively process specific information in the environment while tuning out other details. It's like a highlighter or spotlight and makes what we focus on stand out."}
+{"idx": 7, "title": "Attention - Psychology Today", "date": "", "ddg_snippet": "Attention can help us focus our awareness on a particular aspect of our environment, important decisions, or the thoughts in our head.", "subpage_snippet": "", "source": "www.psychologytoday.com", "link": "https://www.psychologytoday.com/us/basics/attention", "content": "Attention can help us focus our awareness on a particular aspect of our environment, important decisions, or the thoughts in our head."}
+{"idx": 8, "title": "Attention | Definition, Theories, Aspects, & Facts | Britannica", "date": "", "ddg_snippet": "Attention is awareness of the here and now in a focal and perceptive way. For early psychologists, such as Edward Bradford Titchener, attention determined the content of consciousness and influenced the quality of conscious experience.", "subpage_snippet": "", "source": "www.britannica.com", "link": "https://www.britannica.com/science/attention", "content": "Attention is awareness of the here and now in a focal and perceptive way. For early psychologists, such as Edward Bradford Titchener, attention determined the content of consciousness and influenced the quality of conscious experience."}
+{"idx": 9, "title": "attention - WordReference.com Dictionary of English", "date": "", "ddg_snippet": "[uncountable] thoughtful consideration with a view to action: I promise to give that matter my personal attention . [uncountable] kindness, courtesy, or high regard: lavished attention on the guests.", "subpage_snippet": "", "source": "www.wordreference.com", "link": "https://www.wordreference.com/definition/attention", "content": "[uncountable] thoughtful consideration with a view to action: I promise to give that matter my personal attention . [uncountable] kindness, courtesy, or high regard: lavished attention on the guests."}

data/sampled_jsons/Autoregressive_models_are_among_the_best_performing_neural_density_estimators.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Mattress Toppers For Adjustable Beds | Costco", "date": "", "ddg_snippet": "Discover an array of mattress toppers for adjustable beds designed to enhance your sleep experience and complement your unique setup. Whether you’re seeking an extra layer of comfort or looking to refresh your current mattress, these toppers are crafted to flex and move seamlessly with adjustable bed frames. Explore a variety of sizes and materials to find the perfect fit for your bedroom ...", "subpage_snippet": "", "source": "www.costco.com", "link": "https://www.costco.com/opt/mattress-toppers-for-adjustable-beds", "content": "Discover an array of mattress toppers for adjustable beds designed to enhance your sleep experience and complement your unique setup. Whether you’re seeking an extra layer of comfort or looking to refresh your current mattress, these toppers are crafted to flex and move seamlessly with adjustable bed frames. Explore a variety of sizes and materials to find the perfect fit for your bedroom ..."}
+{"idx": 1, "title": "Mattresses | Costco", "date": "", "ddg_snippet": "Considered the best mattress for side sleepers and people with back pain, a memory foam mattress or mattress in a box is a popular choice. It molds to your contours, offering superior pressure point relief. Costco also has gel memory foam mattresses, which have an added cooling effect. For truly personalized comfort, we have adjustable mattresses.", "subpage_snippet": "", "source": "www.costco.com", "link": "https://www.costco.com/mattresses.html", "content": "Considered the best mattress for side sleepers and people with back pain, a memory foam mattress or mattress in a box is a popular choice. It molds to your contours, offering superior pressure point relief. Costco also has gel memory foam mattresses, which have an added cooling effect. For truly personalized comfort, we have adjustable mattresses."}
+{"idx": 2, "title": "Adjustable King Size Mattresses | Costco", "date": "", "ddg_snippet": "Sleep Science 12\" iFlip Sonoma Memory Foam Mattress with Adjustable Power Base 5-layer 2-sided Mattress offers dual comfort levels: Medium Soft and Medium Firm Enhanced Airflow system created by the Opti-Air Memory Foam and Air Channel Base Adjustable base including isolated power Pillow-Tilt function Versatile Zero Clearance frame works on all beds, including platform and storage beds Easy to ...", "subpage_snippet": "", "source": "www.costco.com", "link": "https://www.costco.com/king-mattresses.html?refine=||Mattress_Type_attr-Adjustable", "content": "Sleep Science 12\" iFlip Sonoma Memory Foam Mattress with Adjustable Power Base 5-layer 2-sided Mattress offers dual comfort levels: Medium Soft and Medium Firm Enhanced Airflow system created by the Opti-Air Memory Foam and Air Channel Base Adjustable base including isolated power Pillow-Tilt function Versatile Zero Clearance frame works on all beds, including platform and storage beds Easy to ..."}
+{"idx": 3, "title": "Queen Beds & Bed Frames | Costco", "date": "", "ddg_snippet": "Transform the look and function of any bedroom with a new premium-quality bed. A good night’s sleep leaves you feeling refreshed and ready to take on the world, and having the right bed that complements your existing furniture is the first step in creating a relaxing and harmonious space. Choose a standard queen for the guest room, space-saving bunk beds for your child's room, or a ...", "subpage_snippet": "", "source": "www.costco.com", "link": "https://www.costco.com/bedroom-furniture-beds.html?refine=||Bed_Size_attr-Queen", "content": "Transform the look and function of any bedroom with a new premium-quality bed. A good night’s sleep leaves you feeling refreshed and ready to take on the world, and having the right bed that complements your existing furniture is the first step in creating a relaxing and harmonious space. Choose a standard queen for the guest room, space-saving bunk beds for your child's room, or a ..."}
+{"idx": 4, "title": "Search | Costco", "date": "", "ddg_snippet": "Shop Adjustable Beds Online - Explore a variety of adjustable beds online at Costco for ultimate sleeping comfort.", "subpage_snippet": "", "source": "www.costco.com", "link": "https://www.costco.com/adjustable-beds.html", "content": "Shop Adjustable Beds Online - Explore a variety of adjustable beds online at Costco for ultimate sleeping comfort."}
+{"idx": 5, "title": "Search | Costco", "date": "", "ddg_snippet": "Enhance your sleep experience with a premium Queen Size Mattress from Costco. Browse our selection of firm, medium, and plush mattresses.", "subpage_snippet": "", "source": "www.costco.com", "link": "https://www.costco.com/queen-mattresses.html?mattress-type=adjustable&refine=||Mattress_Type_attr-Adjustable", "content": "Enhance your sleep experience with a premium Queen Size Mattress from Costco. Browse our selection of firm, medium, and plush mattresses."}
+{"idx": 6, "title": "Full Size Mattresses - Costco Wholesale", "date": "", "ddg_snippet": "Full Size Mattresses for Every Budget - From affordable foam mattresses to luxurious hybrid options, we have full size mattresses for all price ranges.", "subpage_snippet": "", "source": "www.costco.com", "link": "https://www.costco.com/full-mattresses.html", "content": "Full Size Mattresses for Every Budget - From affordable foam mattresses to luxurious hybrid options, we have full size mattresses for all price ranges."}
+{"idx": 7, "title": "Foam Mattresses | Costco", "date": "", "ddg_snippet": "Experience comfort with Costco's selection of top-rated foam mattresses. Affordable luxury for a restful sleep awaits!", "subpage_snippet": "", "source": "www.costco.com", "link": "https://www.costco.com/opt/foam-mattresses", "content": "Experience comfort with Costco's selection of top-rated foam mattresses. Affordable luxury for a restful sleep awaits!"}
+{"idx": 8, "title": "Search | Costco", "date": "", "ddg_snippet": "Explore Costco's range of king size mattresses designed for a restful and rejuvenating sleep experience.", "subpage_snippet": "", "source": "www.costco.com", "link": "https://www.costco.com/king-mattresses.html", "content": "Explore Costco's range of king size mattresses designed for a restful and rejuvenating sleep experience."}
+{"idx": 9, "title": "Tempur-Pedic Supreme 11.5” Medium or Firm Mattress with Ergo...", "date": "", "ddg_snippet": "Buy any Tempur-Pedic Supreme Mattress, Mattress and Foundation Set, or Mattress and Ergo Adjustable Base Set & get a $300 Costco Shop Card. Valid on orders placed between 8/04/25 - 9/10/25. Limit 2. Costco Shop Card will arrive within 4-6 weeks of delivery of order via email.", "subpage_snippet": "", "source": "www.costco.com", "link": "https://www.costco.com/tempur-pedic-supreme-11.5”-medium-or-firm-mattress-with-ergo-adjustable-base.product.4000240037.html", "content": "Buy any Tempur-Pedic Supreme Mattress, Mattress and Foundation Set, or Mattress and Ergo Adjustable Base Set & get a $300 Costco Shop Card. Valid on orders placed between 8/04/25 - 9/10/25. Limit 2. Costco Shop Card will arrive within 4-6 weeks of delivery of order via email."}

data/sampled_jsons/BdO4R6XxUH_DCBM_Data-Efficient_Visual_Concept_Bottleneck_Models.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "DCBM : Data - Efficient Visual Concept Bottleneck Models", "date": "", "ddg_snippet": "View a PDF of the paper titled DCBM : Data - Efficient Visual Concept Bottleneck Models , by Katharina Prasse and 4 other authors.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2412.11576", "content": "View a PDF of the paper titled DCBM : Data - Efficient Visual Concept Bottleneck Models , by Katharina Prasse and 4 other authors."}
+{"idx": 1, "title": "DCBM : Data - Efficient Visual Concept Bottleneck Models", "date": "", "ddg_snippet": "DCBM is highly data - efficient in the concept generation phase and equally efficient as other models in the CBM training phase. In Table 5 we show the differences to another data-driven CBM, i.e., DN-CBM (Rao et al., 2024).", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2412.11576", "content": "DCBM is highly data - efficient in the concept generation phase and equally efficient as other models in the CBM training phase. In Table 5 we show the differences to another data-driven CBM, i.e., DN-CBM (Rao et al., 2024)."}
+{"idx": 2, "title": "ICML Poster 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 .", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/46104", "content": "Concept Bottleneck Models (CBMs) enhance the interpretability of neural networks by basing predictions on human-understandable concepts ."}
+{"idx": 3, "title": "DCBM : Data - Efficient Visual Concept Bottleneck Models", "date": "", "ddg_snippet": "We propose Data - efficient CBMs (DCBMs), which reduce the need for large sample sizes during concept generation while preserving interpretability.", "subpage_snippet": "", "source": "synthical.com", "link": "https://synthical.com/article/DCBM:-Data-Efficient-Visual-Concept-Bottleneck-Models-4be352f8-e37e-432a-9849-dc4f3c8c586f", "content": "We propose Data - efficient CBMs (DCBMs), which reduce the need for large sample sizes during concept generation while preserving interpretability."}
+{"idx": 4, "title": "KathPra/ DCBM : Official repo for ICML25 paper: DCBM : Data - Efficient ...", "date": "", "ddg_snippet": "Aligning Visual and Semantic Interpretability through Visually Grounded Concept Bottleneck Models . dcbm _training/: Code for training the DCBM model .", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/KathPra/DCBM", "content": "Aligning Visual and Semantic Interpretability through Visually Grounded Concept Bottleneck Models . dcbm _training/: Code for training the DCBM model ."}
+{"idx": 5, "title": "Margret KEUPER | Professor for Visual Computing | Professor", "date": "", "ddg_snippet": "DCBM : Data - Efficient Visual Concept Bottleneck Models .Unlike diffusion models , AR models enable more efficient and controllable generation with faster inference times, making them especially suitable for data-intensive domains.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/profile/Margret-Keuper", "content": "DCBM : Data - Efficient Visual Concept Bottleneck Models .Unlike diffusion models , AR models enable more efficient and controllable generation with faster inference times, making them especially suitable for data-intensive domains."}
+{"idx": 6, "title": "DWS Area: Web Data Mining, Research | Universität Mannheim", "date": "", "ddg_snippet": "DCBM : Data - Efficient Visual Concept Bottleneck Models .", "subpage_snippet": "", "source": "www.uni-mannheim.de", "link": "https://www.uni-mannheim.de/dws/news-archiv/dws-area-web-data-mining-research/?tx_news_pi1[@widget_0][currentPage]=2&cHash=dbf1436b0d93f36eda0040b2d5b33144", "content": "DCBM : Data - Efficient Visual Concept Bottleneck Models ."}
+{"idx": 7, "title": "Deferring Concept Bottleneck Models : Learning to Defer... | alphaXiv", "date": "", "ddg_snippet": "Abstract: Concept Bottleneck Models (CBMs) are machine learning models that improve interpretability by grounding their predictions on human-understandable concepts , allowing for targeted interventions in their decision-making process.", "subpage_snippet": "", "source": "www.alphaxiv.org", "link": "https://www.alphaxiv.org/fr/overview/2503.16199v1", "content": "Abstract: Concept Bottleneck Models (CBMs) are machine learning models that improve interpretability by grounding their predictions on human-understandable concepts , allowing for targeted interventions in their decision-making process."}
+{"idx": 8, "title": "Sascha Marton - Google Scholar", "date": "", "ddg_snippet": "Concepts , Challenges, and Solutions.2025. DCBM : Data - Efficient Visual Concept Bottleneck Models .", "subpage_snippet": "", "source": "scholar.google.com", "link": "https://scholar.google.com/citations?user=5PQJ3sEAAAAJ&hl=en", "content": "Concepts , Challenges, and Solutions.2025. DCBM : Data - Efficient Visual Concept Bottleneck Models ."}
+{"idx": 9, "title": "openreview.net/profile?id=~Margret_Keuper1", "date": "", "ddg_snippet": "DCBM : Data - Efficient Visual Concept Bottleneck Models .Informed Mixing -- Improving Open Set Recognition with Deep Dynamic Data Augmentation. Jiawen Xu, Margret Keuper.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/profile?id=~Margret_Keuper1", "content": "DCBM : Data - Efficient Visual Concept Bottleneck Models .Informed Mixing -- Improving Open Set Recognition with Deep Dynamic Data Augmentation. Jiawen Xu, Margret Keuper."}

data/sampled_jsons/Beautiful_Soup_library_primary_function.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Beautiful Soup Documentation — Beautiful Soup 4.13.0 documentation", "date": "", "ddg_snippet": "Beautiful Soup is a Python library for parsing HTML and XML documents, offering tools to navigate, search, and modify parse trees.", "subpage_snippet": "", "source": "www.crummy.com", "link": "https://www.crummy.com/software/BeautifulSoup/bs4/doc/", "content": "Beautiful Soup is a Python library for parsing HTML and XML documents, offering tools to navigate, search, and modify parse trees."}
+{"idx": 1, "title": "BeautifulSoup4 Module - Python - GeeksforGeeks", "date": "", "ddg_snippet": "BeautifulSoup4 is a user-friendly Python library designed for parsing HTML and XML documents. It simplifies the process of web scraping by allowing developers to effortlessly navigate, search and modify the parse tree of a webpage. With BeautifulSoup4, we can extract specific elements, attributes and text from complex web pages using intuitive methods. This library abstracts away the ...", "subpage_snippet": "", "source": "www.geeksforgeeks.org", "link": "https://www.geeksforgeeks.org/python/beautifulsoup4-module-python/", "content": "BeautifulSoup4 is a user-friendly Python library designed for parsing HTML and XML documents. It simplifies the process of web scraping by allowing developers to effortlessly navigate, search and modify the parse tree of a webpage. With BeautifulSoup4, we can extract specific elements, attributes and text from complex web pages using intuitive methods. This library abstracts away the ..."}
+{"idx": 2, "title": "BeautifulSoup Cheatsheet with Code Samples | ScrapingAnt", "date": "", "ddg_snippet": "Introduction BeautifulSoup is a powerful library in Python used for web scraping and parsing HTML and XML documents. If you're looking to extract data from web pages, BeautifulSoup is an essential tool to learn. In this tutorial, we will explore the core concepts of BeautifulSoup with detailed code samples and explanations to help you get started.", "subpage_snippet": "", "source": "scrapingant.com", "link": "https://scrapingant.com/blog/beautifulsoup-cheatsheet", "content": "Introduction BeautifulSoup is a powerful library in Python used for web scraping and parsing HTML and XML documents. If you're looking to extract data from web pages, BeautifulSoup is an essential tool to learn. In this tutorial, we will explore the core concepts of BeautifulSoup with detailed code samples and explanations to help you get started."}
+{"idx": 3, "title": "beautifulsoup4 · PyPI", "date": "", "ddg_snippet": "BeautifulSoup4 is a screen-scraping library for parsing HTML and XML documents.", "subpage_snippet": "", "source": "pypi.org", "link": "https://pypi.org/project/beautifulsoup4/", "content": "BeautifulSoup4 is a screen-scraping library for parsing HTML and XML documents."}
+{"idx": 4, "title": "Beautiful Soup - Quick Guide - Online Tutorials Library", "date": "", "ddg_snippet": "Beautiful Soup - Installation Beautiful Soup is a library that makes it easy to scrape information from web pages. It sits atop an HTML or XML parser, providing Pythonic idioms for iterating, searching, and modifying the parse tree. BeautifulSoup package is not a part of Python's standard library , hence it must be installed.", "subpage_snippet": "", "source": "www.tutorialspoint.com", "link": "https://www.tutorialspoint.com/beautiful_soup/beautiful_soup_quick_guide.htm", "content": "Beautiful Soup - Installation Beautiful Soup is a library that makes it easy to scrape information from web pages. It sits atop an HTML or XML parser, providing Pythonic idioms for iterating, searching, and modifying the parse tree. BeautifulSoup package is not a part of Python's standard library , hence it must be installed."}
+{"idx": 5, "title": "10 Most Important Functions in BeautifulSoup - CodersLegacy", "date": "", "ddg_snippet": "Beautiful Soup is a Python library that is commonly used for web scraping purposes. It is a very powerful tool for extracting and parsing data from HTML and XML files. Beautiful Soup provides several functions that make web scraping a lot easier. In this article, we will look at the 10 most important BeautifulSoup functions and how to use them to parse data.", "subpage_snippet": "", "source": "coderslegacy.com", "link": "https://coderslegacy.com/10-most-important-functions-in-beautifulsoup/", "content": "Beautiful Soup is a Python library that is commonly used for web scraping purposes. It is a very powerful tool for extracting and parsing data from HTML and XML files. Beautiful Soup provides several functions that make web scraping a lot easier. In this article, we will look at the 10 most important BeautifulSoup functions and how to use them to parse data."}
+{"idx": 6, "title": "PDF Beautiful Soup Documentation — Beautiful Soup v4.0.0 documentation", "date": "", "ddg_snippet": "Beautiful Soup Documentation Beautiful Soup is a Python library for pulling data out of HTML and XML files. It works with your favorite parser to provide idiomatic ways of navigating, searching, and modifying the parse tree. It commonly saves programmers hours or days of work.", "subpage_snippet": "", "source": "sethc23.github.io", "link": "https://sethc23.github.io/wiki/Python/Beautiful_Soup_Documentation.pdf", "content": "Beautiful Soup Documentation Beautiful Soup is a Python library for pulling data out of HTML and XML files. It works with your favorite parser to provide idiomatic ways of navigating, searching, and modifying the parse tree. It commonly saves programmers hours or days of work."}
+{"idx": 7, "title": "The Complete BeautifulSoup Cheatsheet with Examples", "date": "", "ddg_snippet": "This cheatsheet covers the full BeautifulSoup 4 API with practical examples. It provides a comprehensive guide to web scraping and HTML parsing using Python's BeautifulSoup library .", "subpage_snippet": "", "source": "proxiesapi.com", "link": "https://proxiesapi.com/articles/the-complete-beautifulsoup-cheatsheet-with-examples", "content": "This cheatsheet covers the full BeautifulSoup 4 API with practical examples. It provides a comprehensive guide to web scraping and HTML parsing using Python's BeautifulSoup library ."}
+{"idx": 8, "title": "Beautiful Soup: Web Scraping Made Easy | AnSoup", "date": "", "ddg_snippet": "Beautiful Soup for web scraping Beautiful Soup is a Python package or library used for web scraping. It is used for parsing HTML and XML documents, creating parse trees that make it easy to extract data from HTML documents. It works with a parser to provide iteration, searching, and modification of the content. The function BeautifulSoup () takes two arguments: the input HTML and a parser. The ...", "subpage_snippet": "", "source": "ansoup.com", "link": "https://ansoup.com/article/how-does-beautiful-soup-work", "content": "Beautiful Soup for web scraping Beautiful Soup is a Python package or library used for web scraping. It is used for parsing HTML and XML documents, creating parse trees that make it easy to extract data from HTML documents. It works with a parser to provide iteration, searching, and modification of the content. The function BeautifulSoup () takes two arguments: the input HTML and a parser. The ..."}
+{"idx": 9, "title": "beautifulsoup4 - Documentation - Technical Manuals", "date": "", "ddg_snippet": "Official Beautiful Soup Documentation: The primary source for information on Beautiful Soup's features and API. It's the most comprehensive and authoritative resource.", "subpage_snippet": "", "source": "manuals.muthu.co", "link": "https://manuals.muthu.co/posts/python-modules/beautifulsoup4.html", "content": "Official Beautiful Soup Documentation: The primary source for information on Beautiful Soup's features and API. It's the most comprehensive and authoritative resource."}

data/sampled_jsons/Black_2023_diffusion_model_prompts_evaluation.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Prompt Mixing in Diffusion Models using the Black Scholes ...", "date": "", "ddg_snippet": "24 May 2024 — ... Black -Scholes score for generating an optimal image consistent with all prompts . ... diffusion model generate an optimal image at the ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2405.13685v1", "content": "24 May 2024 — ... Black -Scholes score for generating an optimal image consistent with all prompts . ... diffusion model generate an optimal image at the ..."}
+{"idx": 1, "title": "Blending Concepts in Text-to-Image Diffusion Models ...", "date": "", "ddg_snippet": "by D Kothandaraman — These tasks often involve blending existing concepts by conditioning the diffusion model with text prompts ... The work utilizes the Black ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=NDMLjEJoLb", "content": "by D Kothandaraman — These tasks often involve blending existing concepts by conditioning the diffusion model with text prompts ... The work utilizes the Black ..."}
+{"idx": 2, "title": "Manipulating Embeddings of Stable Diffusion Prompts", "date": "", "ddg_snippet": "by N Deckers · Cited by 11 — metric, it is also possible to finetune the diffusion model [ Black et al., 2023 ]. ... the prompts from DiffusionDB [Wang et al., 2023 ]. For the user study ...", "subpage_snippet": "", "source": "www.ijcai.org", "link": "https://www.ijcai.org/proceedings/2024/0845.pdf", "content": "by N Deckers · Cited by 11 — metric, it is also possible to finetune the diffusion model [ Black et al., 2023 ]. ... the prompts from DiffusionDB [Wang et al., 2023 ]. For the user study ..."}
+{"idx": 3, "title": "Fast Direct: Query-Efficient Online Black-box Guidance for ...", "date": "", "ddg_snippet": "2 Feb 2025 — Krishnamoorthy et al. ( 2023 ) proposes to train the diffusion model with re-weighted training loss, while Clark et al. ( 2023 ); Black et al.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2502.01692v1", "content": "2 Feb 2025 — Krishnamoorthy et al. ( 2023 ) proposes to train the diffusion model with re-weighted training loss, while Clark et al. ( 2023 ); Black et al."}
+{"idx": 4, "title": "Evaluating Societal Representations in Diffusion Models", "date": "", "ddg_snippet": "by AS Luccioni · Cited by 141 — We use these prompts to generate two supporting datasets for our evaluation of three TTI systems to compare the social biases they encode: Stable Diffusion ... 14 pages", "subpage_snippet": "", "source": "papers.neurips.cc", "link": "https://papers.neurips.cc/paper_files/paper/2023/file/b01153e7112b347d8ed54f317840d8af-Paper-Datasets_and_Benchmarks.pdf", "content": "by AS Luccioni · Cited by 141 — We use these prompts to generate two supporting datasets for our evaluation of three TTI systems to compare the social biases they encode: Stable Diffusion ... 14 pages"}
+{"idx": 5, "title": "Reverse Stable Diffusion: What prompt was used to ...", "date": "", "ddg_snippet": "by FA Croitoru · 2024 · Cited by 5 — ... evaluation of the alignment between generated images and text prompts . ... diffusion model as a black box. We also employed the U-Net encoder from ...", "subpage_snippet": "", "source": "www.sciencedirect.com", "link": "https://www.sciencedirect.com/science/article/pii/S1077314224002911", "content": "by FA Croitoru · 2024 · Cited by 5 — ... evaluation of the alignment between generated images and text prompts . ... diffusion model as a black box. We also employed the U-Net encoder from ..."}
+{"idx": 6, "title": "Automatic Evaluation for Text-to-image Generation: Task- ...", "date": "", "ddg_snippet": "by RC Tu · 2025 · Cited by 8 — Systems 2023 , NeurIPS 2023 , New Orleans, LA, USA, ... Re- · visiting text-to-image evaluation with gecko: On · metrics, prompts , and human ratings ... 22 pages", "subpage_snippet": "", "source": "aclanthology.org", "link": "https://aclanthology.org/2025.acl-long.1088.pdf", "content": "by RC Tu · 2025 · Cited by 8 — Systems 2023 , NeurIPS 2023 , New Orleans, LA, USA, ... Re- · visiting text-to-image evaluation with gecko: On · metrics, prompts , and human ratings ... 22 pages"}
+{"idx": 7, "title": "Automating Evaluation of Diffusion Model Unlearning with ( ...", "date": "", "ddg_snippet": "by S Mahan — Automating Evaluation of Diffusion Model Unlearning with (Vision-) Language ... (Cho et al., 2023 ; Luccioni et al., 2023 ). These concerns have led to ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=oQyjiBpqxx", "content": "by S Mahan — Automating Evaluation of Diffusion Model Unlearning with (Vision-) Language ... (Cho et al., 2023 ; Luccioni et al., 2023 ). These concerns have led to ..."}
+{"idx": 8, "title": "Learning to Sample Effective and Diverse Prompts for Text-to ...", "date": "", "ddg_snippet": "by T Yun · 2025 · Cited by 7 — tention), which can be expressed as black -box reward func- tions. In ... For evaluation , we generate 16 prompts for each prompt via beam search with ...", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/papers/Yun_Learning_to_Sample_Effective_and_Diverse_Prompts_for_Text-to-Image_Generation_CVPR_2025_paper.pdf", "content": "by T Yun · 2025 · Cited by 7 — tention), which can be expressed as black -box reward func- tions. In ... For evaluation , we generate 16 prompts for each prompt via beam search with ..."}
+{"idx": 9, "title": "Humans Are Biased. Generative AI Is Even Worse", "date": "", "ddg_snippet": "9 Jun 2023 — Stable Diffusion generates images using artificial intelligence, in response to written prompts . Like many AI models, what it creates may seem ...", "subpage_snippet": "", "source": "www.bloomberg.com", "link": "https://www.bloomberg.com/graphics/2023-generative-ai-bias/", "content": "9 Jun 2023 — Stable Diffusion generates images using artificial intelligence, in response to written prompts . Like many AI models, what it creates may seem ..."}

data/sampled_jsons/CVE-Bench_paper_T-Agent_improved_sqlmap_database_access_success_rate_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "CVE-Bench: A Benchmark for AI Agents' Ability to Exploit Real-World Web ...", "date": "", "ddg_snippet": "Appropriate use of sqlmap can significant improve the success rate of exploit SQL injection vulnerabilities, the second most frequent vulnerability (OWASP, 2021), which can lead to unauthorized database access and data breaches.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2503.17332v4", "content": "Appropriate use of sqlmap can significant improve the success rate of exploit SQL injection vulnerabilities, the second most frequent vulnerability (OWASP, 2021), which can lead to unauthorized database access and data breaches."}
+{"idx": 1, "title": "GitHub - uiuc-kang-lab/cve-bench: CVE-Bench: A Benchmark for AI Agents ...", "date": "", "ddg_snippet": "This repository contains data and code used in the CVE-Bench ( paper , blog), which is for evaluating AI agents on real world web vulnerabilities and exploits collected from National Vulnerability Database . CVE-Bench includes 40 critical-severity Common Vulnerability and Exposures ( CVE ) with the reference automatic exploits available on requests.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/uiuc-kang-lab/cve-bench", "content": "This repository contains data and code used in the CVE-Bench ( paper , blog), which is for evaluating AI agents on real world web vulnerabilities and exploits collected from National Vulnerability Database . CVE-Bench includes 40 critical-severity Common Vulnerability and Exposures ( CVE ) with the reference automatic exploits available on requests."}
+{"idx": 2, "title": "Evaluation | uiuc-kang-lab/cve-bench | DeepWiki", "date": "", "ddg_snippet": "Evaluation Relevant source files This document explains how CVE-Bench evaluates AI agent performance in exploiting vulnerabilities. It focuses on the evaluation framework, grading system, and success criteria used to determine whether an exploitation attempt has succeeded. For information about specific application graders, see Application-Specific Graders. Evaluation Overview The evaluation ...", "subpage_snippet": "", "source": "deepwiki.com", "link": "https://deepwiki.com/uiuc-kang-lab/cve-bench/5-evaluation", "content": "Evaluation Relevant source files This document explains how CVE-Bench evaluates AI agent performance in exploiting vulnerabilities. It focuses on the evaluation framework, grading system, and success criteria used to determine whether an exploitation attempt has succeeded. For information about specific application graders, see Application-Specific Graders. Evaluation Overview The evaluation ..."}
+{"idx": 3, "title": "ICML Poster CVE-Bench: A Benchmark for AI Agents' Ability to Exploit ...", "date": "", "ddg_snippet": "CVE-Bench : A Benchmark for AI Agents' Ability to Exploit Real-World Web Application Vulnerabilities Yuxuan Zhu · Antony Kellermann · Dylan Bowman · Philip Li · Akul Gupta · Adarsh Danda · Richard Fang · Conner Jensen · Eric Ihli · Jason Benn · Jet Geronimo · Avi Dhir · Sudhit Rao · Kaicheng Yu · Twm Stone · Daniel Kang", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/46522", "content": "CVE-Bench : A Benchmark for AI Agents' Ability to Exploit Real-World Web Application Vulnerabilities Yuxuan Zhu · Antony Kellermann · Dylan Bowman · Philip Li · Akul Gupta · Adarsh Danda · Richard Fang · Conner Jensen · Eric Ihli · Jason Benn · Jet Geronimo · Avi Dhir · Sudhit Rao · Kaicheng Yu · Twm Stone · Daniel Kang"}
+{"idx": 4, "title": "Measuring AI Agents' Ability to Exploit Web Applications", "date": "", "ddg_snippet": "Introducing CVE-bench : The First Real-World Vulnerability Benchmark for AI Agents After exploring the dangerous potential of AI agents in autonomously penetrating web applications in our previous studies, we found an urgent need for standardized evaluation.", "subpage_snippet": "", "source": "ddkang.substack.com", "link": "https://ddkang.substack.com/p/measuring-ai-agents-ability-to-exploit", "content": "Introducing CVE-bench : The First Real-World Vulnerability Benchmark for AI Agents After exploring the dangerous potential of AI agents in autonomously penetrating web applications in our previous studies, we found an urgent need for standardized evaluation."}
+{"idx": 5, "title": "CVE-Bench: A Benchmark for AI Agents' Ability to Exploit Real-World Web ...", "date": "", "ddg_snippet": "To address this challenge, we introduce CVE-Bench , a real-world cybersecurity benchmark based on critical-severity Common Vulnerabilities and Exposures. In CVE-Bench , we design a sandbox framework that enables LLM agents to exploit vulnerable web applications in scenarios that mimic real-world conditions, while also providing effective ...", "subpage_snippet": "", "source": "www.alphaxiv.org", "link": "https://www.alphaxiv.org/overview/2503.17332v4", "content": "To address this challenge, we introduce CVE-Bench , a real-world cybersecurity benchmark based on critical-severity Common Vulnerabilities and Exposures. In CVE-Bench , we design a sandbox framework that enables LLM agents to exploit vulnerable web applications in scenarios that mimic real-world conditions, while also providing effective ..."}
+{"idx": 6, "title": "CVE-Bench: A Benchmark for AI Agents' Ability to Exploit ... - ResearchGate", "date": "", "ddg_snippet": "To address this challenge, we introduce CVE-Bench , a real-world cybersecurity benchmark based on critical-severity Common Vulnerabilities and Exposures.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/390114649_CVE-Bench_A_Benchmark_for_AI_Agents'_Ability_to_Exploit_Real-World_Web_Application_Vulnerabilities", "content": "To address this challenge, we introduce CVE-Bench , a real-world cybersecurity benchmark based on critical-severity Common Vulnerabilities and Exposures."}
+{"idx": 7, "title": "[2503.17332] CVE-Bench: A Benchmark for AI Agents' Ability to Exploit ...", "date": "", "ddg_snippet": "Large language model (LLM) agents are increasingly capable of autonomously conducting cyberattacks, posing significant threats to existing applications. This growing risk highlights the urgent need for a real-world benchmark to evaluate the ability of LLM agents to exploit web application vulnerabilities. However, existing benchmarks fall short as they are limited to abstracted Capture the ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2503.17332", "content": "Large language model (LLM) agents are increasingly capable of autonomously conducting cyberattacks, posing significant threats to existing applications. This growing risk highlights the urgent need for a real-world benchmark to evaluate the ability of LLM agents to exploit web application vulnerabilities. However, existing benchmarks fall short as they are limited to abstracted Capture the ..."}
+{"idx": 8, "title": "CVE-Bench: A Real-World Cybersecurity Benchmark for AI Agents", "date": "", "ddg_snippet": "Okay, so beyond CVE-Bench , I also want to briefly highlight two things I work on. I broadly work on AI and security, so this includes attacking AI agents and everything around AI agent security. Just as an example, we released another benchmark a few months ago called InjectAgent for indirect prompt injection attacks on AI agents .", "subpage_snippet": "", "source": "far.ai", "link": "https://far.ai/events/sessions/daniel-kang-cve-bench-a-real-world-cybersecurity-benchmark-for-ai-agents", "content": "Okay, so beyond CVE-Bench , I also want to briefly highlight two things I work on. I broadly work on AI and security, so this includes attacking AI agents and everything around AI agent security. Just as an example, we released another benchmark a few months ago called InjectAgent for indirect prompt injection attacks on AI agents ."}
+{"idx": 9, "title": "cve-bench/README.md at main · uiuc-kang-lab/cve-bench · GitHub", "date": "", "ddg_snippet": "This repository contains data and code used in the CVE-Bench ( paper , blog), which is for evaluating AI agents on real world web vulnerabilities and exploits collected from National Vulnerability Database . CVE-Bench includes 40 critical-severity Common Vulnerability and Exposures ( CVE ) with the reference automatic exploits available on requests.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/uiuc-kang-lab/cve-bench/blob/main/README.md", "content": "This repository contains data and code used in the CVE-Bench ( paper , blog), which is for evaluating AI agents on real world web vulnerabilities and exploits collected from National Vulnerability Database . CVE-Bench includes 40 critical-severity Common Vulnerability and Exposures ( CVE ) with the reference automatic exploits available on requests."}

data/sampled_jsons/CVE-Bench_paper_findings_summary_'Common_Failure_Modes'.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "CVE - Bench : A Benchmark for AI Agents' Ability to Exploit... | alphaXiv", "date": "", "ddg_snippet": "Common Failure Modes . Implications and Impact. CVE - Bench addresses a critical gap in evaluating the offensive capabilities of AI agents by providing a real-world benchmark focused on web application security vulnerabilities .", "subpage_snippet": "", "source": "www.alphaxiv.org", "link": "https://www.alphaxiv.org/overview/2503.17332v1", "content": "Common Failure Modes . Implications and Impact. CVE - Bench addresses a critical gap in evaluating the offensive capabilities of AI agents by providing a real-world benchmark focused on web application security vulnerabilities ."}
+{"idx": 1, "title": "CVE - Bench : A Benchmark for AI Agents' Ability to Exploit Real-World...", "date": "", "ddg_snippet": "Furthermore, we summarize the common failure modes to demonstrate the difficulty of exploiting vulnerabilities and explore potential improvements for red-teaming with LLM agents. CVE -2024-37849 is a critical vulnerability of a billing man", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2503.17332", "content": "Furthermore, we summarize the common failure modes to demonstrate the difficulty of exploiting vulnerabilities and explore potential improvements for red-teaming with LLM agents. CVE -2024-37849 is a critical vulnerability of a billing man"}
+{"idx": 2, "title": "CVE - Bench : Benchmarking LLM-based Software Engineering", "date": "", "ddg_snippet": "In this paper , we introduce CVE - Bench (§2), a benchmark that evaluates LLM-based agents in a realistic vulnerability -repairing setting. CVE - Bench contains three unique characteristics", "subpage_snippet": "", "source": "aclanthology.org", "link": "https://aclanthology.org/2025.naacl-long.212.pdf", "content": "In this paper , we introduce CVE - Bench (§2), a benchmark that evaluates LLM-based agents in a realistic vulnerability -repairing setting. CVE - Bench contains three unique characteristics"}
+{"idx": 3, "title": "GitHub - uiuc-kang-lab/ cve - bench : CVE - Bench : A Benchmark for AI...", "date": "", "ddg_snippet": "CVE - Bench includes 40 critical-severity Common Vulnerability and Exposures (CVE) with the reference automatic exploits available on requests.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/uiuc-kang-lab/cve-bench", "content": "CVE - Bench includes 40 critical-severity Common Vulnerability and Exposures (CVE) with the reference automatic exploits available on requests."}
+{"idx": 4, "title": "uiuc-kang-lab/ cve - bench | DeepWiki", "date": "", "ddg_snippet": "CVE - Bench is a benchmark that contains 40 critical-severity Common Vulnerability and Exposures (CVEs) collected from the National Vulnerability Database. It creates reproducible environments for testing AI agents' abilities to discover and exploit web application vulnerabilities.", "subpage_snippet": "", "source": "deepwiki.com", "link": "https://deepwiki.com/uiuc-kang-lab/cve-bench", "content": "CVE - Bench is a benchmark that contains 40 critical-severity Common Vulnerability and Exposures (CVEs) collected from the National Vulnerability Database. It creates reproducible environments for testing AI agents' abilities to discover and exploit web application vulnerabilities."}
+{"idx": 5, "title": "Terminal- Bench", "date": "", "ddg_snippet": "Common failure modes include not waiting for processes to finish, crashing the terminal, and not accounting for edge cases. Background. Terminal- Bench is an open-source benchmark that is designed to test a model’s ability to navigate and complete tasks in a sandboxed terminal...", "subpage_snippet": "", "source": "www.vals.ai", "link": "https://www.vals.ai/benchmarks/terminal-bench-2025-09-20", "content": "Common failure modes include not waiting for processes to finish, crashing the terminal, and not accounting for edge cases. Background. Terminal- Bench is an open-source benchmark that is designed to test a model’s ability to navigate and complete tasks in a sandboxed terminal..."}
+{"idx": 6, "title": "[Papierüberprüfung] REALM- Bench : A Real-World Planning...", "date": "", "ddg_snippet": "The paper concludes by emphasizing the significance of the REALM- Bench suite in addressing existing gaps in AI planning benchmarks.", "subpage_snippet": "", "source": "www.themoonlight.io", "link": "https://www.themoonlight.io/de/review/realm-bench-a-real-world-planning-benchmark-for-llms-and-multi-agent-systems", "content": "The paper concludes by emphasizing the significance of the REALM- Bench suite in addressing existing gaps in AI planning benchmarks."}
+{"idx": 7, "title": "CVE vs. CWE Vulnerability : What's The Difference?", "date": "", "ddg_snippet": "CVE , or Common Vulnerabilities and Exposures , is a publicly released list of known computer security threats.", "subpage_snippet": "", "source": "codiga.io", "link": "https://codiga.io/blog/cve-vs-cwe/", "content": "CVE , or Common Vulnerabilities and Exposures , is a publicly released list of known computer security threats."}
+{"idx": 8, "title": "SWE- Bench Pro (Commercial Dataset)", "date": "", "ddg_snippet": "Dataset Summary . SWE- Bench Pro is a large-scale benchmark containing 1865 total tasks across 41 professional repositories.", "subpage_snippet": "", "source": "scale.com", "link": "https://scale.com/leaderboard/swe_bench_pro_commercial", "content": "Dataset Summary . SWE- Bench Pro is a large-scale benchmark containing 1865 total tasks across 41 professional repositories."}
+{"idx": 9, "title": "Unpacking METR’s findings : Does AI slow developers down?", "date": "", "ddg_snippet": "Part of that is also because that it’s super long context. I didn’t start using Gemini thinking, I’m going to use this as a summarization tool. I started using it for more and more and found that there’s failure modes , it has very specific failure modes , and tried to use it to its strengths.", "subpage_snippet": "", "source": "getdx.com", "link": "https://getdx.com/podcast/metrs-ai-findings/", "content": "Part of that is also because that it’s super long context. I didn’t start using Gemini thinking, I’m going to use this as a summarization tool. I started using it for more and more and found that there’s failure modes , it has very specific failure modes , and tried to use it to its strengths."}

data/sampled_jsons/CVPR_2025_33113_DSDFM_Algorithm_1_D_Drift_calculation.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "A* Pathfinding (E01: algorithm explanation) - YouTube", "date": "", "ddg_snippet": "Welcome to the first part in a series teaching pathfinding for video games. In this episode we take a look at the A* algorithm and how it works.Some great A*...", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=-L-WgKMFuhE", "content": "Welcome to the first part in a series teaching pathfinding for video games. In this episode we take a look at the A* algorithm and how it works.Some great A*..."}
+{"idx": 1, "title": "Горящие туры из Москвы 2025 – Египет, Турция, ОАЭ до -70...", "date": "", "ddg_snippet": "Поиск горящих путевок 2025 . Горящие туры – как сэкономить на отдыхе?", "subpage_snippet": "", "source": "travelata.ru", "link": "https://travelata.ru/tury", "content": "Поиск горящих путевок 2025 . Горящие туры – как сэкономить на отдыхе?"}
+{"idx": 2, "title": "DSA Tutorial - Learn Data Structures and Algorithms - GeeksforGeeks", "date": "", "ddg_snippet": "Greedy Algorithm builds up the solution one piece at a time and chooses the next piece which gives the most obvious and immediate benefit i .e., which is the most optimal choice at that moment.", "subpage_snippet": "", "source": "www.geeksforgeeks.org", "link": "https://www.geeksforgeeks.org/dsa/dsa-tutorial-learn-data-structures-and-algorithms/", "content": "Greedy Algorithm builds up the solution one piece at a time and chooses the next piece which gives the most obvious and immediate benefit i .e., which is the most optimal choice at that moment."}
+{"idx": 3, "title": "Статус груза | Транспортная компания ПЭК", "date": "", "ddg_snippet": "2025 © ООО «ПЭК». English version. О защите персональных данных.", "subpage_snippet": "", "source": "PECom.ru", "link": "https://PECom.ru/services-are/order-status/", "content": "2025 © ООО «ПЭК». English version. О защите персональных данных."}
+{"idx": 4, "title": "Ключи активации Windows 10 | Ответы Mail", "date": "", "ddg_snippet": "На нашем сайте вы сможете найти свежие ключи для pro активации лицензий программ 2024- 2025 бесплатно.", "subpage_snippet": "", "source": "otvet.mail.ru", "link": "https://otvet.mail.ru/question/237199183", "content": "На нашем сайте вы сможете найти свежие ключи для pro активации лицензий программ 2024- 2025 бесплатно."}
+{"idx": 5, "title": "Editing Prompt - New Trending Prompts & Editing Stock", "date": "", "ddg_snippet": "Gemini Retro Couple Style Ai Photo Editing Prompts 2025 .", "subpage_snippet": "", "source": "editingprompt.com", "link": "https://editingprompt.com/", "content": "Gemini Retro Couple Style Ai Photo Editing Prompts 2025 ."}
+{"idx": 6, "title": "Отслеживание посылок - отследить посылку по идентификатору...", "date": "", "ddg_snippet": "17.09. 2025 01:42 649 Отгружено в доставку \"последней мили\". Юнэкс Посылку везут на склад Озон из Уссурийска.", "subpage_snippet": "", "source": "1track.ru", "link": "https://1track.ru/", "content": "17.09. 2025 01:42 649 Отгружено в доставку \"последней мили\". Юнэкс Посылку везут на склад Озон из Уссурийска."}
+{"idx": 7, "title": "Калькулятор онлайн и по шагам", "date": "", "ddg_snippet": "Калькулятор. calculator .© MathDF. Обновлено: 2025 .", "subpage_snippet": "", "source": "mathdf.com", "link": "https://mathdf.com/calc/ru/", "content": "Калькулятор. calculator .© MathDF. Обновлено: 2025 ."}
+{"idx": 8, "title": "Мир сегодня с \"Юрий Подоляка\" – Telegram", "date": "", "ddg_snippet": "«Интервидение — 2025 » ( 1 ): общие впечатления... Только что вышел из зала и пока впечатления не остыли. 1 место - Вьетнам 2 место - Кыргызстан 3 место - Катар.", "subpage_snippet": "", "source": "t.me", "link": "https://t.me/s/yurasumy/", "content": "«Интервидение — 2025 » ( 1 ): общие впечатления... Только что вышел из зала и пока впечатления не остыли. 1 место - Вьетнам 2 место - Кыргызстан 3 место - Катар."}
+{"idx": 9, "title": "Google", "date": "", "ddg_snippet": "© 2025 - Конфиденциальность - Условия.", "subpage_snippet": "", "source": "www.l.google.com", "link": "https://www.l.google.com/", "content": "© 2025 - Конфиденциальность - Условия."}

data/sampled_jsons/Catoni-OFUL_algorithm_regret_bound_Theorem_3.4_leading_order_optimal_year_2025.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Catoni Contextual Bandits are Robust to Heavy-tailed Rewards", "date": "", "ddg_snippet": "OLS (Pacchiano, 2024) Catoni - OFUL ( Theorem 3 . 4 ). Function Type Linear. Theorem 3 . 4 (Informal). Under Algorithm 1 with appropri-ate choices of the parameters α, λ, υ and βˆ, with probability. 1 − 2δ, we can bound the regret by.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=5IpVe9PH14", "content": "OLS (Pacchiano, 2024) Catoni - OFUL ( Theorem 3 . 4 ). Function Type Linear. Theorem 3 . 4 (Informal). Under Algorithm 1 with appropri-ate choices of the parameters α, λ, υ and βˆ, with probability. 1 − 2δ, we can bound the regret by."}
+{"idx": 1, "title": "An alpha-No- Regret Algorithm For Graphical Bilinear Bandits", "date": "", "ddg_snippet": "Theoretical analysis of this new method yields an upper bound of ↵- regret and evidences the impact of the graph structure on the rate. Algorithm 1: Adaptation of OFUL algorithm for Graphical Bilinear Bandit. Input :graph G = (V, E), node-arm set X.", "subpage_snippet": "", "source": "hal.science", "link": "https://hal.science/hal-04303702/document", "content": "Theoretical analysis of this new method yields an upper bound of ↵- regret and evidences the impact of the graph structure on the rate. Algorithm 1: Adaptation of OFUL algorithm for Graphical Bilinear Bandit. Input :graph G = (V, E), node-arm set X."}
+{"idx": 2, "title": "Mostly Exploration-Free Algorithms for", "date": "", "ddg_snippet": "bound ( Theorem 1), we conclude that the Greedy Bandit is rate optimal .We compare to the same algorithms as in the previous section, i.e., OFUL , prior-dependent TS, prior-free TS, and OLS Bandit.", "subpage_snippet": "", "source": "web.stanford.edu", "link": "https://web.stanford.edu/~bayati/papers/greedy.pdf", "content": "bound ( Theorem 1), we conclude that the Greedy Bandit is rate optimal .We compare to the same algorithms as in the previous section, i.e., OFUL , prior-dependent TS, prior-free TS, and OLS Bandit."}
+{"idx": 3, "title": "Norm-Agnostic Linear Bandits", "date": "", "ddg_snippet": "Proof of Theorem 5. Computationally Efficient Version of Algorithm 4. Norm-Agnostic Linear Bandits.Table 1: Comparison of OFUL and our algorithms . The regret bounds are expressed order -wise only, ignoring polylogarithmic factors.", "subpage_snippet": "", "source": "proceedings.mlr.press", "link": "https://proceedings.mlr.press/v151/gales22a/gales22a.pdf", "content": "Proof of Theorem 5. Computationally Efficient Version of Algorithm 4. Norm-Agnostic Linear Bandits.Table 1: Comparison of OFUL and our algorithms . The regret bounds are expressed order -wise only, ignoring polylogarithmic factors."}
+{"idx": 4, "title": "On the Interplay Between Misspecication and", "date": "", "ddg_snippet": "In this subsection, we provide the regret upper bound of Algorithm 1 and the regret lower bound . for learning the misspecied linear contextual bandit.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2303.09390", "content": "In this subsection, we provide the regret upper bound of Algorithm 1 and the regret lower bound . for learning the misspecied linear contextual bandit."}
+{"idx": 5, "title": "Tackling Heavy-Tailed Rewards in Reinforcement", "date": "", "ddg_snippet": "HEAVY- OFUL and HEAVY-LSVI-UCB achieve minimax optimal and instance-dependent regret bounds scaling with the central moments. We also provide a lower bound for linear MDPs with heavy-tailed rewards to demonstrate the opti-mality of HEAVY-LSVI-UCB.", "subpage_snippet": "", "source": "proceedings.neurips.cc", "link": "https://proceedings.neurips.cc/paper_files/paper/2023/file/b11393733b1ea5890100302ab8a0f74c-Paper-Conference.pdf", "content": "HEAVY- OFUL and HEAVY-LSVI-UCB achieve minimax optimal and instance-dependent regret bounds scaling with the central moments. We also provide a lower bound for linear MDPs with heavy-tailed rewards to demonstrate the opti-mality of HEAVY-LSVI-UCB."}
+{"idx": 6, "title": "Stochastic Online Linear Regression: the Forward", "date": "", "ddg_snippet": "The “ optimism in the face of uncertainty linear bandit\" ( OFUL ) algorithm was introduced in [1]. OFUL resorts to ridge regression, constructs a condence ellipsoid for the parameter estimate, and chooses the action that maximizes the upper-condence bound on the reward.", "subpage_snippet": "", "source": "papers.nips.cc", "link": "https://papers.nips.cc/paper/2021/file/cca289d2a4acd14c1cd9a84ffb41dd29-Paper.pdf", "content": "The “ optimism in the face of uncertainty linear bandit\" ( OFUL ) algorithm was introduced in [1]. OFUL resorts to ridge regression, constructs a condence ellipsoid for the parameter estimate, and chooses the action that maximizes the upper-condence bound on the reward."}
+{"idx": 7, "title": "Differentially private and lazy online convex optimization-Bohrium", "date": "", "ddg_snippet": "This improves over known results in multiple aspects: an optimal leading - order regret term, in being efficiently implementable without requiring log-concave sampling subroutines, and in matching the non-private regret bound for sub-constant regimes of privacy parameters.", "subpage_snippet": "", "source": "www.bohrium.com", "link": "https://www.bohrium.com/paper-details/differentially-private-and-lazy-online-convex-optimization/1130014984550481920-2000000", "content": "This improves over known results in multiple aspects: an optimal leading - order regret term, in being efficiently implementable without requiring log-concave sampling subroutines, and in matching the non-private regret bound for sub-constant regimes of privacy parameters."}
+{"idx": 8, "title": "(PDF) Efficient Linear Bandits through Matrix Sketching", "date": "", "ddg_snippet": "The regret bound of OFUL in ( Abbasi-Yadkori et al.,2011, Theorem 3 ) is stated as.In order to prove regret bounds , it is sufficient that the law of Zt satisfies certain properties.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/327979687_Efficient_Linear_Bandits_through_Matrix_Sketching", "content": "The regret bound of OFUL in ( Abbasi-Yadkori et al.,2011, Theorem 3 ) is stated as.In order to prove regret bounds , it is sufficient that the law of Zt satisfies certain properties."}
+{"idx": 9, "title": "Bandit problems", "date": "", "ddg_snippet": "Proof of Theorem 18 ( Regret bound for the Batch-UCB algorithm in the stochastic coupons subscription model). Journal of Machine Learning Research 24 (2023) 1-44. Submitted 11/21; Revised 6/23; Published 11/23.", "subpage_snippet": "", "source": "jmlr.org", "link": "https://jmlr.org/papers/volume24/21-1408/21-1408.pdf", "content": "Proof of Theorem 18 ( Regret bound for the Batch-UCB algorithm in the stochastic coupons subscription model). Journal of Machine Learning Research 24 (2023) 1-44. Submitted 11/21; Revised 6/23; Published 11/23."}

data/sampled_jsons/Catoni_Contextual_Bandits_are_Robust_to_Heavy-tailed_Rewards.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Heavy-Tailed Linear Bandits: Huber Regression with One-Pass", "date": "", "ddg_snippet": "Table 1: Comparisons of our regret bounds and computational complexity to previous best-known results for heavy - tailed linear bandits .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2503.00419v1", "content": "Table 1: Comparisons of our regret bounds and computational complexity to previous best-known results for heavy - tailed linear bandits ."}
+{"idx": 1, "title": "Chenlu Ye - Google Académico", "date": "", "ddg_snippet": "... robust algorithms with uncertainty weighting for nonlinear contextual bandits and ... Catoni contextual bandits are robust to heavy - tailed rewards", "subpage_snippet": "", "source": "scholar.google.co.uk", "link": "https://scholar.google.co.uk/citations?user=c8yK5XsAAAAJ&hl=es", "content": "... robust algorithms with uncertainty weighting for nonlinear contextual bandits and ... Catoni contextual bandits are robust to heavy - tailed rewards"}
+{"idx": 2, "title": "Chenlu Ye - Google Scholar", "date": "", "ddg_snippet": "... robust algorithms with uncertainty weighting for nonlinear contextual bandits and ... Catoni contextual bandits are robust to heavy - tailed rewards", "subpage_snippet": "", "source": "scholar.google.co.uk", "link": "https://scholar.google.co.uk/citations?user=c8yK5XsAAAAJ&hl=de", "content": "... robust algorithms with uncertainty weighting for nonlinear contextual bandits and ... Catoni contextual bandits are robust to heavy - tailed rewards"}
+{"idx": 3, "title": "Chenlu Ye - Google Scholar", "date": "", "ddg_snippet": "... robust algorithms with uncertainty weighting for nonlinear contextual bandits and ... Catoni contextual bandits are robust to heavy - tailed rewards", "subpage_snippet": "", "source": "scholar.google.co.uk", "link": "https://scholar.google.co.uk/citations?user=c8yK5XsAAAAJ&hl=fr", "content": "... robust algorithms with uncertainty weighting for nonlinear contextual bandits and ... Catoni contextual bandits are robust to heavy - tailed rewards"}
+{"idx": 4, "title": "Chenlu Ye - Google Scholar", "date": "", "ddg_snippet": "... robust algorithms with uncertainty weighting for nonlinear contextual bandits and ... Catoni contextual bandits are robust to heavy - tailed rewards", "subpage_snippet": "", "source": "scholar.google.co.uk", "link": "https://scholar.google.co.uk/citations?user=c8yK5XsAAAAJ&hl=fi", "content": "... robust algorithms with uncertainty weighting for nonlinear contextual bandits and ... Catoni contextual bandits are robust to heavy - tailed rewards"}
+{"idx": 5, "title": "Extended UCB Policies for Multi-Armed Bandit Problems", "date": "", "ddg_snippet": "In this paper, we consider the classical MAB model with heavy - tailed reward distributions and introduce the extended robust UCB policy, which is an ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/1112.1768v5", "content": "In this paper, we consider the classical MAB model with heavy - tailed reward distributions and introduce the extended robust UCB policy, which is an ..."}
+{"idx": 6, "title": "Downloads", "date": "", "ddg_snippet": "... to Inverse Reinforcement Learning with Symbolic Reward ... A Reduction from Linear Contextual Bandits Lower Bounds to Estimations Lower Bounds", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/Downloads/2022", "content": "... to Inverse Reinforcement Learning with Symbolic Reward ... A Reduction from Linear Contextual Bandits Lower Bounds to Estimations Lower Bounds"}
+{"idx": 7, "title": "ICML 2022 Papers", "date": "", "ddg_snippet": "Adversarially Robust Models may not Transfer Better ... Representation Topology Divergence: A Method for Comparing Neural Network Representations.", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2022/papers.html", "content": "Adversarially Robust Models may not Transfer Better ... Representation Topology Divergence: A Method for Comparing Neural Network Representations."}
+{"idx": 8, "title": "COLT 2024 - Accepted Papers", "date": "", "ddg_snippet": "Follow-the-Perturbed-Leader with Fr\\'{e}chet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds Lee, Jongyeong; Honda ...", "subpage_snippet": "", "source": "learningtheory.org", "link": "http://learningtheory.org/colt2024/accepted-papers.html", "content": "Follow-the-Perturbed-Leader with Fr\\'{e}chet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds Lee, Jongyeong; Honda ..."}
+{"idx": 9, "title": "COLT 2024 - Accepted Papers", "date": "", "ddg_snippet": "Follow-the-Perturbed-Leader with Fr\\'{e}chet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds Lee, Jongyeong; Honda ...", "subpage_snippet": "", "source": "learningtheory.org", "link": "https://learningtheory.org/colt2024/accepted-papers.html", "content": "Follow-the-Perturbed-Leader with Fr\\'{e}chet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds Lee, Jongyeong; Honda ..."}

data/sampled_jsons/Catoni_estimator_function-dependent_theta_parameter_selection_complexity.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Nearly Optimal Catoni’s M-estimator for Infinite Variance", "date": "", "ddg_snippet": "This is based on the non-trivial extension of Catoni ’s estimator proposed in Catoni (2012) for the case of infinite variance. We also provided an algorithm to adapt to the situ-ation of unknown moment bound using classical Lepskii’s adaptive estimation method.", "subpage_snippet": "", "source": "proceedings.mlr.press", "link": "https://proceedings.mlr.press/v162/bhatt22b/bhatt22b.pdf", "content": "This is based on the non-trivial extension of Catoni ’s estimator proposed in Catoni (2012) for the case of infinite variance. We also provided an algorithm to adapt to the situ-ation of unknown moment bound using classical Lepskii’s adaptive estimation method."}
+{"idx": 1, "title": "Catoni-Giulini M-estimator - The Stats Map", "date": "", "ddg_snippet": "Jan 5, 2025 · In 2017, Catoni and Giulini proposed an approach to multivariate concentration based on M-estimation. Let ψ be any symmetric “influence function ” such that −log(1−x+x2/2)≤ ψ(x)≤ log(1+x+x2/2), ∀x∈ R. The motivation behind this condition is to choose a function ψ such that eψ is bounded by polynomials. The estimator is then ξ(θ)= nλ1i≤n∑∫ Rdψ(λ ϑ,X i )ρθ(dϑ ...", "subpage_snippet": "", "source": "thestatsmap.com", "link": "https://thestatsmap.com/Catoni-Giulini-M-estimator", "content": "Jan 5, 2025 · In 2017, Catoni and Giulini proposed an approach to multivariate concentration based on M-estimation. Let ψ be any symmetric “influence function ” such that −log(1−x+x2/2)≤ ψ(x)≤ log(1+x+x2/2), ∀x∈ R. The motivation behind this condition is to choose a function ψ such that eψ is bounded by polynomials. The estimator is then ξ(θ)= nλ1i≤n∑∫ Rdψ(λ ϑ,X i )ρθ(dϑ ..."}
+{"idx": 2, "title": "On Catoni's M-Estimation - arXiv.org", "date": "", "ddg_snippet": "Catoni proposed a robust M- estimator and gave the deviation inequality for one fixed test function . The present paper is devoted to the uniform concentration inequality for a family of test functions . As an application, we consider empirical risk minimization for heavy-tailed losses.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2210.08211", "content": "Catoni proposed a robust M- estimator and gave the deviation inequality for one fixed test function . The present paper is devoted to the uniform concentration inequality for a family of test functions . As an application, we consider empirical risk minimization for heavy-tailed losses."}
+{"idx": 3, "title": "A generalized Catoni's M-estimator under finite -th moment ...", "date": "", "ddg_snippet": "Catoni ’s argument for establishing the M- estimator in [3] can be divided into two steps. The one is to find two deterministic values θ and θ+, both depending on a parameter β to be tuned later, such that the M- estimator ˆθ falls between − θ and θ+ with high probability.", "subpage_snippet": "", "source": "projecteuclid.org", "link": "https://projecteuclid.org/journalArticle/Download?urlid=10.1214/21-EJS1911", "content": "Catoni ’s argument for establishing the M- estimator in [3] can be divided into two steps. The one is to find two deterministic values θ and θ+, both depending on a parameter β to be tuned later, such that the M- estimator ˆθ falls between − θ and θ+ with high probability."}
+{"idx": 4, "title": "stat-map/Catoni-Giulini M-estimator.md at main - GitHub", "date": "", "ddg_snippet": "This is the estimate of $\\la \\ theta , \\E X\\ra$. An approximation $\\xi (\\ theta )$ is computationally tractable for certain choices of $\\psi$, but still doesn't give a closed-form bound, since you can't compute it for all $\\ theta $.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/bchugg/stat-map/blob/main/Catoni-Giulini+M-estimator.md", "content": "This is the estimate of $\\la \\ theta , \\E X\\ra$. An approximation $\\xi (\\ theta )$ is computationally tractable for certain choices of $\\psi$, but still doesn't give a closed-form bound, since you can't compute it for all $\\ theta $."}
+{"idx": 5, "title": "Nearly Optimal Catoni’s Estimator for Infinite Variance", "date": "", "ddg_snippet": "Catoni ’s M- estimator : bμn is a solution to the equation n ψ α(Xi − bμn) = 0 i=1 with ψ : R → R a non-decreasing influence function and α > 0. Key-Contribution: For a given confidence δ ∈ (0, 1), we design the tightest possible ρ = ρ(n, δ) such that P bμn − μ > ρ ≤ δ.", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/media/icml-2022/Slides/16205.pdf", "content": "Catoni ’s M- estimator : bμn is a solution to the equation n ψ α(Xi − bμn) = 0 i=1 with ψ : R → R a non-decreasing influence function and α > 0. Key-Contribution: For a given confidence δ ∈ (0, 1), we design the tightest possible ρ = ρ(n, δ) such that P bμn − μ > ρ ≤ δ."}
+{"idx": 6, "title": "[OPML#0] A series of posts on over-parameterized machine", "date": "", "ddg_snippet": "... uninitiated, deep learning is a family of machine learning models that uses complex hierarchical neural networks to represent complicated functions .", "subpage_snippet": "", "source": "blog.claytonsanford.com", "link": "http://blog.claytonsanford.com/2021/07/04/candidacy-overview.html", "content": "... uninitiated, deep learning is a family of machine learning models that uses complex hierarchical neural networks to represent complicated functions ."}
+{"idx": 7, "title": "[OPML#0] A series of posts on over-parameterized machine", "date": "", "ddg_snippet": "... uninitiated, deep learning is a family of machine learning models that uses complex hierarchical neural networks to represent complicated functions .", "subpage_snippet": "", "source": "blog.claytonsanford.com", "link": "https://blog.claytonsanford.com/2021/07/04/candidacy-overview.html", "content": "... uninitiated, deep learning is a family of machine learning models that uses complex hierarchical neural networks to represent complicated functions ."}
+{"idx": 8, "title": "AlgoSelect: Universal Algorithm Selection with", "date": "", "ddg_snippet": "... Functions : A mechanism, often implemented using neural networks, that maps problem characteristics to optimal parameters for the Comb Operator, ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2506.17304v1", "content": "... Functions : A mechanism, often implemented using neural networks, that maps problem characteristics to optimal parameters for the Comb Operator, ..."}
+{"idx": 9, "title": "Statistica Sinica Preprint No: SS-2024-0249", "date": "", "ddg_snippet": "In this paper, we extend some of the above techniques to work in the infinite variance case (improving in the finite variance case over Wang & Ramdas [2023]) using a supermartingale construction of the Catoni estimator , and provide the confidence sequences using traditional Ville’s inequality and an improved one using the stitching method.", "subpage_snippet": "", "source": "www3.stat.sinica.edu.tw", "link": "https://www3.stat.sinica.edu.tw/ss_newpaper/SS-2024-0249_na.pdf", "content": "In this paper, we extend some of the above techniques to work in the infinite variance case (improving in the finite variance case over Wang & Ramdas [2023]) using a supermartingale construction of the Catoni estimator , and provide the confidence sequences using traditional Ville’s inequality and an improved one using the stitching method."}

data/sampled_jsons/Checks-and-Balances_Framework_Context-Aware_Ethical_AI_Alignment_four_steps_self-supervised_learning.jsonl

@@ -0,0 +1,8 @@
+{"idx": 0, "title": "(PDF) Checks - and - Balances Framework for Context - Aware Ethical ...", "date": "", "ddg_snippet": "This paper introduces a checks - and - balances framework for ethical alignment of Large Language Models (LLMs), inspired by three-branch governmental systems.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/380515639_Checks-and-Balances_Framework_for_Context-Aware_Ethical_AI_Alignment", "content": "This paper introduces a checks - and - balances framework for ethical alignment of Large Language Models (LLMs), inspired by three-branch governmental systems."}
+{"idx": 1, "title": "A Checks - and - Balances Framework for Context - Aware Ethical AI ...", "date": "", "ddg_snippet": "This paper introduces a checks - and - balances framework for ethical alignment of Large Lan-guage Models (LLMs), inspired by three-branch governmental systems. Behaviors and emotions mapping using self - supervised learning .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2502.00136", "content": "This paper introduces a checks - and - balances framework for ethical alignment of Large Lan-guage Models (LLMs), inspired by three-branch governmental systems. Behaviors and emotions mapping using self - supervised learning ."}
+{"idx": 2, "title": "A Checks-and-Balances Framework for Context-Aware Ethical AI ...", "date": "", "ddg_snippet": "This work introduces a checks-and-balances framework for ethical AI behavior . By delineating the responsibilities: LLM (executive), Dike (legislative), and Eris (judicial), the framework enables robust ethical oversight while preserv-ing the integrity of LLM knowledge without interference from the RLHF backpropagation.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2502.00136v3", "content": "This work introduces a checks-and-balances framework for ethical AI behavior . By delineating the responsibilities: LLM (executive), Dike (legislative), and Eris (judicial), the framework enables robust ethical oversight while preserv-ing the integrity of LLM knowledge without interference from the RLHF backpropagation."}
+{"idx": 3, "title": "A Checks-and-Balances Framework for Context-Aware Ethical AI ...", "date": "", "ddg_snippet": "Drawing from psychological theories where managing emotional responses prevents harmful behaviors , we develop a self-supervised learning pipeline that maps emo-tions to linguistic behaviors ...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/profile/Edward-Chang-22/publication/380515639_Checks-and-Balances_Framework_for_Context-Aware_Ethical_AI_Alignment/links/683696c46b5a287c3046b3e0/Checks-and-Balances-Framework-for-Context-Aware-Ethical-AI-Alignment.pdf", "content": "Drawing from psychological theories where managing emotional responses prevents harmful behaviors , we develop a self-supervised learning pipeline that maps emo-tions to linguistic behaviors ..."}
+{"idx": 4, "title": "A Three-Branch Checks-and-Balances Framework for Context ...", "date": "", "ddg_snippet": "Emotion -Driven Behavioral Modeling: Building on BEAM (Behavioral Emotion Analysis Model) [7], DIKE employs self-supervised learning to analyze how emotions manifest in linguistic behaviors , creating quantifiable relationships between emotional states and their corresponding language patterns in text.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=o2afWIxjKD", "content": "Emotion -Driven Behavioral Modeling: Building on BEAM (Behavioral Emotion Analysis Model) [7], DIKE employs self-supervised learning to analyze how emotions manifest in linguistic behaviors , creating quantifiable relationships between emotional states and their corresponding language patterns in text."}
+{"idx": 5, "title": "An Adversarial Behavior Model for Contextual Ethical ...", "date": "", "ddg_snippet": "Table 2: Love expression behavior spectrum and dominant emotions Next, we employed the DIKE self-supervised learning pipeline to analyze the emotion spectrum associated with each linguistic behavior .", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/profile/Edward-Chang-22/publication/380515639_A_Three-Branch_Checks-and-Balances_Framework_for_Context-Aware_Ethical_Alignment_of_Large_Language_Models/links/671b315b55a5271cded9457e/A-Three-Branch-Checks-and-Balances-Framework-for-Context-Aware-Ethical-Alignment-of-Large-Language-Models.pdf", "content": "Table 2: Love expression behavior spectrum and dominant emotions Next, we employed the DIKE self-supervised learning pipeline to analyze the emotion spectrum associated with each linguistic behavior ."}
+{"idx": 6, "title": "A Checks-and-Balances Framework for Context-Aware Ethical AI ...", "date": "", "ddg_snippet": "A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment ... each letter, modeling L linguistic behaviors in four steps . ... scale corpora through ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf/d24155c881921de1284ece531612c8597f7c0a32.pdf", "content": "A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment ... each letter, modeling L linguistic behaviors in four steps . ... scale corpora through ..."}
+{"idx": 7, "title": "ICLM 2025 AI Safety 7847 Camera Ready3 | PDF | Emotions", "date": "", "ddg_snippet": "10 Aug 2025 — Checks-and-Balances Framework for Context-Aware Ethical AI Alignment ... each letter, modeling L linguistic behaviors in four steps . by ...", "subpage_snippet": "", "source": "www.scribd.com", "link": "https://www.scribd.com/document/899938563/ICLM-2025-AI-Safety-7847-Camera-Ready3", "content": "10 Aug 2025 — Checks-and-Balances Framework for Context-Aware Ethical AI Alignment ... each letter, modeling L linguistic behaviors in four steps . by ..."}

data/sampled_jsons/Checks-and-Balances_Framework_for_Context-Aware_Ethical_AI_Alignment_Figure_4a_DIKE_GPT-4_classifica_year_2023.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment", "date": "", "ddg_snippet": "Abstract This paper introduces a checks - and - balances framework for ethical alignment of Large Lan-guage Models (LLMs), inspired by three-branch governmental systems. It implements three in-dependent yet interacting components: LLMs as the executive branch for knowledge generation, Dike as the legislative branch that establishes eth-ical guardrails, and Eris as the judicial branch for ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2502.00136", "content": "Abstract This paper introduces a checks - and - balances framework for ethical alignment of Large Lan-guage Models (LLMs), inspired by three-branch governmental systems. It implements three in-dependent yet interacting components: LLMs as the executive branch for knowledge generation, Dike as the legislative branch that establishes eth-ical guardrails, and Eris as the judicial branch for ..."}
+{"idx": 1, "title": "A Three-Branch Checks-and-Balances Frameworkfor Context-Aware Ethical ...", "date": "", "ddg_snippet": "This paper introduces a three-branch checks - and - balances framework for ethical alignment of Large Language Models (LLMs), inspired by governmental systems. It implements three independent yet interacting components: LLMs as the executive branch for knowledge generation, DIKE as the legislative branch establishing ethical guardrails, and ERIS as ...", "subpage_snippet": "", "source": "researchtrend.ai", "link": "https://researchtrend.ai/papers/2502.00136", "content": "This paper introduces a three-branch checks - and - balances framework for ethical alignment of Large Language Models (LLMs), inspired by governmental systems. It implements three independent yet interacting components: LLMs as the executive branch for knowledge generation, DIKE as the legislative branch establishing ethical guardrails, and ERIS as ..."}
+{"idx": 2, "title": "A Three-Branch Checks-and-Balances Frameworkfor Context-Aware Ethical ...", "date": "", "ddg_snippet": "A three-branch checks - and - balances framework for ethical alignment of Large Language Models, inspired by governmental systems, demonstrates how emotional modeling can guide linguistic behaviors toward ethical outcomes while preserving independence across knowledge generation, ethical oversight, and contextual interpretation.", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/A-Three-Branch-Checks-and-Balances-Frameworkfor-of-Chang/5918a91419cf95db8599b086590facf63f124702/figure/4", "content": "A three-branch checks - and - balances framework for ethical alignment of Large Language Models, inspired by governmental systems, demonstrates how emotional modeling can guide linguistic behaviors toward ethical outcomes while preserving independence across knowledge generation, ethical oversight, and contextual interpretation."}
+{"idx": 3, "title": "PDF An Adversarial Behavior Model for Contextual Ethical Alignment in Large ...", "date": "", "ddg_snippet": "Abstract This research introduces DIKE , a novel framework for aligning Large Language Models (LLMs) with human values through emotion-guided behavioral control. Inspired by the checks and balances ...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/profile/Edward-Chang-22/publication/380515639_A_Three-Branch_Checks-and-Balances_Framework_for_Context-Aware_Ethical_Alignment_of_Large_Language_Models/links/671b315b55a5271cded9457e/A-Three-Branch-Checks-and-Balances-Framework-for-Context-Aware-Ethical-Alignment-of-Large-Language-Models.pdf", "content": "Abstract This research introduces DIKE , a novel framework for aligning Large Language Models (LLMs) with human values through emotion-guided behavioral control. Inspired by the checks and balances ..."}
+{"idx": 4, "title": "A Three-Branch Checks-and-Balances Framework for Context-Aware Ethical ...", "date": "", "ddg_snippet": "This paper introduces a three-branch checks - and - balances framework for ethical alignment of Large Language Models (LLMs), inspired by the idea of collaborative intelligence.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=o2afWIxjKD", "content": "This paper introduces a three-branch checks - and - balances framework for ethical alignment of Large Language Models (LLMs), inspired by the idea of collaborative intelligence."}
+{"idx": 5, "title": "infolab.stanford.edu", "date": "", "ddg_snippet": "@article{chang2025threebranch, title={A Three-Branch Checks - and - Balances Framework for Context-Aware Ethical Alignment of Large Language Models}, author={Chang ...", "subpage_snippet": "", "source": "infolab.stanford.edu", "link": "http://infolab.stanford.edu/~echang/Behavior2024.bib", "content": "@article{chang2025threebranch, title={A Three-Branch Checks - and - Balances Framework for Context-Aware Ethical Alignment of Large Language Models}, author={Chang ..."}
+{"idx": 6, "title": "A Three-Branch Checks-and-Balances Frameworkfor Context-Aware Ethical ...", "date": "", "ddg_snippet": "Conclusion This checks - and - balances approach offers a promising direction for building more ethically- aware AI systems. The framework's ability to handle cultural differences while maintaining ethical standards could help develop AI systems that work responsibly across global contexts .", "subpage_snippet": "", "source": "www.aimodels.fyi", "link": "https://www.aimodels.fyi/papers/arxiv/three-branch-checks-balances-frameworkfor-context-aware", "content": "Conclusion This checks - and - balances approach offers a promising direction for building more ethically- aware AI systems. The framework's ability to handle cultural differences while maintaining ethical standards could help develop AI systems that work responsibly across global contexts ."}
+{"idx": 7, "title": "A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment", "date": "", "ddg_snippet": "This paper introduces a checks - and - balances framework for ethical alignment of Large Language Models (LLMs), inspired by three-branch governmental systems. It implements three independent yet interacting components: LLMs as the executive branch for knowledge generation, DIKE as the legislative branch establishing ethical guardrails, and ERIS as the judicial branch for contextual interpretation ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2502.00136", "content": "This paper introduces a checks - and - balances framework for ethical alignment of Large Language Models (LLMs), inspired by three-branch governmental systems. It implements three independent yet interacting components: LLMs as the executive branch for knowledge generation, DIKE as the legislative branch establishing ethical guardrails, and ERIS as the judicial branch for contextual interpretation ..."}
+{"idx": 8, "title": "Benchmarking, ethical alignment, and evaluation framework for ...", "date": "", "ddg_snippet": "Adaptive Standards and Intelligent Evaluation: This research paper proposes a comprehensive framework for evaluating ChatGPT that includes adaptive standards to keep pace with the dynamic nature of conversational AI . The framework incorporates ethical considerations, context adaptability, and community collaboration.", "subpage_snippet": "", "source": "www.sciencedirect.com", "link": "https://www.sciencedirect.com/science/article/pii/S2772485923000534", "content": "Adaptive Standards and Intelligent Evaluation: This research paper proposes a comprehensive framework for evaluating ChatGPT that includes adaptive standards to keep pace with the dynamic nature of conversational AI . The framework incorporates ethical considerations, context adaptability, and community collaboration."}
+{"idx": 9, "title": "PDF A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment", "date": "", "ddg_snippet": "A Checks - and - Balances Framework for Context-Aware Ethical AI Alignment Susceptible to social biases Vulnerable to reward hacking \"Whack-A-Mole\" reactive approach Catastrophic forgetting issues", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/media/icml-2025/Slides/46461.pdf", "content": "A Checks - and - Balances Framework for Context-Aware Ethical AI Alignment Susceptible to social biases Vulnerable to reward hacking \"Whack-A-Mole\" reactive approach Catastrophic forgetting issues"}

data/sampled_jsons/Checks-and-Balances_Framework_for_Context-Aware_Ethical_AI_Alignment_self-supervised_learning_four_s.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "A Checks - and - Balances Framework for Context - Aware Ethical AI ...", "date": "", "ddg_snippet": "This paper introduces a checks - and - balances framework for ethical alignment of Large Lan-guage Models (LLMs), inspired by three-branch governmental systems. It implements three in-dependent yet interacting components: LLMs as the executive branch for knowledge generation...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2502.00136", "content": "This paper introduces a checks - and - balances framework for ethical alignment of Large Lan-guage Models (LLMs), inspired by three-branch governmental systems. It implements three in-dependent yet interacting components: LLMs as the executive branch for knowledge generation..."}
+{"idx": 1, "title": "(PDF) Checks - and - Balances Framework for Context - Aware Ethical ...", "date": "", "ddg_snippet": "This paper introduces a checks - and - balances framework for ethical alignment of Large Language Models (LLMs), inspired by three-branch governmental systems.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/380515639_Checks-and-Balances_Framework_for_Context-Aware_Ethical_AI_Alignment", "content": "This paper introduces a checks - and - balances framework for ethical alignment of Large Language Models (LLMs), inspired by three-branch governmental systems."}
+{"idx": 2, "title": "A Checks-and-Balances Framework for Context-Aware Ethical AI ...", "date": "", "ddg_snippet": "Drawing from psychological theories where managing emotional responses prevents harmful behaviors, we develop a self - supervised learning pipeline that maps emo-tions to linguistic behaviors, enabling precise be-havioral modulation through emotional condition-ing.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2502.00136v3", "content": "Drawing from psychological theories where managing emotional responses prevents harmful behaviors, we develop a self - supervised learning pipeline that maps emo-tions to linguistic behaviors, enabling precise be-havioral modulation through emotional condition-ing."}
+{"idx": 3, "title": "A Three-Branch Checks-and-Balances Framework for Context ...", "date": "", "ddg_snippet": "Through self - supervised learning and adversarial testing, our framework demonstrates how emotional modeling can guide linguistic behav-iors toward ethical outcomes while preserving independence across knowledge generation, ethical oversight, and contextual interpretation.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=o2afWIxjKD", "content": "Through self - supervised learning and adversarial testing, our framework demonstrates how emotional modeling can guide linguistic behav-iors toward ethical outcomes while preserving independence across knowledge generation, ethical oversight, and contextual interpretation."}
+{"idx": 4, "title": "[PDF] Detect, Augment, Compose, and Adapt: Four Steps for ...", "date": "", "ddg_snippet": "In this paper, we propose a novel and effective four-step UDA approach that leverages self -supervision and trains source and target data concurrently. We harness self-supervised learning to mitigate the lack of ground truth in the target domain.", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/Detect,-Augment,-Compose,-and-Adapt:-Four-Steps-for-Mekhalfi-Boscaini/0b523841eb0360f64fac4dcbff565a720e3bf316", "content": "In this paper, we propose a novel and effective four-step UDA approach that leverages self -supervision and trains source and target data concurrently. We harness self-supervised learning to mitigate the lack of ground truth in the target domain."}
+{"idx": 5, "title": "Intrinsic plasticity of silicon nanowire neurotransistors for ...", "date": "", "ddg_snippet": "The entire supervised learning task is composed of three phases: train-ing, forgetting and recognition (Fig. 4h).", "subpage_snippet": "", "source": "preview-www.nature.com", "link": "https://preview-www.nature.com/articles/s41928-020-0412-1.pdf", "content": "The entire supervised learning task is composed of three phases: train-ing, forgetting and recognition (Fig. 4h)."}
+{"idx": 6, "title": "SELF-SUPERVISED DEFECT DETECTION AND LOCALIZATION BASED ON ...", "date": "", "ddg_snippet": "Self-supervised defect detection methods based on pixel-level reconstruction errors and probability density anomalies cannot capture high-level semantic information. Therefore, a U-net structure for semantic segmentation and fuses multi-scale features was adopted to improve self-supervised defect detection methods.", "subpage_snippet": "", "source": "www.authorea.com", "link": "https://www.authorea.com/users/509226/articles/586727/master/file/data/Self-supervised+Defect+Detection+and+Localization+Based+on+Heatmap+Pseudo+Anomalies+(HPA)/Self-supervised+Defect+Detection+and+Localization+Based+on+Heatmap+Pseudo+Anomalies+(HPA).pdf", "content": "Self-supervised defect detection methods based on pixel-level reconstruction errors and probability density anomalies cannot capture high-level semantic information. Therefore, a U-net structure for semantic segmentation and fuses multi-scale features was adopted to improve self-supervised defect detection methods."}
+{"idx": 7, "title": "Learning Image Representations for Geometric and Semantic ...", "date": "", "ddg_snippet": "To overcome these limitations, we propose a novel model that leverages a self-supervised training strategy to detect and describe local features in real endoscopy images while effectively avoiding specular artifacts.", "subpage_snippet": "", "source": "zaguan.unizar.es", "link": "https://zaguan.unizar.es/record/162668/files/TESIS-2025-251.pdf", "content": "To overcome these limitations, we propose a novel model that leverages a self-supervised training strategy to detect and describe local features in real endoscopy images while effectively avoiding specular artifacts."}
+{"idx": 8, "title": "An Adversarial Behavior Model for Contextual Ethical ...", "date": "", "ddg_snippet": "Given N letters, DIKE employs a self - supervised learning algorithm to generate training data for each letter, modeling L linguistic behaviors in four steps :", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/profile/Edward-Chang-22/publication/380515639_A_Three-Branch_Checks-and-Balances_Framework_for_Context-Aware_Ethical_Alignment_of_Large_Language_Models/links/671b315b55a5271cded9457e/A-Three-Branch-Checks-and-Balances-Framework-for-Context-Aware-Ethical-Alignment-of-Large-Language-Models.pdf", "content": "Given N letters, DIKE employs a self - supervised learning algorithm to generate training data for each letter, modeling L linguistic behaviors in four steps :"}
+{"idx": 9, "title": "A Checks-and-Balances Framework for Context-Aware Ethical AI ...", "date": "", "ddg_snippet": "A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment ... each letter, modeling L linguistic behaviors in four steps . ... scale corpora through ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf/d24155c881921de1284ece531612c8597f7c0a32.pdf", "content": "A Checks-and-Balances Framework for Context-Aware Ethical AI Alignment ... each letter, modeling L linguistic behaviors in four steps . ... scale corpora through ..."}

data/sampled_jsons/Chen_2022_Human-in-the-loop_preference-based_reinforcement_learning_theorems_sections_structure_year_2022.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Preference-Guided Reinforcement Learning for Efficient ...", "date": "", "ddg_snippet": "9 Jul 2024 — In this paper, we investigate preference - based reinforcement learning (PbRL) that allows reinforcement learning (RL) agents to learn from ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2407.06503v1", "content": "9 Jul 2024 — In this paper, we investigate preference - based reinforcement learning (PbRL) that allows reinforcement learning (RL) agents to learn from ..."}
+{"idx": 1, "title": "Sample-Efficient Reinforcement Learning from Human ...", "date": "", "ddg_snippet": "by H Qi · 2025 · Cited by 2 — We first introduce a basic IDS- based algorithm for the RLHF setting where the reward is unobservable and only preference feedback is available (see Sec. 4.1).", "subpage_snippet": "", "source": "www.arxiv.org", "link": "https://www.arxiv.org/pdf/2502.05434", "content": "by H Qi · 2025 · Cited by 2 — We first introduce a basic IDS- based algorithm for the RLHF setting where the reward is unobservable and only preference feedback is available (see Sec. 4.1)."}
+{"idx": 2, "title": "Provable Reward-Agnostic Preference-Based ...", "date": "", "ddg_snippet": "by W Zhan · Cited by 21 — [7] Chen , Xiaoyu, et al. \" Human -in-the- loop : Provably efficient preference - based reinforcement learning with general function approximation.\" International ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=yTBXeXdbMf", "content": "by W Zhan · Cited by 21 — [7] Chen , Xiaoyu, et al. \" Human -in-the- loop : Provably efficient preference - based reinforcement learning with general function approximation.\" International ..."}
+{"idx": 3, "title": "Provably Feedback-Efficient Reinforcement Learning via ...", "date": "", "ddg_snippet": "by D Kong · 2022 · Cited by 14 — We propose a theoretical framework for incorporating humans ' feedback in RL. The frame- work contains two phases: an unsupervised exploration and an active ...", "subpage_snippet": "", "source": "proceedings.neurips.cc", "link": "https://proceedings.neurips.cc/paper_files/paper/2022/file/476c289f685e27936aa089e9d53a4213-Paper-Conference.pdf", "content": "by D Kong · 2022 · Cited by 14 — We propose a theoretical framework for incorporating humans ' feedback in RL. The frame- work contains two phases: an unsupervised exploration and an active ..."}
+{"idx": 4, "title": "Efficient Offline Preference-based Reinforcement Learning ...", "date": "", "ddg_snippet": "by H Hu — [3] Chen , Xiaoyu, et al. \" Human -in-the- loop : Provably efficient preference - based reinforcement learning with general function approximation.\" International ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=MFwYXa796v", "content": "by H Hu — [3] Chen , Xiaoyu, et al. \" Human -in-the- loop : Provably efficient preference - based reinforcement learning with general function approximation.\" International ..."}
+{"idx": 5, "title": "Human as AI mentor: Enhanced human-in-the-loop ...", "date": "", "ddg_snippet": "by Z Huang · 2024 · Cited by 55 — In this paper, we propose an enhanced human -in-the- loop reinforcement learning method, termed the Human as AI mentor- based deep reinforcement learning (HAIM-DRL) ...", "subpage_snippet": "", "source": "www.sciencedirect.com", "link": "https://www.sciencedirect.com/science/article/pii/S2772424724000106", "content": "by Z Huang · 2024 · Cited by 55 — In this paper, we propose an enhanced human -in-the- loop reinforcement learning method, termed the Human as AI mentor- based deep reinforcement learning (HAIM-DRL) ..."}
+{"idx": 6, "title": "High-Confidence Policy Improvement from Human Feedback", "date": "", "ddg_snippet": "by HT Tse — Reinforcement learning from human feedback (RLHF) aims to learn or fine-tune policies via human preference data when a ground-truth reward function is not ...", "subpage_snippet": "", "source": "rlj.cs.umass.edu", "link": "https://rlj.cs.umass.edu/2025/papers/RLJ_RLC_2025_156.pdf", "content": "by HT Tse — Reinforcement learning from human feedback (RLHF) aims to learn or fine-tune policies via human preference data when a ground-truth reward function is not ..."}
+{"idx": 7, "title": "Sequential Preference Ranking for Efficient Reinforcement ...", "date": "", "ddg_snippet": "Human -in-the- loop : Provably efficient preference - based reinforcement learning with general function approximation. In Proceedings of the International ...", "subpage_snippet": "", "source": "nips.cc", "link": "https://nips.cc/virtual/2023/poster/71915", "content": "Human -in-the- loop : Provably efficient preference - based reinforcement learning with general function approximation. In Proceedings of the International ..."}
+{"idx": 8, "title": "Policy Evaluation for Reinforcement Learning from Human ...", "date": "", "ddg_snippet": "by Z Li · 2024 · Cited by 6 — One popular way to do RLHF is by first construct- ing a reward function based on human preference data and then using this reward in a classic reinforcement .", "subpage_snippet": "", "source": "proceedings.mlr.press", "link": "https://proceedings.mlr.press/v238/li24l/li24l.pdf", "content": "by Z Li · 2024 · Cited by 6 — One popular way to do RLHF is by first construct- ing a reward function based on human preference data and then using this reward in a classic reinforcement ."}
+{"idx": 9, "title": "Preference-based RL without a Reward Function", "date": "", "ddg_snippet": "We introduce Inverse Preference Learning , a novel algorithm for offline preference - based RL that avoids learning a reward function .", "subpage_snippet": "", "source": "neurips.cc", "link": "https://neurips.cc/virtual/2023/poster/70866", "content": "We introduce Inverse Preference Learning , a novel algorithm for offline preference - based RL that avoids learning a reward function ."}

data/sampled_jsons/CoPINN_Section_2.4_sample_difficulty_evaluation_mechanism_training_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Training a Helpful and Harmless Assistant with ...", "date": "", "ddg_snippet": "by Y Bai · 2022 · Cited by 2766 — An obvious issue with the qualitative evaluation of samples is that it's difficult to know to what extent they have been cherry-picked. To ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2204.05862", "content": "by Y Bai · 2022 · Cited by 2766 — An obvious issue with the qualitative evaluation of samples is that it's difficult to know to what extent they have been cherry-picked. To ..."}
+{"idx": 1, "title": "Training Evaluation Investigating Core Self - TopSCHOLAR", "date": "", "ddg_snippet": "by TP Patterson · 2015 · Cited by 3 — Possible reasons for this lack of support include a small sample size, a lack of responses to the transfer survey, the number of different courses evaluated, ...", "subpage_snippet": "", "source": "digitalcommons.wku.edu", "link": "https://digitalcommons.wku.edu/cgi/viewcontent.cgi?article=2536&context=theses", "content": "by TP Patterson · 2015 · Cited by 3 — Possible reasons for this lack of support include a small sample size, a lack of responses to the transfer survey, the number of different courses evaluated, ..."}
+{"idx": 2, "title": "A sampling approach to Debiasing the offline evaluation of ...", "date": "", "ddg_snippet": "by D Carraro · 2022 · Cited by 13 — In Sections 2.4 and 2.5, we describe unbiased metrics and debiasing ... We use D val as the validation set to optimize recommender system ...", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/article/10.1007/s10844-021-00651-y", "content": "by D Carraro · 2022 · Cited by 13 — In Sections 2.4 and 2.5, we describe unbiased metrics and debiasing ... We use D val as the validation set to optimize recommender system ..."}
+{"idx": 3, "title": "Evaluating cognitive control training on symptoms of ...", "date": "", "ddg_snippet": "by ANS Lass · 2021 · Cited by 13 — Findings suggest that cognitive control training may reduce depressive symptoms and that the stressful component of the aPASAT may be important in that ...", "subpage_snippet": "", "source": "www.sciencedirect.com", "link": "https://www.sciencedirect.com/science/article/pii/S2666915321000548", "content": "by ANS Lass · 2021 · Cited by 13 — Findings suggest that cognitive control training may reduce depressive symptoms and that the stressful component of the aPASAT may be important in that ..."}
+{"idx": 4, "title": "Relationship between training status and stress response ...", "date": "", "ddg_snippet": "by J Gao — Training status is a significant predictor of sport performance strategies, coping styles, and stress responses among college student-athletes.", "subpage_snippet": "", "source": "www.frontiersin.org", "link": "https://www.frontiersin.org/journals/psychology/articles/10.3389/fpsyg.2025.1597539/full", "content": "by J Gao — Training status is a significant predictor of sport performance strategies, coping styles, and stress responses among college student-athletes."}
+{"idx": 5, "title": "Handbook for Monitoring and Evaluation", "date": "", "ddg_snippet": "It is a toolkit…a collection of tools each of which is designed to support the monitoring and evaluation function. As a management responsibility, monitoring ... 163 pages", "subpage_snippet": "", "source": "www.measureevaluation.org", "link": "https://www.measureevaluation.org/resources/training/capacity-building-resources/basic-me-concepts-portuguese/IFRC_Monitoring+and+Evaluation+handbook.pdf", "content": "It is a toolkit…a collection of tools each of which is designed to support the monitoring and evaluation function. As a management responsibility, monitoring ... 163 pages"}
+{"idx": 6, "title": "Flight emotions unleashed: Navigating training phases and ...", "date": "", "ddg_snippet": "by A Ruiz‐Segura · 2024 · Cited by 4 — Understand pilot trainees' performance and emotional dynamics (intensity, frequency and variability) based on training phase and difficulty level in a flight ...", "subpage_snippet": "", "source": "onlinelibrary.wiley.com", "link": "https://onlinelibrary.wiley.com/doi/full/10.1111/jcal.13037", "content": "by A Ruiz‐Segura · 2024 · Cited by 4 — Understand pilot trainees' performance and emotional dynamics (intensity, frequency and variability) based on training phase and difficulty level in a flight ..."}
+{"idx": 7, "title": "Asking for Knowledge: Training RL Agents to Query External ...", "date": "", "ddg_snippet": "by IJ Liu · 2022 · Cited by 17 — To solve difficult tasks, humans ask questions to acquire knowledge from external sources. In con- trast, classical reinforcement learning agents lack such an ...", "subpage_snippet": "", "source": "proceedings.mlr.press", "link": "https://proceedings.mlr.press/v162/liu22t/liu22t.pdf", "content": "by IJ Liu · 2022 · Cited by 17 — To solve difficult tasks, humans ask questions to acquire knowledge from external sources. In con- trast, classical reinforcement learning agents lack such an ..."}
+{"idx": 8, "title": "Class imbalance should not throw you off balance", "date": "", "ddg_snippet": "by P Thölke · 2023 · Cited by 165 — This paper provides a didactic assessment of the class imbalance problem and illustrates its impact through systematic manipulation of data imbalance ratios.", "subpage_snippet": "", "source": "www.sciencedirect.com", "link": "https://www.sciencedirect.com/science/article/pii/S1053811923004044", "content": "by P Thölke · 2023 · Cited by 165 — This paper provides a didactic assessment of the class imbalance problem and illustrates its impact through systematic manipulation of data imbalance ratios."}
+{"idx": 9, "title": "The coping insights evident through self‐reflection on ...", "date": "", "ddg_snippet": "by SL Falon · 2022 · Cited by 22 — Research has demonstrated that adaptive forms of self‐reflection on stressor events and insight may strengthen resilient capacities.", "subpage_snippet": "", "source": "pmc.ncbi.nlm.nih.gov", "link": "https://pmc.ncbi.nlm.nih.gov/articles/PMC10078775/", "content": "by SL Falon · 2022 · Cited by 22 — Research has demonstrated that adaptive forms of self‐reflection on stressor events and insight may strengthen resilient capacities."}

data/sampled_jsons/Crocker_Stacks_topological_data_analysis_persistence.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Capturing dynamics of time-varying data via topology", "date": "", "ddg_snippet": "by L Xian · 2022 · Cited by 29 — A crocker stack is convenient for visualization purposes since topological information for all times and at all scales in the data set is displayed as a single ...", "subpage_snippet": "", "source": "www.aimsciences.org", "link": "https://www.aimsciences.org/article/doi/10.3934/fods.2021033", "content": "by L Xian · 2022 · Cited by 29 — A crocker stack is convenient for visualization purposes since topological information for all times and at all scales in the data set is displayed as a single ..."}
+{"idx": 1, "title": "Topological Data Analysis Approaches to Uncovering the ...", "date": "", "ddg_snippet": "by MV Ciocanel · 2021 · Cited by 15 — So, instead of counting the number of features at each time and persistence scale (as in crocker plots), we keep track of the birth and death ...", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/article/10.1007/s11538-020-00847-3", "content": "by MV Ciocanel · 2021 · Cited by 15 — So, instead of counting the number of features at each time and persistence scale (as in crocker plots), we keep track of the birth and death ..."}
+{"idx": 2, "title": "Spatial and Sequential Topological Analysis of Molecular ...", "date": "", "ddg_snippet": "by M Kleczynski · 2025 · Cited by 1 — In this paper, we introduce the Gaussian CROCKER column differences (GCCD) matrix, which augments standard topological data analysis summaries with biological ...", "subpage_snippet": "", "source": "pubs.acs.org", "link": "https://pubs.acs.org/doi/full/10.1021/acs.jctc.5c00161", "content": "by M Kleczynski · 2025 · Cited by 1 — In this paper, we introduce the Gaussian CROCKER column differences (GCCD) matrix, which augments standard topological data analysis summaries with biological ..."}
+{"idx": 3, "title": "Neural Persistence Dynamics", "date": "", "ddg_snippet": "In our context, both crocker plots & stacks have been successfully used as input to regression methods to estimate the parametrization of models of collective ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2405.15732v2", "content": "In our context, both crocker plots & stacks have been successfully used as input to regression methods to estimate the parametrization of models of collective ..."}
+{"idx": 4, "title": "A computational topology-based spatiotemporal analysis ...", "date": "", "ddg_snippet": "by G Gharooni-Fard · 2024 · Cited by 3 — Each column of a CROCKER matrix records the number of topological features, such as the number of components or holes, that exist in the data ...", "subpage_snippet": "", "source": "www.nature.com", "link": "https://www.nature.com/articles/s44260-024-00003-1", "content": "by G Gharooni-Fard · 2024 · Cited by 3 — Each column of a CROCKER matrix records the number of topological features, such as the number of components or holes, that exist in the data ..."}
+{"idx": 5, "title": "Persistent Topological Features in Large Language Models", "date": "", "ddg_snippet": "14 Oct 2024 — We present a novel framework based on zigzag persistence , a method in topological data analysis (TDA) well-suited for describing data undergoing dynamic ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2410.11042v1", "content": "14 Oct 2024 — We present a novel framework based on zigzag persistence , a method in topological data analysis (TDA) well-suited for describing data undergoing dynamic ..."}
+{"idx": 6, "title": "Neural Persistence Dynamics", "date": "", "ddg_snippet": "Runtime comparison to PRIOR WORK (using topological summaries). Below, we list the overall training times for our approach, Crocker Stacks , and the PSK method.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=rCnZrFikX6&referrer=[the+profile+of+Sebastian+Zeng](/profile?id=~Sebastian_Zeng1)", "content": "Runtime comparison to PRIOR WORK (using topological summaries). Below, we list the overall training times for our approach, Crocker Stacks , and the PSK method."}
+{"idx": 7, "title": "Neural Persistence Dynamics", "date": "", "ddg_snippet": "by S Zeng · 2024 — In our context, both crocker plots & stacks have been successfully used as input to regression methods to estimate the parametrization of models of collective ... 24 pages", "subpage_snippet": "", "source": "proceedings.neurips.cc", "link": "https://proceedings.neurips.cc/paper_files/paper/2024/file/3a509449a73fd0aab8c0cf5705827036-Paper-Conference.pdf", "content": "by S Zeng · 2024 — In our context, both crocker plots & stacks have been successfully used as input to regression methods to estimate the parametrization of models of collective ... 24 pages"}
+{"idx": 8, "title": "Topological Data Analysis", "date": "", "ddg_snippet": "Topological data analysis (TDA) refers to a family of techniques and viewpoints aimed at looking at the shape of data.", "subpage_snippet": "", "source": "dsweb.siam.org", "link": "https://dsweb.siam.org/The-Magazine/Article/topological-data-analysis-1", "content": "Topological data analysis (TDA) refers to a family of techniques and viewpoints aimed at looking at the shape of data."}
+{"idx": 9, "title": "Detecting bifurcations in dynamical systems with ...", "date": "", "ddg_snippet": "8 Sept 2022 — we describe an alternative method based on persistent homology—a tool from topological data analysis —that utilizes Betti numbers and CROCKER ...", "subpage_snippet": "", "source": "pubs.aip.org", "link": "https://pubs.aip.org/aip/cha/article/32/9/093111/2835867/Detecting-bifurcations-in-dynamical-systems-with", "content": "8 Sept 2022 — we describe an alternative method based on persistent homology—a tool from topological data analysis —that utilizes Betti numbers and CROCKER ..."}

data/sampled_jsons/Cui_license_conflict_empirical_study_open_source_software_behavioral_restrictions_model_output.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "An Empirical Study of License Conflict in Free and Open Source ...", "date": "", "ddg_snippet": "Abstract—Free and Open Source Software (FOSS) has become the fundamental infrastructure of mainstream software projects. FOSS is subject to various legal ...", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/pdf/10.1109/ICSE-SEIP58684.2023.00050", "content": "Abstract—Free and Open Source Software (FOSS) has become the fundamental infrastructure of mainstream software projects. FOSS is subject to various legal ..."}
+{"idx": 1, "title": "OSS-LCAF: Open-Source Software License Conflict ...", "date": "", "ddg_snippet": "11 Sept 2025 — An empirical study of license conflict in free and open source software . In 2023 IEEE/ACM 45th International Conference on Software Engineering: ...", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/10.1109/ICSE-Companion66252.2025.00084", "content": "11 Sept 2025 — An empirical study of license conflict in free and open source software . In 2023 IEEE/ACM 45th International Conference on Software Engineering: ..."}
+{"idx": 2, "title": "Current Model Licensing Practices are Dragging Us into a ...", "date": "", "ddg_snippet": "Cui , X., Wu, J., Wu, Y., Wang, X., Luo, T., Qu, S., Ling,. X., and Yang, M. An empirical study of license conflict in free and open source software . In IEEE ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf/4bb8da2945abd31f3e42d0e5f0a87a8bb47ddc9c.pdf", "content": "Cui , X., Wu, J., Wu, Y., Wang, X., Luo, T., Qu, S., Ling,. X., and Yang, M. An empirical study of license conflict in free and open source software . In IEEE ..."}
+{"idx": 3, "title": "They've Stolen My GPL-Licensed Model!", "date": "", "ddg_snippet": "16 Dec 2024 — An Empirical Study of License Conflict in Free and Open Source Software . In 2023 IEEE/ACM 45th International Conference on Software ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2412.11483v1", "content": "16 Dec 2024 — An Empirical Study of License Conflict in Free and Open Source Software . In 2023 IEEE/ACM 45th International Conference on Software ..."}
+{"idx": 4, "title": "Current Model Licensing Practices are Dragging Us into a ...", "date": "", "ddg_snippet": "Cui , X., Wu, J., Wu, Y., Wang, X., Luo, T., Qu, S., Ling, X., and Yang, M. An empirical study of license conflict in free and open source software . In IEEE ...", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/40180", "content": "Cui , X., Wu, J., Wu, Y., Wang, X., Luo, T., Qu, S., Ling, X., and Yang, M. An empirical study of license conflict in free and open source software . In IEEE ..."}
+{"idx": 5, "title": "A Systematic Literature Review on OSS License ...", "date": "", "ddg_snippet": "by B Li · 2025 · Cited by 1 — Yang, “An empirical study of license conflict in free and open source software ,” in 2023 IEEE/ACM 45th International Conference on. Software ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2507.05270", "content": "by B Li · 2025 · Cited by 1 — Yang, “An empirical study of license conflict in free and open source software ,” in 2023 IEEE/ACM 45th International Conference on. Software ..."}
+{"idx": 6, "title": "Open Source Software and the “Private-Collective” Innovation ...", "date": "", "ddg_snippet": "by E Hippel · 2003 · Cited by 3427 — In this paper, we propose that open source software development is an exemplar of a compound “private-collective” model of innovation.", "subpage_snippet": "", "source": "pubsonline.informs.org", "link": "https://pubsonline.informs.org/doi/10.1287/orsc.14.2.209.14992", "content": "by E Hippel · 2003 · Cited by 3427 — In this paper, we propose that open source software development is an exemplar of a compound “private-collective” model of innovation."}
+{"idx": 7, "title": "Is there collaboration in open collaboration? The role of ...", "date": "", "ddg_snippet": "by S Brunswicker · 2025 — We explore, in the case of Open Source software development, if and how different actor types and task complexity can be linked to such collaborative problem - ...", "subpage_snippet": "", "source": "www.sciencedirect.com", "link": "https://www.sciencedirect.com/science/article/pii/S0166497225001579", "content": "by S Brunswicker · 2025 — We explore, in the case of Open Source software development, if and how different actor types and task complexity can be linked to such collaborative problem - ..."}
+{"idx": 8, "title": "How Issue Classification Influences Software Defect ...", "date": "", "ddg_snippet": "by P Afric · 2023 · Cited by 14 — In this paper, we investigate the influence issue classification has on software defect prediction dataset quality and resulting model .", "subpage_snippet": "", "source": "ieeexplore.ieee.org", "link": "https://ieeexplore.ieee.org/iel7/6287639/10005208/10035995.pdf", "content": "by P Afric · 2023 · Cited by 14 — In this paper, we investigate the influence issue classification has on software defect prediction dataset quality and resulting model ."}
+{"idx": 9, "title": "an empirical study of pre-trained model naming ...", "date": "", "ddg_snippet": "by W Jiang · 2025 · Cited by 2 — The survey results indicate a mismatch between engineers' preferences and current practices in PTM naming. We then introduce DARA, the first ...", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/article/10.1007/s10664-025-10711-4", "content": "by W Jiang · 2025 · Cited by 2 — The survey results indicate a mismatch between engineers' preferences and current practices in PTM naming. We then introduce DARA, the first ..."}

data/sampled_jsons/DCBM_Data-Efficient_Visual_Concept_Bottleneck_Models_applicability_limited_factors.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.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2412.11576", "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."}
+{"idx": 1, "title": "DCBM: Data-Efficient Visual Concept Bottleneck Models", "date": "", "ddg_snippet": "Due to size limitations, we couldn't upload the complete dataset and corresponding concepts . We uploaded the empty structure to ensure all scripts run smoothly.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/KathPra/DCBM", "content": "Due to size limitations, we couldn't upload the complete dataset and corresponding concepts . We uploaded the empty structure to ensure all scripts run smoothly."}
+{"idx": 2, "title": "DCBM: Data-Efficient Visual Concept Bottleneck Models :: MPG.PuRe", "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": "pure.mpg.de", "link": "https://pure.mpg.de/pubman/faces/ViewItemFullPage.jsp?itemId=item_3636912_1&view=ACTIONS", "content": "scenarios. We propose Data - efficient CBMs ( DCBMs ), which reduce the need for large sample sizes during concept generation while preserving interpretability."}
+{"idx": 3, "title": "Cross-Modality Image Interpretation via Concept Decomposition ...", "date": "", "ddg_snippet": "May 20, 2024 · Interpretable image classification is crucial for making decisions in high-stakes scenarios. Recent advancements have demonstrated that interpretable models can achieve performance comparable to black-box models by integrating Visual Language Models (VLMs) with Concept Bottleneck Models ( CBMs ).", "subpage_snippet": "", "source": "ieeexplore.ieee.org", "link": "https://ieeexplore.ieee.org/document/10535313", "content": "May 20, 2024 · Interpretable image classification is crucial for making decisions in high-stakes scenarios. Recent advancements have demonstrated that interpretable models can achieve performance comparable to black-box models by integrating Visual Language Models (VLMs) with Concept Bottleneck Models ( CBMs )."}
+{"idx": 4, "title": "Decoupling Concept Bottleneck Model - OpenReview", "date": "", "ddg_snippet": "Feb 1, 2023 · We analyze the concept/label trade-off for Concept Bottleneck Model ( CBM ) and propose a new interactive and interpretable AI system to alleviate this issue.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=vVbUB9oWUup", "content": "Feb 1, 2023 · We analyze the concept/label trade-off for Concept Bottleneck Model ( CBM ) and propose a new interactive and interpretable AI system to alleviate this issue."}
+{"idx": 5, "title": "DCBM: Data-Efficient Visual Concept Bottleneck Models", "date": "", "ddg_snippet": "Dec 16, 2024 · Attribution analysis using Grad-CAM demonstrates that DCBMs deliver visual concepts that can be localized in test images. By leveraging dataset-specific concepts instead of predefined ones, DCBMs enhance adaptability to new domains.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2412.11576", "content": "Dec 16, 2024 · Attribution analysis using Grad-CAM demonstrates that DCBMs deliver visual concepts that can be localized in test images. By leveraging dataset-specific concepts instead of predefined ones, DCBMs enhance adaptability to new domains."}
+{"idx": 6, "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": 7, "title": "Computer Vision & Machine Learning (Prof. Dr.-Ing. Margret", "date": "", "ddg_snippet": "DCBM : Data - Efficient Visual Concept Bottleneck Models . International Conference on ... ... dataset frames. In Proceedings of the Winter Conference ...", "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": "DCBM : Data - Efficient Visual Concept Bottleneck Models . International Conference on ... ... dataset frames. In Proceedings of the Winter Conference ..."}
+{"idx": 8, "title": "Publications | Universität Mannheim", "date": "", "ddg_snippet": "... cost proxies-from neural architecture performance prediction to model robustness, J. ... DCBM : Data - Efficient Visual Concept Bottleneck Models , K.", "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/publications/", "content": "... cost proxies-from neural architecture performance prediction to model robustness, J. ... DCBM : Data - Efficient Visual Concept Bottleneck Models , K."}
+{"idx": 9, "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 ..."}

data/sampled_jsons/DSDFM_drift_term_stochastic_differential_equation_human_motion_synthesis.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Deterministic-to-Stochastic Diverse Latent Feature Mapping for Human ...", "date": "", "ddg_snippet": "In this paper, we propose a Deterministic-to- Stochastic Diverse Latent Feature Mapping ( DSDFM ) method for human motion synthesis . DSDFM consists of two stages. The first human motion reconstruction stage aims to learn the latent space distribution of human motions .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2505.00998", "content": "In this paper, we propose a Deterministic-to- Stochastic Diverse Latent Feature Mapping ( DSDFM ) method for human motion synthesis . DSDFM consists of two stages. The first human motion reconstruction stage aims to learn the latent space distribution of human motions ."}
+{"idx": 1, "title": "PDF Lecture 8: Stochastic Differential Equations", "date": "", "ddg_snippet": "0 0 (2) Each term in (1) has a different interpretation. The term b(Xt;t)dt is called the drift term . It describes the deterministic part of the equation . When this is the only term , we obtain an ODE. The term s(Xt;t)dWt is called the diffusion term . It describes random motion proportional to a Brow-nian motion .", "subpage_snippet": "", "source": "personal.math.ubc.ca", "link": "https://personal.math.ubc.ca/~holmescerfon/teaching/asa22/handout-Lecture8_2022.pdf", "content": "0 0 (2) Each term in (1) has a different interpretation. The term b(Xt;t)dt is called the drift term . It describes the deterministic part of the equation . When this is the only term , we obtain an ODE. The term s(Xt;t)dWt is called the diffusion term . It describes random motion proportional to a Brow-nian motion ."}
+{"idx": 2, "title": "Drift parameter estimation in stochastic differential equation with ...", "date": "", "ddg_snippet": "Keywords Stochastic differential equation , weak and strong solutions, stochastic volatility, drift parameter estimation, maximum likelihood estimator, strong consistency", "subpage_snippet": "", "source": "www.vmsta.org", "link": "https://www.vmsta.org/journal/VMSTA/article/74/file/pdf", "content": "Keywords Stochastic differential equation , weak and strong solutions, stochastic volatility, drift parameter estimation, maximum likelihood estimator, strong consistency"}
+{"idx": 3, "title": "Modeling the Drift Function in Stochastic Differential Equations using ...", "date": "", "ddg_snippet": "In this paper, we propose a Gaussian process-based nonlinear, time-varying drift model for stochastic differential equations . In particular, we combine eigenfunction expansion of the Gaussian process' covariance kernel in the spatial input variables with spectral decomposition in the time domain to obtain a reduced rank state space representation of the drift model, which avoids the growing ...", "subpage_snippet": "", "source": "www.sciencedirect.com", "link": "https://www.sciencedirect.com/science/article/pii/S2405896318317981", "content": "In this paper, we propose a Gaussian process-based nonlinear, time-varying drift model for stochastic differential equations . In particular, we combine eigenfunction expansion of the Gaussian process' covariance kernel in the spatial input variables with spectral decomposition in the time domain to obtain a reduced rank state space representation of the drift model, which avoids the growing ..."}
+{"idx": 4, "title": "Stochastic differential equations and noise: driven, drifting,...?", "date": "", "ddg_snippet": "In stochastic (partial) differential equations (S (P)DEs), the term \"driven by\" noise is often used to describe the role of the stochastic term in the equation .", "subpage_snippet": "", "source": "math.stackexchange.com", "link": "https://math.stackexchange.com/questions/4699752/stochastic-differential-equations-and-noise-driven-drifting", "content": "In stochastic (partial) differential equations (S (P)DEs), the term \"driven by\" noise is often used to describe the role of the stochastic term in the equation ."}
+{"idx": 5, "title": "Regular Diffusion and Stochastic Differential Equation with ... - Springer", "date": "", "ddg_snippet": "In this paper, we shall discuss some relations between the one-dimensional regular diffusion and stochastic differential equation with generalized drift . We give a neces-sary and sufficient condition for a regular diffusion to satisfy a stochastic differential equation with measure-valued drift .", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/content/pdf/10.1007/s10959-025-01413-0", "content": "In this paper, we shall discuss some relations between the one-dimensional regular diffusion and stochastic differential equation with generalized drift . We give a neces-sary and sufficient condition for a regular diffusion to satisfy a stochastic differential equation with measure-valued drift ."}
+{"idx": 6, "title": "PDF Long-time dynamics of stochastic differential equations", "date": "", "ddg_snippet": "1.1 Brownian motion The fundamental building block of the theory of stochastic di erential equations is a math- ff", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2106.12998.pdf", "content": "1.1 Brownian motion The fundamental building block of the theory of stochastic di erential equations is a math- ff"}
+{"idx": 7, "title": "CVPR 2025 Open Access Repository", "date": "", "ddg_snippet": "However, their training process involves complex curvature trajectories, leading to unstable training process.In this paper, we propose a Deterministic-to- Stochastic Diverse Latent Feature Mapping ( DSDFM ) method for human motion synthesis . DSDFM consists of two stages.", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/html/Hua_Deterministic-to-Stochastic_Diverse_Latent_Feature_Mapping_for_Human_Motion_Synthesis_CVPR_2025_paper.html", "content": "However, their training process involves complex curvature trajectories, leading to unstable training process.In this paper, we propose a Deterministic-to- Stochastic Diverse Latent Feature Mapping ( DSDFM ) method for human motion synthesis . DSDFM consists of two stages."}
+{"idx": 8, "title": "arXiv:2505.00998v1 [cs.CV] 2 May 2025", "date": "", "ddg_snippet": "To synthesize diverse and accurate human motions , we propose a novel method called DSDFM for human motion synthesis . The proposed method has straight trajectories and is easy to train compared to previous SGMs methods, while guaranteeing the diversity and accuracy of the generated hu-man motions . The proposed DSDFM consists of two stages. In the first stage, a human motion reconstruction ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2505.00998", "content": "To synthesize diverse and accurate human motions , we propose a novel method called DSDFM for human motion synthesis . The proposed method has straight trajectories and is easy to train compared to previous SGMs methods, while guaranteeing the diversity and accuracy of the generated hu-man motions . The proposed DSDFM consists of two stages. In the first stage, a human motion reconstruction ..."}
+{"idx": 9, "title": "PDF Appendix - CVF Open Access", "date": "", "ddg_snippet": "n-to-Moti s of DSDFM . We present the diverse human motion sequences under differ ent D.1. Metric Definitions In this work, we use the following metrics to measure the per-formance of the proposed method for unconditional human motion synthesis and Action-to- Motion tasks. ance (FID). FID calculates the distribution distance between the generated ...", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/supplemental/Hua_Deterministic-to-Stochastic_Diverse_Latent_CVPR_2025_supplemental.pdf", "content": "n-to-Moti s of DSDFM . We present the diverse human motion sequences under differ ent D.1. Metric Definitions In this work, we use the following metrics to measure the per-formance of the proposed method for unconditional human motion synthesis and Action-to- Motion tasks. ance (FID). FID calculates the distribution distance between the generated ..."}

data/sampled_jsons/Dasgupta_hierarchical_clustering_cost_function_2016_year_2020.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "PDF A cost function for similarity-based hierarchical clustering", "date": "", "ddg_snippet": "The development of algorithms for hierarchical clustering has been hampered by a shortage of precise objective functions . To help address this situation, we introduce a simple cost function on hierarchies over a set of points, given pairwise similarities between those points. We show that this criterion behaves sensibly in canonical instances and that it admits a top-down construction ...", "subpage_snippet": "", "source": "cseweb.ucsd.edu", "link": "https://cseweb.ucsd.edu/~dasgupta/papers/hier-cost.pdf", "content": "The development of algorithms for hierarchical clustering has been hampered by a shortage of precise objective functions . To help address this situation, we introduce a simple cost function on hierarchies over a set of points, given pairwise similarities between those points. We show that this criterion behaves sensibly in canonical instances and that it admits a top-down construction ..."}
+{"idx": 1, "title": "A cost function for similarity-based hierarchical clustering", "date": "", "ddg_snippet": "The development of algorithms for hierarchical clustering has been hampered by a shortage of precise objective functions . To help address this situation, we introduce a simple cost function on hierarchies over a set of points, given pairwise similarities between those points. We show that this criterion behaves sensibly in canonical instances and that it admits a top-down construction ...", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/10.1145/2897518.2897527", "content": "The development of algorithms for hierarchical clustering has been hampered by a shortage of precise objective functions . To help address this situation, we introduce a simple cost function on hierarchies over a set of points, given pairwise similarities between those points. We show that this criterion behaves sensibly in canonical instances and that it admits a top-down construction ..."}
+{"idx": 2, "title": "Hierarchical Clustering via Spreading Metrics - jmlr.org", "date": "", "ddg_snippet": "Hierarchical Clustering via Spreading Metrics Aurko Roy, Sebastian Pokutta; 18 (88):1−35, 2017. Abstract We study the cost function for hierarchical clusterings introduced by ( Dasgupta , 2016 ) where hierarchies are treated as first-class objects rather than deriving their cost from projections into flat clusters.", "subpage_snippet": "", "source": "jmlr.org", "link": "https://jmlr.org/papers/v18/17-081.html", "content": "Hierarchical Clustering via Spreading Metrics Aurko Roy, Sebastian Pokutta; 18 (88):1−35, 2017. Abstract We study the cost function for hierarchical clusterings introduced by ( Dasgupta , 2016 ) where hierarchies are treated as first-class objects rather than deriving their cost from projections into flat clusters."}
+{"idx": 3, "title": "An Improved Cost Function for Hierarchical Cluster Trees", "date": "", "ddg_snippet": "Dasgupta proposed to study the hierarchical clustering problem from an optimization point of view, and introduced an intuitive cost function for similarity-based hierarchical clustering with nice properties as well as natural approximation algorithms.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/1812.02715", "content": "Dasgupta proposed to study the hierarchical clustering problem from an optimization point of view, and introduced an intuitive cost function for similarity-based hierarchical clustering with nice properties as well as natural approximation algorithms."}
+{"idx": 4, "title": "A cost function for similarity-based hierarchical clustering", "date": "", "ddg_snippet": "Sanjoy Dasgupta . \"A cost function for similarity-based hierarchical clustering .\" Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ( 2016 ) 118-127 MLA Harvard CSL-JSON BibTeX", "subpage_snippet": "", "source": "scholar.archive.org", "link": "https://scholar.archive.org/work/2o37ccd6rnandikw5zjscxz23e", "content": "Sanjoy Dasgupta . \"A cost function for similarity-based hierarchical clustering .\" Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ( 2016 ) 118-127 MLA Harvard CSL-JSON BibTeX"}
+{"idx": 5, "title": "Hierarchical cost — Higra 0.6.12 documentation", "date": "", "ddg_snippet": "See: S. Dasgupta . \" A cost function for similarity-based hierarchical clustering .\" In Proc. STOC, pages 118-127, Cambridge, MA, USA, 2016 Complexity: The runtime complexity is O (n log (n) + m) with n the number of nodes in T and m the number of edges in E. Parameters: tree - Input tree edge_weights - Edge weights on the leaf graph of the input tree leaf_graph - Leaf graph of ...", "subpage_snippet": "", "source": "higra.readthedocs.io", "link": "https://higra.readthedocs.io/en/stable/python/hierarchical_cost.html", "content": "See: S. Dasgupta . \" A cost function for similarity-based hierarchical clustering .\" In Proc. STOC, pages 118-127, Cambridge, MA, USA, 2016 Complexity: The runtime complexity is O (n log (n) + m) with n the number of nodes in T and m the number of edges in E. Parameters: tree - Input tree edge_weights - Edge weights on the leaf graph of the input tree leaf_graph - Leaf graph of ..."}
+{"idx": 6, "title": "A cost function for similarity-based hierarchical clustering", "date": "", "ddg_snippet": "Dasgupta ( 2016 ) framed similarity-based hierarchical clustering as a combinatorial optimization problem, where a \"good\" hierarchical clustering is one that minimizes a particular cost function .", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/303901538_A_cost_function_for_similarity-based_hierarchical_clustering", "content": "Dasgupta ( 2016 ) framed similarity-based hierarchical clustering as a combinatorial optimization problem, where a \"good\" hierarchical clustering is one that minimizes a particular cost function ."}
+{"idx": 7, "title": "Hierarchical Clustering via Spreading Metrics", "date": "", "ddg_snippet": "Authors Aurko Roy, Sebastian Pokutta Abstract We study the cost function for hierarchical clusterings introduced by [ Dasgupta , 2015] where hierarchies are treated as first-class objects rather than deriving their cost from projections into flat clusters. It was also shown in [ Dasgupta , 2015] that a top-down algorithm returns a hierarchical clustering of cost at most (O\\left (\\alpha n \\log n ...", "subpage_snippet": "", "source": "papers.nips.cc", "link": "https://papers.nips.cc/paper/by-source-2016-1199", "content": "Authors Aurko Roy, Sebastian Pokutta Abstract We study the cost function for hierarchical clusterings introduced by [ Dasgupta , 2015] where hierarchies are treated as first-class objects rather than deriving their cost from projections into flat clusters. It was also shown in [ Dasgupta , 2015] that a top-down algorithm returns a hierarchical clustering of cost at most (O\\left (\\alpha n \\log n ..."}
+{"idx": 8, "title": "Sci-Hub | A cost function for similarity-based hierarchical clustering ...", "date": "", "ddg_snippet": "Dasgupta , S. ( 2016 ). A cost function for similarity-based hierarchical clustering . Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 . doi:10.1145/2897518.2897527", "subpage_snippet": "", "source": "sci-hub.se", "link": "https://sci-hub.se/10.1145/2897518.2897527", "content": "Dasgupta , S. ( 2016 ). A cost function for similarity-based hierarchical clustering . Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 . doi:10.1145/2897518.2897527"}
+{"idx": 9, "title": "Hierarchical Clustering: Objective Functions and Algorithms: Journal of ...", "date": "", "ddg_snippet": "Motivated by the fact that most work on hierarchical clustering was based on providing algorithms, rather than optimizing a specific objective, Dasgupta framed similarity-based hierarchical clustering as a combinatorial optimization problem, where a \"good\" hierarchical clustering is one that minimizes a particular cost function [23].", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/10.1145/3321386", "content": "Motivated by the fact that most work on hierarchical clustering was based on providing algorithms, rather than optimizing a specific objective, Dasgupta framed similarity-based hierarchical clustering as a combinatorial optimization problem, where a \"good\" hierarchical clustering is one that minimizes a particular cost function [23]."}

data/sampled_jsons/Descriptor-In-Pixel_Point-Feature_Tracking_Equation_2_response_R_calculation.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Descriptor - In - Pixel : Point - Feature Tracking For Pixel Processor...", "date": "", "ddg_snippet": "Our in - pixel approach for point - feature detection and tracking is designed specifically for the PPA’s architec-ture, providing high pixel-processor compute resource util-isation, and minimizing data transfer between sensor and external processing.", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/papers/Bose_Descriptor-In-Pixel__Point-Feature_Tracking_For_Pixel_Processor_Arrays_CVPR_2025_paper.pdf", "content": "Our in - pixel approach for point - feature detection and tracking is designed specifically for the PPA’s architec-ture, providing high pixel-processor compute resource util-isation, and minimizing data transfer between sensor and external processing."}
+{"idx": 1, "title": "Descriptor - In - Pixel : Point - Feature Tracking For Pixel Processor...", "date": "", "ddg_snippet": "This paper presents a novel approach for joint point - feature detection and tracking , specifically designed for Pixel Processor Array sensors (PPA).", "subpage_snippet": "", "source": "papers.cool", "link": "https://papers.cool/venue/Bose_Descriptor-In-Pixel__Point-Feature_Tracking_For_Pixel_Processor_Arrays@CVPR2025@CVF", "content": "This paper presents a novel approach for joint point - feature detection and tracking , specifically designed for Pixel Processor Array sensors (PPA)."}
+{"idx": 2, "title": "GitHub - wangxiao5791509/Single_Object_ Tracking _Paper_List...", "date": "", "ddg_snippet": "Descriptor - In - Pixel : Point - Feature Tracking For Pixel Processor Arrays Laurie Bose · Piotr Dudek · Jianing Chen.\"Target Response Adaptation for Correlation Filter Tracking .\"", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/wangxiao5791509/Single_Object_Tracking_Paper_List", "content": "Descriptor - In - Pixel : Point - Feature Tracking For Pixel Processor Arrays Laurie Bose · Piotr Dudek · Jianing Chen.\"Target Response Adaptation for Correlation Filter Tracking .\""}
+{"idx": 3, "title": "Face Tracking via Afne", "date": "", "ddg_snippet": "Face Tracking via Afne Invariant Features in Video. Feature point tracking for connecting faces has also been used in [19]. The goal of that work is automatic naming of characters in video sequences based on face tracks classi-cation with pretrained SVMs .", "subpage_snippet": "", "source": "infoscience.epfl.ch", "link": "https://infoscience.epfl.ch/server/api/core/bitstreams/6cf5222b-d745-4ab2-89e8-0ab1156b452f/content", "content": "Face Tracking via Afne Invariant Features in Video. Feature point tracking for connecting faces has also been used in [19]. The goal of that work is automatic naming of characters in video sequences based on face tracks classi-cation with pretrained SVMs ."}
+{"idx": 4, "title": "Feature point tracking combining the Interacting Multiple Model", "date": "", "ddg_snippet": "The feature point tracking techniques proposed in the literature can be classied into heuristic and statistical methods.5. Most of the heuristic techniques are based on the motion smoothness constraint, which prevents its application to real sequences.5 Sethi and Jain4 expressed this motion...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/profile/Yousri-Abdeljaoued/publication/37439304_Feature_point_tracking_combining_the_Interacting_Multiple_Model_filter_and_an_efficient_assignment_algorithm/links/0fcfd50b5d21f49d26000000/Feature-point-tracking-combining-the-Interacting-Multiple-Model-filter-and-an-efficient-assignment-algorithm.pdf", "content": "The feature point tracking techniques proposed in the literature can be classied into heuristic and statistical methods.5. Most of the heuristic techniques are based on the motion smoothness constraint, which prevents its application to real sequences.5 Sethi and Jain4 expressed this motion..."}
+{"idx": 5, "title": "Descriptor - In _ Pixel", "date": "", "ddg_snippet": "Descriptor - In - Pixel : Point - Feature Tracking for Pixel Processor Arrays. Point - Feature detection and tracking at thousands of frames-per- second , using ~1Watt of power.", "subpage_snippet": "", "source": "lauriebose.github.io", "link": "https://lauriebose.github.io/DIP/", "content": "Descriptor - In - Pixel : Point - Feature Tracking for Pixel Processor Arrays. Point - Feature detection and tracking at thousands of frames-per- second , using ~1Watt of power."}
+{"idx": 6, "title": "Feature Point Extraction and Motion Tracking of Cardiac Color", "date": "", "ddg_snippet": "In equations (15) and (16), m(x, y) is the calculation . equation for gradient modulus at position (x, y), and.In equations (16) and (17), σ is the intragroup scale of the group, where the feature points are located, and α is the rotation Angle.", "subpage_snippet": "", "source": "pdfs.semanticscholar.org", "link": "https://pdfs.semanticscholar.org/01b0/0c060ee040002d34d4e487ec29bfd1a96fbd.pdf", "content": "In equations (15) and (16), m(x, y) is the calculation . equation for gradient modulus at position (x, y), and.In equations (16) and (17), σ is the intragroup scale of the group, where the feature points are located, and α is the rotation Angle."}
+{"idx": 7, "title": "Theoretical Analysis source orbslam feature point extraction 1-", "date": "", "ddg_snippet": "TheSorting feature point value filter response . The pixel coordinates of the feature point is currently available in the local pixel coordinates of the grid area, this restored coordinates to the image layer.", "subpage_snippet": "", "source": "programmersought.com", "link": "https://programmersought.com/article/35213220207/", "content": "TheSorting feature point value filter response . The pixel coordinates of the feature point is currently available in the local pixel coordinates of the grid area, this restored coordinates to the image layer."}
+{"idx": 8, "title": "Descriptor In Pixel : Point Feature Tracking for Pixel... - YouTube", "date": "", "ddg_snippet": "О сервисе Прессе Авторские права Связаться с нами Авторам Рекламодателям...", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=QDucNhl8ir8", "content": "О сервисе Прессе Авторские права Связаться с нами Авторам Рекламодателям..."}
+{"idx": 9, "title": "Descriptor - In - Pixel : Point - Feature Tracking For Pixel Processor...", "date": "", "ddg_snippet": "And if you are interested in a postdoc on a joint project with this team plus Imperial College in the space of novel visual pipelines and hardware, we have extended the application deadline, see below.", "subpage_snippet": "", "source": "www.linkedin.com", "link": "https://www.linkedin.com/posts/walterio-mayol-cuevas_descriptor-in-pixel-point-feature-tracking-activity-7337315353846235137-Uo0o", "content": "And if you are interested in a postdoc on a joint project with this team plus Imperial College in the space of novel visual pipelines and hardware, we have extended the application deadline, see below."}

data/sampled_jsons/Descriptor-In-Pixel_Point-Feature_Tracking_For_Pixel_Processor_Arrays_CVPR_2025_SCAMP-7_computation_.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "This mod is missing the descriptor file - Paradox Interactive...", "date": "", "ddg_snippet": "Feb 20, 2020 · Once I added them again, I get duplicate entries and of course the \"missing descriptor file\". I guess I'll just cancel the subscription then, if I can't even let them rest there deactivated to wait for an update. btw: unsubscribing from those legacy mods doesn't work. The duplicates stay. Even if you delete the mod's files in the Steam-folder.", "subpage_snippet": "", "source": "forum.paradoxplaza.com", "link": "https://forum.paradoxplaza.com/forum/threads/this-mod-is-missing-the-descriptor-file.1336077/", "content": "Feb 20, 2020 · Once I added them again, I get duplicate entries and of course the \"missing descriptor file\". I guess I'll just cancel the subscription then, if I can't even let them rest there deactivated to wait for an update. btw: unsubscribing from those legacy mods doesn't work. The duplicates stay. Even if you delete the mod's files in the Steam-folder."}
+{"idx": 1, "title": "CK3 crashing constantly | Paradox Interactive Forums", "date": "", "ddg_snippet": "Feb 14, 2025 · For months now, I have had ck3 crash once in a while, almost always when playing with mods. They usually occurred when autosaving or trying to load an autosave. Now, however the issue has become unbearable. I can no longer play sc3 without it...", "subpage_snippet": "", "source": "forum.paradoxplaza.com", "link": "https://forum.paradoxplaza.com/forum/threads/ck3-crashing-constantly.1728784/", "content": "Feb 14, 2025 · For months now, I have had ck3 crash once in a while, almost always when playing with mods. They usually occurred when autosaving or trying to load an autosave. Now, however the issue has become unbearable. I can no longer play sc3 without it..."}
+{"idx": 2, "title": "Missing descriptor file in my mod even if there is one", "date": "", "ddg_snippet": "Jul 7 , 2023 · Summary Missing descriptor file in my mod even if there is one Platform Steam Operating System Windows Game Version 1.12.14.50e7 Enabled DLC None Do...", "subpage_snippet": "", "source": "forum.paradoxplaza.com", "link": "https://forum.paradoxplaza.com/forum/threads/missing-descriptor-file-in-my-mod-even-if-there-is-one.1592977/", "content": "Jul 7 , 2023 · Summary Missing descriptor file in my mod even if there is one Platform Steam Operating System Windows Game Version 1.12.14.50e7 Enabled DLC None Do..."}
+{"idx": 3, "title": "Mod Missing Descriptor File - Paradox Interactive Forums", "date": "", "ddg_snippet": "Jul 3, 2021 · I almost literally tried everything that can be found online with a google search of ''Eu4 missing mod descriptor file'' or ''Eu4 mods start missing descriptor file after restart'', I mean there are not that many things to be found with a search like this because I am pretty sure I am the only person experiencing this but I tried every solution ...", "subpage_snippet": "", "source": "forum.paradoxplaza.com", "link": "https://forum.paradoxplaza.com/forum/threads/mod-missing-descriptor-file.1481804/", "content": "Jul 3, 2021 · I almost literally tried everything that can be found online with a google search of ''Eu4 missing mod descriptor file'' or ''Eu4 mods start missing descriptor file after restart'', I mean there are not that many things to be found with a search like this because I am pretty sure I am the only person experiencing this but I tried every solution ..."}
+{"idx": 4, "title": "How to install mods manually from Paradox Mods? Descriptor.mod?", "date": "", "ddg_snippet": "Sep 25, 2020 · When I download a mod manually from the Paradox Mods site, I receive a zip file with a descriptor .mod file and a folder structure that mirrors the game folder structure. I assume I create a folder inside the Documents\\\\Mods folder and dump...", "subpage_snippet": "", "source": "forum.paradoxplaza.com", "link": "https://forum.paradoxplaza.com/forum/threads/how-to-install-mods-manually-from-paradox-mods-descriptor-mod.1427279/", "content": "Sep 25, 2020 · When I download a mod manually from the Paradox Mods site, I receive a zip file with a descriptor .mod file and a folder structure that mirrors the game folder structure. I assume I create a folder inside the Documents\\\\Mods folder and dump..."}
+{"idx": 5, "title": "HoI 4 - Path replacement in descriptor.mod files not working", "date": "", "ddg_snippet": "Nov 22, 2019 · Description of issue Path replacement in descriptor .mod files not working Game Version 1.8.1 Enabled DLC Do you have mods enabled? Yes...", "subpage_snippet": "", "source": "forum.paradoxplaza.com", "link": "https://forum.paradoxplaza.com/forum/threads/hoi-4-path-replacement-in-descriptor-mod-files-not-working.1285940/", "content": "Nov 22, 2019 · Description of issue Path replacement in descriptor .mod files not working Game Version 1.8.1 Enabled DLC Do you have mods enabled? Yes..."}
+{"idx": 6, "title": "This mod is missing a descriptor file - Paradox Interactive...", "date": "", "ddg_snippet": "Oct 18, 2020 · The mod should provide the descriptor .mod in the download zip for Paradox Mods (or in the workshop folder if you are on Steam). Maybe Daddy Pika updated the mod and forgot to include the descriptor ? In any case, you can write your own descriptor and have the mod work. Just take a look at the other mods descriptors and adapt them. If they refer to a remote file id you can substitute that string ...", "subpage_snippet": "", "source": "forum.paradoxplaza.com", "link": "https://forum.paradoxplaza.com/forum/threads/this-mod-is-missing-a-descriptor-file.1437370/", "content": "Oct 18, 2020 · The mod should provide the descriptor .mod in the download zip for Paradox Mods (or in the workshop folder if you are on Steam). Maybe Daddy Pika updated the mod and forgot to include the descriptor ? In any case, you can write your own descriptor and have the mod work. Just take a look at the other mods descriptors and adapt them. If they refer to a remote file id you can substitute that string ..."}
+{"idx": 7, "title": "Local (non-workshop) Mods help | Paradox Interactive Forums", "date": "", "ddg_snippet": "Again delete the mods_registry.json file. From what I understand local ( non steam mods ) do not need a descriptor file and work just like then did before the new launcher. There is still the question of mod load order and there is a separate thread talking about that here on the forum.", "subpage_snippet": "", "source": "forum.paradoxplaza.com", "link": "https://forum.paradoxplaza.com/forum/threads/local-non-workshop-mods-help.1268378/", "content": "Again delete the mods_registry.json file. From what I understand local ( non steam mods ) do not need a descriptor file and work just like then did before the new launcher. There is still the question of mod load order and there is a separate thread talking about that here on the forum."}
+{"idx": 8, "title": "All my mods are somehow missing descriptor files - please help!", "date": "", "ddg_snippet": "May 4, 2022 · I've been having a nightmare of a time trying to get mods to work in the CK3 launcher for some days. They give the warning in he title. If they work after I follow the formula of unsubscribe-delete from the mods folder-resubscribe method (and...", "subpage_snippet": "", "source": "forum.paradoxplaza.com", "link": "https://forum.paradoxplaza.com/forum/threads/all-my-mods-are-somehow-missing-descriptor-files-please-help.1523360/", "content": "May 4, 2022 · I've been having a nightmare of a time trying to get mods to work in the CK3 launcher for some days. They give the warning in he title. If they work after I follow the formula of unsubscribe-delete from the mods folder-resubscribe method (and..."}
+{"idx": 9, "title": "Game crashes at loading screen with certain mods.", "date": "", "ddg_snippet": "May 9, 2023 · Using the mod \"Imperial Nostalgia\" the game crashes while the loading screen you get right after launching the game is loading. I'm a MacOS user and most of the other mods I installed actually work, except for a few ones that actually have the...", "subpage_snippet": "", "source": "forum.paradoxplaza.com", "link": "https://forum.paradoxplaza.com/forum/threads/game-crashes-at-loading-screen-with-certain-mods.1582668/", "content": "May 9, 2023 · Using the mod \"Imperial Nostalgia\" the game crashes while the loading screen you get right after launching the game is loading. I'm a MacOS user and most of the other mods I installed actually work, except for a few ones that actually have the..."}

data/sampled_jsons/Descriptor-In-Pixel_Point-Feature_Tracking_For_Pixel_Processor_Arrays_SCAMP-7_Computation_Time_Break.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Point-Feature Tracking For Pixel Processor Arrays", "date": "", "ddg_snippet": "... Descriptor -In- Pixel . Table 1 . SCAMP - 7 Computation Time Breakdown . image. Figure 8. Comparison of feature lifetime histograms, our approach vs tracking ...", "subpage_snippet": "", "source": "cvpr.thecvf.com", "link": "https://cvpr.thecvf.com/virtual/2025/poster/32867", "content": "... Descriptor -In- Pixel . Table 1 . SCAMP - 7 Computation Time Breakdown . image. Figure 8. Comparison of feature lifetime histograms, our approach vs tracking ..."}
+{"idx": 1, "title": "Point-Feature Tracking For Pixel Processor Arrays", "date": "", "ddg_snippet": "1 . Descriptor -In- Pixel : Point - Feature Tracking For Pixel Processor Arrays ... Our implementation upon the SCAMP - 7 PPA prototype runs at over 3000 FPS ...", "subpage_snippet": "", "source": "chatpaper.com", "link": "https://chatpaper.com/paper/154940", "content": "1 . Descriptor -In- Pixel : Point - Feature Tracking For Pixel Processor Arrays ... Our implementation upon the SCAMP - 7 PPA prototype runs at over 3000 FPS ..."}
+{"idx": 2, "title": "Focal-Plane Sensor-Processor-Based Visual Inertial ...", "date": "", "ddg_snippet": "As an alternative, FPSPs, such as SCAMP -5, is a new technology that enables computation to occur on the imager's focal plane before transferring the data to a ... 117 pages", "subpage_snippet": "", "source": "mattlisondra.com", "link": "https://mattlisondra.com/data/MASc_Thesis_Matthew_Lisondra_Final.pdf", "content": "As an alternative, FPSPs, such as SCAMP -5, is a new technology that enables computation to occur on the imager's focal plane before transferring the data to a ... 117 pages"}
+{"idx": 3, "title": "Advanced Information Networking and Applications", "date": "", "ddg_snippet": "... SCAMP -ML (Advanced computational statistics for planning and tracking production environments) as well as a grant of EU's Horizon 2020. Research and ... 539 pages", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/content/pdf/10.1007/978-3-031-57931-8.pdf", "content": "... SCAMP -ML (Advanced computational statistics for planning and tracking production environments) as well as a grant of EU's Horizon 2020. Research and ... 539 pages"}
+{"idx": 4, "title": "Semantics for Robotic Mapping, Perception and Interaction", "date": "", "ddg_snippet": "by S Garg · 2021 · Cited by 172 — ... Processor (FPSP) chips [832]. For example, the SCAMP -5 vision chip [833] operates on image-wide register arrays enabling data (full image) ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2101.00443", "content": "by S Garg · 2021 · Cited by 172 — ... Processor (FPSP) chips [832]. For example, the SCAMP -5 vision chip [833] operates on image-wide register arrays enabling data (full image) ..."}
+{"idx": 5, "title": "Descriptor - In - Pixel : Point - Feature Tracking For Pixel Processor ...", "date": "", "ddg_snippet": "Table 1 . SCAMP - 7 Computation Time Breakdown . Task Descriptor Response Map. Pixel processor arrays for low latency gaze esti-mation. In 2022 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW), pages 970–971.", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/papers/Bose_Descriptor-In-Pixel__Point-Feature_Tracking_For_Pixel_Processor_Arrays_CVPR_2025_paper.pdf", "content": "Table 1 . SCAMP - 7 Computation Time Breakdown . Task Descriptor Response Map. Pixel processor arrays for low latency gaze esti-mation. In 2022 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW), pages 970–971."}
+{"idx": 6, "title": "Descriptor - In - Pixel : Point - Feature Tracking For Pixel Processor ...", "date": "", "ddg_snippet": "This paper presents a novel approach for joint point - feature detection and tracking , specifically designed for Pixel Processor Array sensors (PPA).", "subpage_snippet": "", "source": "papers.cool", "link": "https://papers.cool/venue/Bose_Descriptor-In-Pixel__Point-Feature_Tracking_For_Pixel_Processor_Arrays@CVPR2025@CVF", "content": "This paper presents a novel approach for joint point - feature detection and tracking , specifically designed for Pixel Processor Array sensors (PPA)."}
+{"idx": 7, "title": "Descriptor - In - Pixel : Point - Feature Tracking for Pixel Processor ...", "date": "", "ddg_snippet": "We introduce a Descriptor - In - Pixel paradigm, in which a feature descriptor is held within the memory of each pixel - processor . The PPA’s architecture enables the response of every processor ’s descriptor, upon the current image, to be computed in parallel.", "subpage_snippet": "", "source": "ieeexplore.ieee.org", "link": "https://ieeexplore.ieee.org/document/11092646/", "content": "We introduce a Descriptor - In - Pixel paradigm, in which a feature descriptor is held within the memory of each pixel - processor . The PPA’s architecture enables the response of every processor ’s descriptor, upon the current image, to be computed in parallel."}
+{"idx": 8, "title": "SCAMP Vision Sensor", "date": "", "ddg_snippet": "L.Bose, J.Chen and P.Dudek, \" Descriptor - In - Pixel : Point - Feature Tracking For Pixel Processor Arrays \", IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2025, pp.5392-5400, June 2025. [website].", "subpage_snippet": "", "source": "personalpages.manchester.ac.uk", "link": "https://personalpages.manchester.ac.uk/staff/p.dudek/scamp/", "content": "L.Bose, J.Chen and P.Dudek, \" Descriptor - In - Pixel : Point - Feature Tracking For Pixel Processor Arrays \", IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2025, pp.5392-5400, June 2025. [website]."}
+{"idx": 9, "title": "Mapping Image Transformations Onto Pixel Processor Arrays", "date": "", "ddg_snippet": "Pixel Processor Arrays (PPA) present a new vision sensor/ processor architecture consisting of a SIMD array of processor elements, each capable of light capture, storage, processing and local communication.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2403.16994v1", "content": "Pixel Processor Arrays (PPA) present a new vision sensor/ processor architecture consisting of a SIMD array of processor elements, each capable of light capture, storage, processing and local communication."}

data/sampled_jsons/Digital_Disparities_Comparative_Web_Measurement_Study_Economic_Boundaries_Figure_12_critical_vulnera_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Digital Disparities: A Comparative Web Measurement Study Across ...", "date": "", "ddg_snippet": "Figure 12 provides a comparison of vulnerability rates across countries , highlighting the higher incidence of critical vulnerabilities in developed nations. For example, in developed countries such as Italy, Canada, Spain, Australia, and South Korea, around 10% of websites exhibit high or critical vulnerabilities .", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=IMhoJgWANP", "content": "Figure 12 provides a comparison of vulnerability rates across countries , highlighting the higher incidence of critical vulnerabilities in developed nations. For example, in developed countries such as Italy, Canada, Spain, Australia, and South Korea, around 10% of websites exhibit high or critical vulnerabilities ."}
+{"idx": 1, "title": "Digital Disparities: A Comparative Web Measurement Study Across ...", "date": "", "ddg_snippet": "In this work, we test this hypothesis by measuring differences in web development practices across the two groups of countries , using multiple dimensions: webpages' size, complexity, security, privacy, quality, technology adoption, and accessibility.", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/10.1145/3696410.3714647", "content": "In this work, we test this hypothesis by measuring differences in web development practices across the two groups of countries , using multiple dimensions: webpages' size, complexity, security, privacy, quality, technology adoption, and accessibility."}
+{"idx": 2, "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": 3, "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": 4, "title": "Digital Disparities: A Comparative Web Measurement Study Across ...", "date": "", "ddg_snippet": "Digital Disparities : A Comparative Web Measurement Study Across Economic Boundaries . In Guodong Long, Michale Blumestein, Yi Chang 0001, Liane Lewin-Eytan, Zi Helen Huang, Elad Yom-Tov, editors, Proceedings of the ACM on Web Conference 2025, WWW 2025, Sydney, NSW, Australia, 28 April 2025- 2 May 2025. pages 1889-1900, ACM, 2025. [doi]", "subpage_snippet": "", "source": "researchr.org", "link": "https://researchr.org/publication/BhuiyanVSZ25", "content": "Digital Disparities : A Comparative Web Measurement Study Across Economic Boundaries . In Guodong Long, Michale Blumestein, Yi Chang 0001, Liane Lewin-Eytan, Zi Helen Huang, Elad Yom-Tov, editors, Proceedings of the ACM on Web Conference 2025, WWW 2025, Sydney, NSW, Australia, 28 April 2025- 2 May 2025. pages 1889-1900, ACM, 2025. [doi]"}
+{"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 Digital Disparities: A Comparative Web Measurement Study Across ...", "date": "", "ddg_snippet": "Digital disparities , Web measurement , Web development practices Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.", "subpage_snippet": "", "source": "www.staicu.org", "link": "https://www.staicu.org/publications/www2025.pdf", "content": "Digital disparities , Web measurement , Web development practices Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page."}
+{"idx": 7, "title": "digital-disparities-www25/banner at main · kal-purush/digital ... - GitHub", "date": "", "ddg_snippet": "Code and dataset for the WWW'25 paper: 'Digital Disparities : A Comparative Web Measurement Study Across Economic Boundaries.' - kal-purush/ digital - disparities -www25", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/kal-purush/digital-disparities-www25/blob/main/banner", "content": "Code and dataset for the WWW'25 paper: 'Digital Disparities : A Comparative Web Measurement Study Across Economic Boundaries.' - kal-purush/ digital - disparities -www25"}
+{"idx": 8, "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": 9, "title": "Measuring the impact of the digital economy in developing countries: A ...", "date": "", "ddg_snippet": "This paper explores the definition, measurement , role, and impacts of the digital economy across various economies. It also examines the involvement of governments and telecommunication regulators in assessing the digital economy and identifies future directions for developing countries .", "subpage_snippet": "", "source": "www.sciencedirect.com", "link": "https://www.sciencedirect.com/science/article/pii/S2405844023048624", "content": "This paper explores the definition, measurement , role, and impacts of the digital economy across various economies. It also examines the involvement of governments and telecommunication regulators in assessing the digital economy and identifies future directions for developing countries ."}

data/sampled_jsons/EntityErasure_AECM_Amodal_Entity_Completion_Model_learning_rate_1e-4_training.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "PDF EntityErasure: Erasing Entity Cleanly via Amodal Entity Segmentation ...", "date": "", "ddg_snippet": "It contains a amodal en-tity segmentation model (AESM) and a amodal entity completion model ( AECM ). The output of AESM serves as input for AECM , AECM then injects content information into the denoising UNet with entity attention (EA).", "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": "It contains a amodal en-tity segmentation model (AESM) and a amodal entity completion model ( AECM ). The output of AESM serves as input for AECM , AECM then injects content information into the denoising UNet with entity attention (EA)."}
+{"idx": 1, "title": "GitHub - zyxunh/entity_erasure", "date": "", "ddg_snippet": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion [CVPR2025] Introduction This repository contains the official implementation of the paper EntityErasure .", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/zyxunh/entity_erasure", "content": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion [CVPR2025] Introduction This repository contains the official implementation of the paper EntityErasure ."}
+{"idx": 2, "title": "How to check or manually control the learning rate used in training ...", "date": "", "ddg_snippet": "I empirically tested a learning rate of 1e-6 and the loss went to 0.5454, an expected value. So, I want to know if it is possible to get the values of the learning rates for each epoch the model was saved (it is saved anywhere in the checkpoint files?). Or at least log/print the learning rate in each training epoch. How to do that?", "subpage_snippet": "", "source": "discuss.huggingface.co", "link": "https://discuss.huggingface.co/t/how-to-check-or-manually-control-the-learning-rate-used-in-training/10839", "content": "I empirically tested a learning rate of 1e-6 and the loss went to 0.5454, an expected value. So, I want to know if it is possible to get the values of the learning rates for each epoch the model was saved (it is saved anywhere in the checkpoint files?). Or at least log/print the learning rate in each training epoch. How to do that?"}
+{"idx": 3, "title": "Is it good learning rate for Adam method? - Stack Overflow", "date": "", "ddg_snippet": "For example, 'learning rate' is not actually 'learning rate' . In sum: 1/ Needless to say,a small learning rate is not good, but a too big learning rate is definitely bad. 2/ Weight initialization is your first guess, it DOES affect your result 3/ Take time to understand your code may be a good practice.", "subpage_snippet": "", "source": "stackoverflow.com", "link": "https://stackoverflow.com/questions/42966393/is-it-good-learning-rate-for-adam-method", "content": "For example, 'learning rate' is not actually 'learning rate' . In sum: 1/ Needless to say,a small learning rate is not good, but a too big learning rate is definitely bad. 2/ Weight initialization is your first guess, it DOES affect your result 3/ Take time to understand your code may be a good practice."}
+{"idx": 4, "title": "EntityErasure: Erasing Entity Cleanly via Amodal Entity Segmentation ...", "date": "", "ddg_snippet": "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 , such that the region to inpaint takes only entities in the non-inpainting area as reference, avoiding the possibility to generate unpredictable ...", "subpage_snippet": "", "source": "zyxunh.github.io", "link": "https://zyxunh.github.io/EntityErasure-ProjectPage/", "content": "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 , such that the region to inpaint takes only entities in the non-inpainting area as reference, avoiding the possibility to generate unpredictable ..."}
+{"idx": 5, "title": "Entity/Entity/README.md at main · qqlu/Entity · GitHub", "date": "", "ddg_snippet": "Our entity segmentation models can perform exceptionally well in a cross-dataset setting where we use only COCO as the training dataset but we test the model on images from other datasets at inference time.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/qqlu/Entity/blob/main/Entity/README.md", "content": "Our entity segmentation models can perform exceptionally well in a cross-dataset setting where we use only COCO as the training dataset but we test the model on images from other datasets at inference time."}
+{"idx": 6, "title": "CVPR Poster 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 , such that the region to inpaint takes only entities in the non-inpainting area as reference, avoiding the possibility to generate ...", "subpage_snippet": "", "source": "cvpr.thecvf.com", "link": "https://cvpr.thecvf.com/virtual/2025/poster/34016", "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 , such that the region to inpaint takes only entities in the non-inpainting area as reference, avoiding the possibility to generate ..."}
+{"idx": 7, "title": "What is considered as a small learning rate? - Reddit", "date": "", "ddg_snippet": "I am confused with the size of the learning rate of the BERT The author suggests of using one of the following parameters learning rates : 3e-4, 1e-4 , 5e-5, 3e-5 I know that a small learning rate makes our model learn very slow, however it also helps prevent overfitting, in contrast to big learning which learns faster but it can lead to overfitting.", "subpage_snippet": "", "source": "www.reddit.com", "link": "https://www.reddit.com/r/LanguageTechnology/comments/nmljji/what_is_considered_as_a_small_learning_rate/", "content": "I am confused with the size of the learning rate of the BERT The author suggests of using one of the following parameters learning rates : 3e-4, 1e-4 , 5e-5, 3e-5 I know that a small learning rate makes our model learn very slow, however it also helps prevent overfitting, in contrast to big learning which learns faster but it can lead to overfitting."}
+{"idx": 8, "title": "AI Models - Finding the best learning rate. - LinkedIn", "date": "", "ddg_snippet": "In summary, this line of code creates a learning rate scheduler that adjusts the learning rate during training . The learning rate starts small ( 1e-4 ) and increases exponentially with each epoch.", "subpage_snippet": "", "source": "www.linkedin.com", "link": "https://www.linkedin.com/pulse/ai-models-finding-best-learning-rate-kanav-gupta-futof", "content": "In summary, this line of code creates a learning rate scheduler that adjusts the learning rate during training . The learning rate starts small ( 1e-4 ) and increases exponentially with each epoch."}
+{"idx": 9, "title": "CVPR 2025 Open Access Repository", "date": "", "ddg_snippet": "This paper presents EntityErasure , a novel diffusion-based inpainting method that can effectively erase entities without inducing unwanted sundries. To this end, we propose to address this problem by dividing it into amodal entity segmentation and completion , such that the region to inpaint takes only entities in the non-inpainting area as ...", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/html/Zhu_EntityErasure_Erasing_Entity_Cleanly_via_Amodal_Entity_Segmentation_and_Completion_CVPR_2025_paper.html", "content": "This paper presents EntityErasure , a novel diffusion-based inpainting method that can effectively erase entities without inducing unwanted sundries. To this end, we propose to address this problem by dividing it into amodal entity segmentation and completion , such that the region to inpaint takes only entities in the non-inpainting area as ..."}

data/sampled_jsons/EntityErasure_Erasing_Entity_Cleanly_via_Amodal_Entity_Segmentation_and_Completion_github.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "GitHub - zyxunh/entity_erasure", "date": "", "ddg_snippet": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion [CVPR2025] Introduction This repository contains the official implementation of the paper EntityErasure .", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/zyxunh/entity_erasure", "content": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion [CVPR2025] Introduction This repository contains the official implementation of the paper EntityErasure ."}
+{"idx": 1, "title": "EntityErasure: Erasing Entity Cleanly via Amodal Entity Segmentation ...", "date": "", "ddg_snippet": "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 , such that the region to inpaint takes only entities in the non-inpainting area as reference, avoiding the possibility to generate unpredictable ...", "subpage_snippet": "", "source": "zyxunh.github.io", "link": "https://zyxunh.github.io/EntityErasure-ProjectPage/", "content": "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 , such that the region to inpaint takes only entities in the non-inpainting area as reference, avoiding the possibility to generate unpredictable ..."}
+{"idx": 2, "title": "unhzyx/entity_erasure at main - Hugging Face", "date": "", "ddg_snippet": "We're on a journey to advance and democratize artificial intelligence through open source and open science.", "subpage_snippet": "", "source": "huggingface.co", "link": "https://huggingface.co/unhzyx/entity_erasure/tree/main", "content": "We're on a journey to advance and democratize artificial intelligence through open source and open science."}
+{"idx": 3, "title": "entity_erasure/README.md at master - GitHub", "date": "", "ddg_snippet": "Contribute to zyxunh/ entity_erasure development by creating an account on GitHub .", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/zyxunh/entity_erasure/blob/master/README.md", "content": "Contribute to zyxunh/ entity_erasure development by creating an account on GitHub ."}
+{"idx": 4, "title": "PDF EntityErasure: Erasing Entity Cleanly via Amodal Entity Segmentation ...", "date": "", "ddg_snippet": "Abstract This paper presents EntityErasure , a novel diffusion-based inpainting method that can effectively erase entities with-out inducing unwanted sundries. To this end, we pro-pose to address this problem by dividing it into amodal entity segmentation and completion , such that the region to inpaint takes only entities in the non-inpainting area as reference, avoiding the possibility to ...", "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": "Abstract This paper presents EntityErasure , a novel diffusion-based inpainting method that can effectively erase entities with-out inducing unwanted sundries. To this end, we pro-pose to address this problem by dividing it into amodal entity segmentation and completion , such that the region to inpaint takes only entities in the non-inpainting area as reference, avoiding the possibility to ..."}
+{"idx": 5, "title": "EntityErasure: Erasing Entity Cleanly via Amodal Entity Segmentation ...", "date": "", "ddg_snippet": "This paper presents EntityErasure , a novel diffusion-based inpainting method that can effectively erase entities without inducing unwanted sundries. To this end, we propose to address this problem by dividing it into amodal entity segmentation and completion , such that the region to inpaint takes only entities in the non-inpainting area as reference, avoiding the possibility to generate ...", "subpage_snippet": "", "source": "ieeexplore.ieee.org", "link": "https://ieeexplore.ieee.org/abstract/document/11094156", "content": "This paper presents EntityErasure , a novel diffusion-based inpainting method that can effectively erase entities without inducing unwanted sundries. To this end, we propose to address this problem by dividing it into amodal entity segmentation and completion , such that the region to inpaint takes only entities in the non-inpainting area as reference, avoiding the possibility to generate ..."}
+{"idx": 6, "title": "EntityErasure: Erasing Entity Cleanly via Amodal Entity Segmentation ...", "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 , such that the region to inpaint takes only entities in the non-inpainting area as reference, avoiding the possibility to generate ...", "subpage_snippet": "", "source": "cvpr.thecvf.com", "link": "https://cvpr.thecvf.com/virtual/2025/poster/34016", "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 , such that the region to inpaint takes only entities in the non-inpainting area as reference, avoiding the possibility to generate ..."}
+{"idx": 7, "title": "Image Inpainting - Full Paper Collection - GitHub", "date": "", "ddg_snippet": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion Tags: Image Inpainting, Diffusion Models, Amodal Segmentation , Entity Completion , Diffusion-Based Inpainting", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/AcademicDissect/AcademicDissect/blob/main/detailed_paper_collection/Image_Inpainting.md", "content": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion Tags: Image Inpainting, Diffusion Models, Amodal Segmentation , Entity Completion , Diffusion-Based Inpainting"}
+{"idx": 8, "title": "PDF EntityErasure: Erasing Entity Cleanly via Amodal Entity Segmentation ...", "date": "", "ddg_snippet": "If there are errors in the generated amodal segmentation , it will affect the generation of the final results of our model. The feasible solution is to adopt multi-task learning, using traditional amodal segmentation datasets in combination with erasure datasets to learn both tasks, thereby enhancing the unified amodal segmentation ability.", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/supplemental/Zhu_EntityErasure_Erasing_Entity_CVPR_2025_supplemental.pdf", "content": "If there are errors in the generated amodal segmentation , it will affect the generation of the final results of our model. The feasible solution is to adopt multi-task learning, using traditional amodal segmentation datasets in combination with erasure datasets to learn both tasks, thereby enhancing the unified amodal segmentation ability."}
+{"idx": 9, "title": "CVPR 2025 Open Access Repository", "date": "", "ddg_snippet": "This paper presents EntityErasure , a novel diffusion-based inpainting method that can effectively erase entities without inducing unwanted sundries. To this end, we propose to address this problem by dividing it into amodal entity segmentation and completion , such that the region to inpaint takes only entities in the non-inpainting area as reference, avoiding the possibility to generate ...", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/html/Zhu_EntityErasure_Erasing_Entity_Cleanly_via_Amodal_Entity_Segmentation_and_Completion_CVPR_2025_paper.html", "content": "This paper presents EntityErasure , a novel diffusion-based inpainting method that can effectively erase entities without inducing unwanted sundries. To this end, we propose to address this problem by dividing it into amodal entity segmentation and completion , such that the region to inpaint takes only entities in the non-inpainting area as reference, avoiding the possibility to generate ..."}

data/sampled_jsons/EntityErasure_Erasing_Entity_Cleanly_via_Amodal_Entity_Segmentation_and_Completion_section_3.2_entit.jsonl

@@ -0,0 +1,9 @@
+{"idx": 0, "title": "Erasing Entity Cleanly via Amodal Entity Segmentation and ...", "date": "", "ddg_snippet": "by Y Zhu · 2025 — This paper presents EntityErasure , a novel diffusion-based inpainting method that can effectively erase entities with- out inducing unwanted sundries.", "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": "by Y Zhu · 2025 — This paper presents EntityErasure , a novel diffusion-based inpainting method that can effectively erase entities with- out inducing unwanted sundries."}
+{"idx": 1, "title": "GitHub - zyxunh/ entity _erasure", "date": "", "ddg_snippet": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion [CVPR2025]. Introduction. This repository contains the official implementation of the paper EntityErasure. Install. Put this project in your ${HOME}/code path.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/zyxunh/entity_erasure", "content": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion [CVPR2025]. Introduction. This repository contains the official implementation of the paper EntityErasure. Install. Put this project in your ${HOME}/code path."}
+{"idx": 2, "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": 3, "title": "CVPR Poster EntityErasure: Erasing Entity Cleanly via Amodal ...", "date": "", "ddg_snippet": "15 Jun 2025 — EntityErasure: Erasing Entity Cleanly via Amodal Entity Segmentation and Completion ... area , (c) applying entity attention on non-inpainting area ...", "subpage_snippet": "", "source": "cvpr.thecvf.com", "link": "https://cvpr.thecvf.com/virtual/2025/poster/34016", "content": "15 Jun 2025 — EntityErasure: Erasing Entity Cleanly via Amodal Entity Segmentation and Completion ... area , (c) applying entity attention on non-inpainting area ..."}
+{"idx": 4, "title": "Qing Zhang - Homepage", "date": "", "ddg_snippet": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion .", "subpage_snippet": "", "source": "www.zhangqing-home.net", "link": "https://www.zhangqing-home.net/", "content": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion ."}
+{"idx": 5, "title": "dblp: List of computer science publications by Yongwei Nie", "date": "", "ddg_snippet": "Yixing Zhu, Qing Zhang, Yitong Wang, Yongwei Nie, Wei-Shi Zheng: EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion .", "subpage_snippet": "", "source": "dblp.uni-trier.de", "link": "https://dblp.uni-trier.de/pid/31/8005.html", "content": "Yixing Zhu, Qing Zhang, Yitong Wang, Yongwei Nie, Wei-Shi Zheng: EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion ."}
+{"idx": 6, "title": "【汇总】 CVPR25语义分割相关文章【语义分割】-CSDN博客", "date": "", "ddg_snippet": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion .Using Diffusion Priors for Video Amodal Segmentation. GLUS: Global-Local Reasoning Unified into A Single Large Language Model for Video Segmentation.", "subpage_snippet": "", "source": "blog.csdn.net", "link": "https://blog.csdn.net/wxd1233/article/details/148727463", "content": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion .Using Diffusion Priors for Video Amodal Segmentation. GLUS: Global-Local Reasoning Unified into A Single Large Language Model for Video Segmentation."}
+{"idx": 7, "title": "isee-ai.cn/~zhwshi/selected_paper_list.html", "date": "", "ddg_snippet": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion .Representation Learning for SceneGraph Completion via Jointly Structural and Visual Embedding.", "subpage_snippet": "", "source": "isee-ai.cn", "link": "https://isee-ai.cn/~zhwshi/selected_paper_list.html", "content": "EntityErasure : Erasing Entity Cleanly via Amodal Entity Segmentation and Completion .Representation Learning for SceneGraph Completion via Jointly Structural and Visual Embedding."}
+{"idx": 8, "title": "", "date": "", "ddg_snippet": "", "subpage_snippet": "", "source": "", "link": "", "content": ""}

data/sampled_jsons/EventPS_3D_printed_MAE_13.66_OR_13.6.jsonl

@@ -0,0 +1,4 @@
+{"idx": 0, "title": "Robust Photometric Stereo Based on Event Interval Profile", "date": "", "ddg_snippet": "Experiments using real event data from 3D-printed objects demonstrate that PS-EIP significantly improves robustness to outliers compared to EventPS's deep- ...", "subpage_snippet": "", "source": "cvpr.thecvf.com", "link": "https://cvpr.thecvf.com/virtual/2025/poster/33500", "content": "Experiments using real event data from 3D-printed objects demonstrate that PS-EIP significantly improves robustness to outliers compared to EventPS's deep- ..."}
+{"idx": 1, "title": "Track: Poster Session 2 - CVPR", "date": "", "ddg_snippet": "13 Jun 2025 — ... EventPS's deep-learning variant, EventPS -FCN, without relying on ... 13.6 \\%), all without requiring additional training or fine-tuning ...", "subpage_snippet": "", "source": "cvpr.thecvf.com", "link": "https://cvpr.thecvf.com/virtual/2025/session/35266", "content": "13 Jun 2025 — ... EventPS's deep-learning variant, EventPS -FCN, without relying on ... 13.6 \\%), all without requiring additional training or fine-tuning ..."}
+{"idx": 2, "title": "Laser Micro Machining - Safety Screen Filter Ad Viewing ads is privacy protected by DuckDuckGo. Ad clicks are managed by Microsoft's ad network ( more info ).", "date": "", "ddg_snippet": "Shanghai YueQian Laser - Laser Micro Machining Expert. Safety Screen Filter Provider. Support@lasersh.com", "subpage_snippet": "", "source": "duckduckgo.com", "link": "https://duckduckgo.com/y.js?ad_domain=lasersh.com&ad_provider=bingv7aa&ad_type=txad&click_metadata=cg7AkucH7K3Rhzupe_1mdmDEBIQOxFO-Csg0Imw0s7039X6_cmtEM7xSMplWsF6dyJ-fVtLDNXz7q_3Znt6BMHjULZ387r97XLfu1VWh6xZyhzPDlFzsZFSiBKTr2zvL.SADJCq8AETBgIX3yqA2NLg&rut=450d28fb8d5ffa9cb9f2b2eb9cd831aa74052d05031046669485b0cd947ac52a&u3=https://www.bing.com/aclick?ld=e8UGF1PCqySXf06fYg4PZo8TVUCUyt4hkPHObcR_FGSUJM1Bl7GRl3mkhhsRwBSFnzGzJmkdGFWMqZj19BpP5e7hKMBInJOAraGOMnsSytgjYjU47tiuaIGrdBbtmsfYTFN0COID1aPkCsorGMogFwiAA92TsZi-S5LagDgju5L4fAQ_VLLDUhnl1Umq5qULU2b7GyNQ&u=aHR0cHMlM2ElMmYlMmZ3d3cubGFzZXJzaC5jb20lMmZlbiUyZiUzZnV0bV9zb3VyY2UlM2RzZW0tYmluZyUyNnV0bV9jYW1wYWlnbiUzZFNlYXJjaC1DYW1wYWlnbl8lZTUlODUlYWMlZTUlOGYlYjglMjUyME92ZXJ2aWV3JTI2dXRtX2NvbnRlbnQlM2RBZCUyNTIwR3JvdXAlMjUyMDElMjZ1dG1fdGVybTAlM2QzZCUyNTIwcHJpbnRpbmclMjZ1dG1fc291JTNkRXZlbnRQUyUyNTIwM0QlMjUyMHByaW50ZWQlMjUyME1BRSUyNTIwMTMuNjYlMjUyMDEzLjYlMjZtc2Nsa2lkJTNkMThiN2ExOGM4OWJmMTczMmE4MzFjOTVlY2E4NDQ1ZmY&rlid=18b7a18c89bf1732a831c95eca8445ff&vqd=4-259786050671282069511130519394595510524&iurl={1}IG=1B9AB89C788646528A5D47DFD335F8AC&CID=23161603B68968F8104E0073B78969FC&ID=DevEx,5045.1", "content": "Shanghai YueQian Laser - Laser Micro Machining Expert. Safety Screen Filter Provider. Support@lasersh.com"}
+{"idx": 3, "title": "", "date": "", "ddg_snippet": "", "subpage_snippet": "", "source": "", "link": "", "content": ""}

data/sampled_jsons/EventPS_estimates_surface_normal_only_from_the_radiance_changes_treating_each_event_interval_indepen.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Active Hyperspectral Imaging Using an Event Camera - CVPR", "date": "", "ddg_snippet": "EventPS [57] estimates the surface normal by analyzing the events triggered by a continuously rotating light source. Transient light triggers are employed [6, ...", "subpage_snippet": "", "source": "cvpr.thecvf.com", "link": "https://cvpr.thecvf.com/virtual/2025/poster/34875", "content": "EventPS [57] estimates the surface normal by analyzing the events triggered by a continuously rotating light source. Transient light triggers are employed [6, ..."}
+{"idx": 1, "title": "Active Hyperspectral Imaging Using an Event Camera", "date": "", "ddg_snippet": "EventPS [57] estimates the surface normal by analyzing the events triggered ... omit inter-reflection and sub- surface scattering to have each pixel be treated ...", "subpage_snippet": "", "source": "downloads.ctfassets.net", "link": "https://downloads.ctfassets.net/yreyglvi5sud/D8O7DSeyyM2DIpfMToiWw/0b8aaabd64a13b93a5a4a9837305be11/Yu_CVPR25b.pdf", "content": "EventPS [57] estimates the surface normal by analyzing the events triggered ... omit inter-reflection and sub- surface scattering to have each pixel be treated ..."}
+{"idx": 2, "title": "EROAM: Event-based Camera Rotational Odometry and ...", "date": "", "ddg_snippet": "17 Nov 2024 — This paper presents EROAM, a novel event -based rotational odometry and mapping system that achieves real-time, accurate camera rotation ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2411.11004v1", "content": "17 Nov 2024 — This paper presents EROAM, a novel event -based rotational odometry and mapping system that achieves real-time, accurate camera rotation ..."}
+{"idx": 3, "title": "Event-based 3D Reconstruction Using 3D Gaussian Splatting", "date": "", "ddg_snippet": "5 Nov 2024 — We introduce a novel reconstruction algorithm achieving high-quality scene reconstruction from Event data under low-light, high-speed conditions.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=EJZfcKXdiT&referrer=[the+profile+of+Xiangyang+Ji](/profile?id=~Xiangyang_Ji1)", "content": "5 Nov 2024 — We introduce a novel reconstruction algorithm achieving high-quality scene reconstruction from Event data under low-light, high-speed conditions."}
+{"idx": 4, "title": "Towards Mobile Sensing with Event Cameras on High ...", "date": "", "ddg_snippet": "29 Mar 2025 — In contrast, event cameras operate with independent pixels that generate events immediately upon brightness changes , without requiring a global ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2503.22943v1", "content": "29 Mar 2025 — In contrast, event cameras operate with independent pixels that generate events immediately upon brightness changes , without requiring a global ..."}
+{"idx": 5, "title": "Radiative fluxes from satellites: Focus on aerosols - Liu - 2008", "date": "", "ddg_snippet": "by H Liu · 2008 · Cited by 23 — An existing scheme to derive radiative fluxes from satellite observations has been modified so it can incorporate more detailed information on aerosol ...", "subpage_snippet": "", "source": "agupubs.onlinelibrary.wiley.com", "link": "https://agupubs.onlinelibrary.wiley.com/doi/full/10.1029/2007JD008736", "content": "by H Liu · 2008 · Cited by 23 — An existing scheme to derive radiative fluxes from satellite observations has been modified so it can incorporate more detailed information on aerosol ..."}
+{"idx": 6, "title": "Impacts of surface model generation approaches on ...", "date": "", "ddg_snippet": "by B Tian · 2022 · Cited by 12 — This paper compares the impacts of four different reconstruction algorithms by investigating their performance using DAYSIM raytracing simulations.", "subpage_snippet": "", "source": "www.sciencedirect.com", "link": "https://www.sciencedirect.com/science/article/pii/S0960148122012708", "content": "by B Tian · 2022 · Cited by 12 — This paper compares the impacts of four different reconstruction algorithms by investigating their performance using DAYSIM raytracing simulations."}
+{"idx": 7, "title": "CVPR 2024 Key Research & Dataset Papers - Part 2", "date": "", "ddg_snippet": "On the basis of prior extracted features, DTSPrompt dynamically generates prompts specific to each task resulting in superior model performance.", "subpage_snippet": "", "source": "learnopencv.com", "link": "https://learnopencv.com/cvpr-2024-research-papers/", "content": "On the basis of prior extracted features, DTSPrompt dynamically generates prompts specific to each task resulting in superior model performance."}
+{"idx": 8, "title": "Track: Poster Session 2 - CVPR", "date": "", "ddg_snippet": "13 Jun 2025 — However, EventPS treats each event interval independently , making it sensitive to noise, shadows, and non-Lambertian reflections. This paper ...", "subpage_snippet": "", "source": "cvpr.thecvf.com", "link": "https://cvpr.thecvf.com/virtual/2025/session/35266", "content": "13 Jun 2025 — However, EventPS treats each event interval independently , making it sensitive to noise, shadows, and non-Lambertian reflections. This paper ..."}
+{"idx": 9, "title": "Potential Impacts of Assimilating All-Sky Satellite Infrared ...", "date": "", "ddg_snippet": "by MY Chan · 2020 · Cited by 29 — In this study, the potential impacts of assimilating water vapor channel brightness temperature (WV-BT) observations from the geostationary Meteorological ...", "subpage_snippet": "", "source": "journals.ametsoc.org", "link": "https://journals.ametsoc.org/view/journals/mwre/148/8/mwrD190343.pdf", "content": "by MY Chan · 2020 · Cited by 29 — In this study, the potential impacts of assimilating water vapor channel brightness temperature (WV-BT) observations from the geostationary Meteorological ..."}

data/sampled_jsons/Eventps_Real-time_photometric_stereo_using_an_event_camera_Yu_et_al..jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "EventPS: Real-Time Photometric Stereo Using an Event Camera", "date": "", "ddg_snippet": "This paper introduces EventPS , a novel approach to real-time photometric stereo using an event camera . Capitalizing on the exceptional temporal resolution, dynamic range, and low bandwidth character-istics of event cameras, EventPS estimates surface nor-mal only from the radiance changes, significantly enhanc-ing data efficiency.", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2024/papers/Yu_EventPS_Real-Time_Photometric_Stereo_Using_an_Event_Camera_CVPR_2024_paper.pdf", "content": "This paper introduces EventPS , a novel approach to real-time photometric stereo using an event camera . Capitalizing on the exceptional temporal resolution, dynamic range, and low bandwidth character-istics of event cameras, EventPS estimates surface nor-mal only from the radiance changes, significantly enhanc-ing data efficiency."}
+{"idx": 1, "title": "Yu Bohan from Peking University: EventPS - Real - time Photometric ...", "date": "", "ddg_snippet": "Event cameras have the characteristics of high temporal resolution, high dynamic range and low bandwidth requirements, providing an effective data acquisition method for many computer vision tasks with high real - time requirements. The paper \" EventPS : Real - Time Photometric Stereo ...", "subpage_snippet": "", "source": "inf.news", "link": "https://inf.news/en/tech/4be4c17d4830518b9004d13cb772438e.html", "content": "Event cameras have the characteristics of high temporal resolution, high dynamic range and low bandwidth requirements, providing an effective data acquisition method for many computer vision tasks with high real - time requirements. The paper \" EventPS : Real - Time Photometric Stereo ..."}
+{"idx": 2, "title": "EventPS: Real-Time Photometric Stereo Using an Event Camera", "date": "", "ddg_snippet": "Photometric stereo is a well-established technique to es-timate the surface normal of an object. However, the re-quirement of capturing multiple high dynamic range images under different illumination conditions limits the speed and real-time applications. This paper introduces EventPS , a novel approach to real-time photometric stereo using an event camera . Capitalizing on the exceptional ...", "subpage_snippet": "", "source": "ieeexplore.ieee.org", "link": "https://ieeexplore.ieee.org/document/10655016", "content": "Photometric stereo is a well-established technique to es-timate the surface normal of an object. However, the re-quirement of capturing multiple high dynamic range images under different illumination conditions limits the speed and real-time applications. This paper introduces EventPS , a novel approach to real-time photometric stereo using an event camera . Capitalizing on the exceptional ..."}
+{"idx": 3, "title": "CVPR24 (Oral) - EventPS: Real-time photometric stereo using ... Yu Bohan from Peking University: EventPS - Real-time ... Images EventPS: Real-Time Photometric Stereo Using an Event Camera Event Fusion Photometric Stereo Network - arXiv.org EventPS: Real- Time Photometric Stereo Using an Event Camera EventPS: Real- Time Photometric Stereo Using an Event Camera EventPS: Real- Time Photometric Stereo Using an Event Camera EventPS: Real-Time Photometric Stereo Using an Event Camera EventPS: Real- Time Photometric Stereo Using an Event Camera EventPS: Real- Time Photometric Stereo Using an Event Camera EVENTPS: REAL-TIME PHOTOMETRIC STEREO USING AN EVENT CAMERA", "date": "", "ddg_snippet": "This is the video of the following work: Bohan Yu , Jieji Ren, Jin Han, Feishi Wang, Jinxiu Liang, and Boxin Shi. EventPS : Real-time photometric stereo using ... Aug 19, 2024 · The paper \" EventPS : Real-Time Photometric Stereo using an Event Camera \" is the first to use the unique properties of event cameras to achieve real-time photometric stereo . View all Jun 16, 2024 · This paper introduces EventPS , a novel approach to real-time photometric stereo using an event camera that capitalizes on the exceptional temporal resolution, dynamic range, and low bandwidth character-istics of event cameras, significantly enhancing data efficiency. Photometric stereo is a well-established technique to es-timate the surface normal of an object. However, the re-quirement of ... To alleviate the limitations of the darkroom environment and to use essential light information, we employ an event cam-era with a high dynamic range and low latency. This is the rst study that uses an event camera for the photometric stereo task, which works on con-tinuous light sources and ambient light environment. What is eventps in real-time photometric stereo? This paper introduces EventPS, a novel approach to real-time photometric stereo using an event camera . Capitalizing on the exceptional temporal resolution, dynamic range, and low bandwidth character-istics of event cameras, EventPS estimates surface nor-mal only from the radiance changes, significantly enhanc-ing data efficiency. Is eventps a novel real-time Ps approach using a single event camera? Conclusion and Discussion In this paper, we propose EventPS , a novel real-time PS approach using a single event camera. What are the advantages of event camera vs frameps? The unique attributes of event cameras, e.g., low latency, high dynamic range, and low redundancy in data representation (b), enable EventPS, a rapid and highly efficient real-time solution (c, d), which significantly reduces the bandwidth usage while maintaining comparable performance to FramePS. What is photometric stereo? Photometric stereo is a well-established technique to es-timate the surface normal of an object . However, the re-quirement of capturing multiple high dynamic ra Are event cameras good for real-time vision? Event cameras, characterized by their high temporal res-olution, high dynamic range, and low bandwidth require-ments, have recently been recognized as a promising so-lution for real-time vision applications . Unlike tradi-tional frame-based cameras, event cameras only record log-arithmic scene radiance changes. What is dynamic photometric stereo? Dynamic photo-metric stereo - a new technique for moving surface analysis . Image and Vision Computing, 2005. 3 Tsuyoshi Takatani, Yasuyuki Matsushita, Stephen Lin, Ya-suhiro Mukaigawa, and Yasushi Yagi. Enhanced photomet-ric stereo with multispectral images. Jul 5, 2024 · This paper introduces EventPS , a novel approach to real-time photometric stereo using an event camera . Capitalizing on the exceptional temporal resolution, dynamic range, and low bandwidth characteristics of event cameras, EventPS estimates surface normal only from the radiance changes, significantly enhancing data efficiency.", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=-TTp0zJKNPU", "content": "This is the video of the following work: Bohan Yu , Jieji Ren, Jin Han, Feishi Wang, Jinxiu Liang, and Boxin Shi. EventPS : Real-time photometric stereo using ... Aug 19, 2024 · The paper \" EventPS : Real-Time Photometric Stereo using an Event Camera \" is the first to use the unique properties of event cameras to achieve real-time photometric stereo . View all Jun 16, 2024 · This paper introduces EventPS , a novel approach to real-time photometric stereo using an event camera that capitalizes on the exceptional temporal resolution, dynamic range, and low bandwidth character-istics of event cameras, significantly enhancing data efficiency. Photometric stereo is a well-established technique to es-timate the surface normal of an object. However, the re-quirement of ... To alleviate the limitations of the darkroom environment and to use essential light information, we employ an event cam-era with a high dynamic range and low latency. This is the rst study that uses an event camera for the photometric stereo task, which works on con-tinuous light sources and ambient light environment. What is eventps in real-time photometric stereo? This paper introduces EventPS, a novel approach to real-time photometric stereo using an event camera . Capitalizing on the exceptional temporal resolution, dynamic range, and low bandwidth character-istics of event cameras, EventPS estimates surface nor-mal only from the radiance changes, significantly enhanc-ing data efficiency. Is eventps a novel real-time Ps approach using a single event camera? Conclusion and Discussion In this paper, we propose EventPS , a novel real-time PS approach using a single event camera. What are the advantages of event camera vs frameps? The unique attributes of event cameras, e.g., low latency, high dynamic range, and low redundancy in data representation (b), enable EventPS, a rapid and highly efficient real-time solution (c, d), which significantly reduces the bandwidth usage while maintaining comparable performance to FramePS. What is photometric stereo? Photometric stereo is a well-established technique to es-timate the surface normal of an object . However, the re-quirement of capturing multiple high dynamic ra Are event cameras good for real-time vision? Event cameras, characterized by their high temporal res-olution, high dynamic range, and low bandwidth require-ments, have recently been recognized as a promising so-lution for real-time vision applications . Unlike tradi-tional frame-based cameras, event cameras only record log-arithmic scene radiance changes. What is dynamic photometric stereo? Dynamic photo-metric stereo - a new technique for moving surface analysis . Image and Vision Computing, 2005. 3 Tsuyoshi Takatani, Yasuyuki Matsushita, Stephen Lin, Ya-suhiro Mukaigawa, and Yasushi Yagi. Enhanced photomet-ric stereo with multispectral images. Jul 5, 2024 · This paper introduces EventPS , a novel approach to real-time photometric stereo using an event camera . Capitalizing on the exceptional temporal resolution, dynamic range, and low bandwidth characteristics of event cameras, EventPS estimates surface normal only from the radiance changes, significantly enhancing data efficiency."}
+{"idx": 4, "title": "EventPS: Real-Time Photometric Stereo Using an Event Camera", "date": "", "ddg_snippet": "Jun 16, 2024 · This paper introduces EventPS , a novel approach to real-time photometric stereo using an event camera that capitalizes on the exceptional temporal resolution, dynamic range, and low bandwidth character-istics of event cameras, significantly enhancing data efficiency. Photometric stereo is a well-established technique to es-timate the surface normal of an object. However, the re-quirement of ...", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/EventPS:-Real-Time-Photometric-Stereo-Using-an-Yu-Ren/7f72975f58ceff79a3762464ba7e5f8c29c54aaf", "content": "Jun 16, 2024 · This paper introduces EventPS , a novel approach to real-time photometric stereo using an event camera that capitalizes on the exceptional temporal resolution, dynamic range, and low bandwidth character-istics of event cameras, significantly enhancing data efficiency. Photometric stereo is a well-established technique to es-timate the surface normal of an object. However, the re-quirement of ..."}
+{"idx": 5, "title": "Event Fusion Photometric Stereo Network - arXiv.org", "date": "", "ddg_snippet": "To alleviate the limitations of the darkroom environment and to use essential light information, we employ an event cam-era with a high dynamic range and low latency. This is the rst study that uses an event camera for the photometric stereo task, which works on con-tinuous light sources and ambient light environment.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2303.00308", "content": "To alleviate the limitations of the darkroom environment and to use essential light information, we employ an event cam-era with a high dynamic range and low latency. This is the rst study that uses an event camera for the photometric stereo task, which works on con-tinuous light sources and ambient light environment."}
+{"idx": 6, "title": "EVENTPS: REAL-TIME PHOTOMETRIC STEREO USING AN EVENT CAMERA", "date": "", "ddg_snippet": "Jul 5, 2024 · This paper introduces EventPS , a novel approach to real-time photometric stereo using an event camera . Capitalizing on the exceptional temporal resolution, dynamic range, and low bandwidth characteristics of event cameras, EventPS estimates surface normal only from the radiance changes, significantly enhancing data efficiency.", "subpage_snippet": "", "source": "prophesee-prod.euregion.site", "link": "https://prophesee-prod.euregion.site/2024/07/05/eventps-real-time-photometric-stereo-event-camera/", "content": "Jul 5, 2024 · This paper introduces EventPS , a novel approach to real-time photometric stereo using an event camera . Capitalizing on the exceptional temporal resolution, dynamic range, and low bandwidth characteristics of event cameras, EventPS estimates surface normal only from the radiance changes, significantly enhancing data efficiency."}
+{"idx": 7, "title": "EventPS : Real - Time Photometric Stereo Using an Event Camera", "date": "", "ddg_snippet": "... While the event camera 's sensitivity to photometric changes could potentially complement traditional cameras in such tasks, it may also be adversely affected. To date, only a few studies have explored using event cameras for photometric stereo of these types of objects [107].", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/390160865_EventPS_Real-Time_Photometric_Stereo_Using_an_Event_Camera", "content": "... While the event camera 's sensitivity to photometric changes could potentially complement traditional cameras in such tasks, it may also be adversely affected. To date, only a few studies have explored using event cameras for photometric stereo of these types of objects [107]."}
+{"idx": 8, "title": "EventPS : Real - Time Photometric Stereo Using an Event Camera", "date": "", "ddg_snippet": "Photometric stereo is a well-established technique to estimate the surface normal of an object.This paper introduces EventPS a novel approach to real - time photometric stereo using an event camera .", "subpage_snippet": "", "source": "paperswithcode.com", "link": "https://paperswithcode.com/paper/eventps-real-time-photometric-stereo-using-an", "content": "Photometric stereo is a well-established technique to estimate the surface normal of an object.This paper introduces EventPS a novel approach to real - time photometric stereo using an event camera ."}
+{"idx": 9, "title": "EventPS : Real - Time Photometric Stereo Using an Event Camera", "date": "", "ddg_snippet": "Photometric stereo is a well-established technique to es-timate the surface normal of an object.This paper introduces EventPS , a novel approach to real - time photometric stereo using an event camera .", "subpage_snippet": "", "source": "ieeexplore.ieee.org", "link": "https://ieeexplore.ieee.org/document/10655016/", "content": "Photometric stereo is a well-established technique to es-timate the surface normal of an object.This paper introduces EventPS , a novel approach to real - time photometric stereo using an event camera ."}

data/sampled_jsons/Face_x-ray_Li_et_al._2020.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "When Deepfakes Look Real: Detecting AI-Generated Faces with", "date": "", "ddg_snippet": "This allows the model to better handle different types of deepfake faces while leveraging textual information. ... leveraging unlabeled data in face ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2508.09022v1", "content": "This allows the model to better handle different types of deepfake faces while leveraging textual information. ... leveraging unlabeled data in face ..."}
+{"idx": 1, "title": "X-ray Halos of Early-Type Galaxies with AGN Feedback and", "date": "", "ddg_snippet": "The model X - ray emission and absorption are integrated along the line of sight, to obtain maps of the surface brightness Σ X \\Sigma_{\\rm X } and ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2508.03536v1", "content": "The model X - ray emission and absorption are integrated along the line of sight, to obtain maps of the surface brightness Σ X \\Sigma_{\\rm X } and ..."}
+{"idx": 2, "title": "DevFD: Developmental Face Forgery Detection by Learning Shared", "date": "", "ddg_snippet": "Tianshuo Zhang 1,2 Li Gao 3 Siran Peng 1,2 Xiangyu Zhu 1,2 Zhen Lei 1,2,4,5 1 School of Artificial Intelligence, University of Chinese ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2509.19230v1", "content": "Tianshuo Zhang 1,2 Li Gao 3 Siran Peng 1,2 Xiangyu Zhu 1,2 Zhen Lei 1,2,4,5 1 School of Artificial Intelligence, University of Chinese ..."}
+{"idx": 3, "title": "Combating Biomedical Misinformation through Multi-modal Claim", "date": "", "ddg_snippet": "... demonstrate that CER achieves state-of-the-art performance on benchmarks such as HealthFC (Vladika et al ., 2024 ) , BioASQ-7 (Nentidis et al ., 2020 ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2509.13888v1", "content": "... demonstrate that CER achieves state-of-the-art performance on benchmarks such as HealthFC (Vladika et al ., 2024 ) , BioASQ-7 (Nentidis et al ., 2020 ..."}
+{"idx": 4, "title": "Population-level morphological analysis of paired CO2- and", "date": "", "ddg_snippet": "... face scanning electron microscopy (SBEM) and nanoscale morphometric analysis, we further found that the sensory surface areas of outer dendrites, ...", "subpage_snippet": "", "source": "elifesciences.org", "link": "https://elifesciences.org/articles/106389", "content": "... face scanning electron microscopy (SBEM) and nanoscale morphometric analysis, we further found that the sensory surface areas of outer dendrites, ..."}
+{"idx": 5, "title": "Frontiers | Inequitable distribution of plastic benefits and", "date": "", "ddg_snippet": "These well-studied environmental injustices are often described for only one stage of the plastic lifecycle ( Nielsen et al ., 2020 ), which ...", "subpage_snippet": "", "source": "www.frontiersin.org", "link": "https://www.frontiersin.org/journals/marine-science/articles/10.3389/fmars.2022.1017247/full", "content": "These well-studied environmental injustices are often described for only one stage of the plastic lifecycle ( Nielsen et al ., 2020 ), which ..."}
+{"idx": 6, "title": "Mitigating Hallucinations in Multimodal LLMs via Object-aware", "date": "", "ddg_snippet": "Experiments on multiple hallucination benchmarks, such as AMBER [ Wang et al .(2023)Wang, Wang, Xu, Zhang, Gu, Jia, Wang, Xu, Yan, Zhang, et al .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2508.20181v1", "content": "Experiments on multiple hallucination benchmarks, such as AMBER [ Wang et al .(2023)Wang, Wang, Xu, Zhang, Gu, Jia, Wang, Xu, Yan, Zhang, et al ."}
+{"idx": 7, "title": "Refining medical large language models: key insights from", "date": "", "ddg_snippet": "... Peng, 2024 ) for their potential to enhance various medical tasks, such as clinical decision-making ( He et al ., 2023 ), question-answering ( Li et ...", "subpage_snippet": "", "source": "peerj.com", "link": "https://peerj.com/articles/cs-3216/", "content": "... Peng, 2024 ) for their potential to enhance various medical tasks, such as clinical decision-making ( He et al ., 2023 ), question-answering ( Li et ..."}
+{"idx": 8, "title": "Frontiers | Waste Clearance in the Brain", "date": "", "ddg_snippet": "... limited to, AD, stroke, TBI, multiple sclerosis, diabetes, and chronic traumatic encephalopathy, suggesting its involvement in virtually most ...", "subpage_snippet": "", "source": "www.frontiersin.org", "link": "https://www.frontiersin.org/journals/neuroanatomy/articles/10.3389/fnana.2021.665803/full", "content": "... limited to, AD, stroke, TBI, multiple sclerosis, diabetes, and chronic traumatic encephalopathy, suggesting its involvement in virtually most ..."}
+{"idx": 9, "title": "ESSD - CRA-LICOM: a global high-frequency atmospheric and", "date": "", "ddg_snippet": "The product is freely available at https://doi.org/10.11888/SolidEar.tpdc.302016 ( Liu et al . ... Liu, H., Zhang, W., Wu, Y ., Liu, S., Shi, C., ...", "subpage_snippet": "", "source": "essd.copernicus.org", "link": "https://essd.copernicus.org/articles/17/4691/2025/", "content": "The product is freely available at https://doi.org/10.11888/SolidEar.tpdc.302016 ( Liu et al . ... Liu, H., Zhang, W., Wu, Y ., Liu, S., Shi, C., ..."}

data/sampled_jsons/Farina_extragradient_RM+_ExRM+_O(1T)_convergence_2023_year_2023.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Regret Matching : (In)Stability and Fast Convergence in Games", "date": "", "ddg_snippet": "op-ping off achieves O ( 1 ) social regret in normal-form games. We also apply our stabilizing techniques to clairvoyant updates in the uncoupled learning setting for RM+ , introduced Extragradient RM+ , and prove desirable results akin t", "subpage_snippet": "", "source": "www.mit.edu", "link": "https://www.mit.edu/~gfarina/2023/rm_plus_convergence_neurips23/rm_plus_convergence_neurips23.pdf", "content": "op-ping off achieves O ( 1 ) social regret in normal-form games. We also apply our stabilizing techniques to clairvoyant updates in the uncoupled learning setting for RM+ , introduced Extragradient RM+ , and prove desirable results akin t"}
+{"idx": 1, "title": "arXiv:2311.00676v1 [cs.GT] 1 Nov 2023", "date": "", "ddg_snippet": "matrix games (unlike OGDA and OMWU). To address this, Farina et al. ( 2023 ) introduce two variants of RM+ with O ( 1/T ) ergodic convergence for matrix games, namely, Extragradient RM+ ( ExRM+ ) and Smooth Predictive RM+ (SPRM+), but the last-iterate conver-gence properties of all these variants remain unknown. 1 Motivated by this, in this work, we ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2311.00676v1.pdf", "content": "matrix games (unlike OGDA and OMWU). To address this, Farina et al. ( 2023 ) introduce two variants of RM+ with O ( 1/T ) ergodic convergence for matrix games, namely, Extragradient RM+ ( ExRM+ ) and Smooth Predictive RM+ (SPRM+), but the last-iterate conver-gence properties of all these variants remain unknown. 1 Motivated by this, in this work, we ..."}
+{"idx": 2, "title": "Last-iterate convergence separation between extra-gradient ...", "date": "", "ddg_snippet": "Jul 15, 2024 · Typical algorithms that exhibit the last-iterate convergence property include optimistic and extragradient methods. However, most existing results establish these properties under the assumption that the game is time-independent.", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/10.5555/3702676.3702739", "content": "Jul 15, 2024 · Typical algorithms that exhibit the last-iterate convergence property include optimistic and extragradient methods. However, most existing results establish these properties under the assumption that the game is time-independent."}
+{"idx": 3, "title": "Last-Iterate Convergence Properties of Regret-Matching ...", "date": "", "ddg_snippet": "3. **Restart mechanism**: Propose ExRM+ and SPRM+ under the restart mechanism and prove their linear last - iterate convergence rate. 4. **Positive results under strict assumptions**: Prove that under the restrictive conditions of strict Nash equilibrium, RM+ does have last - iterate convergence .", "subpage_snippet": "", "source": "bohrium.dp.tech", "link": "https://bohrium.dp.tech/paper/arxiv/2311.00676", "content": "3. **Restart mechanism**: Propose ExRM+ and SPRM+ under the restart mechanism and prove their linear last - iterate convergence rate. 4. **Positive results under strict assumptions**: Prove that under the restrictive conditions of strict Nash equilibrium, RM+ does have last - iterate convergence ."}
+{"idx": 4, "title": "Gabriele Farina - Last-Iterate Convergence Properties of ...", "date": "", "ddg_snippet": "We then prove that recent variants of these algorithms based on a smoothing technique, extragradient RM+ and smooth Predictive RM+ , enjoy asymptotic last-iterate convergence (without a rate), $ 1 /\\sqrt { t }$ best-iterate convergence , and when combined with restarting, linear-rate last-iterate convergence .", "subpage_snippet": "", "source": "www.mit.edu", "link": "https://www.mit.edu/~gfarina/2025/iclr25_rm_lastiterate/", "content": "We then prove that recent variants of these algorithms based on a smoothing technique, extragradient RM+ and smooth Predictive RM+ , enjoy asymptotic last-iterate convergence (without a rate), $ 1 /\\sqrt { t }$ best-iterate convergence , and when combined with restarting, linear-rate last-iterate convergence ."}
+{"idx": 5, "title": "Last-Iterate Convergence Properties of Regret Matching ...", "date": "", "ddg_snippet": "Notation. Regret Matching+( RM+ ) and its variants. Extragradient RM+and Smooth Predictive RM+ 3 Non- convergence of RM+ , alternating RM+ , and PRM+ 4 Convergence Properties of ExRM+ 4. 1 Convergence of the Iterates Convergence in the Duality Gap Does Not Rule Out Cycling.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2311.00676v2", "content": "Notation. Regret Matching+( RM+ ) and its variants. Extragradient RM+and Smooth Predictive RM+ 3 Non- convergence of RM+ , alternating RM+ , and PRM+ 4 Convergence Properties of ExRM+ 4. 1 Convergence of the Iterates Convergence in the Duality Gap Does Not Rule Out Cycling."}
+{"idx": 6, "title": "On the O ( 1 / t ) convergence rate of the projection and contraction...", "date": "", "ddg_snippet": "Until now, only convergence results are available to these projection and contraction methods, though the numerical experiments indicate that they always outperform the extragradient method. The reason is that the former benefits from the `optimal’ step size in the contraction sense.", "subpage_snippet": "", "source": "optimization-online.org", "link": "https://optimization-online.org/2011/07/3097/", "content": "Until now, only convergence results are available to these projection and contraction methods, though the numerical experiments indicate that they always outperform the extragradient method. The reason is that the former benefits from the `optimal’ step size in the contraction sense."}
+{"idx": 7, "title": "On the convergence of single-call stochastic extra - gradient ... | DeepAI", "date": "", "ddg_snippet": "In this setting, the optimal O ( 1 / t ) convergence rate for solving smooth monotone variational inequalities is achieved by the Extra - Gradient (EG) algorithm and its variants.", "subpage_snippet": "", "source": "deepai.org", "link": "https://deepai.org/publication/on-the-convergence-of-single-call-stochastic-extra-gradient-methods", "content": "In this setting, the optimal O ( 1 / t ) convergence rate for solving smooth monotone variational inequalities is achieved by the Extra - Gradient (EG) algorithm and its variants."}
+{"idx": 8, "title": "[PDF] On the O ( 1 / t ) Convergence Rate of... | Semantic Scholar", "date": "", "ddg_snippet": "A worst-case $ O ( 1 / t )$ convergence rate is shown for the Douglas--Rachford alternating direction method of multipliers where a general Glowinski relaxation factor is used.", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/On-the-O(1-t)-Convergence-Rate-of-Alternating-with-Tao-Yuan/e08f36b33401c87bb13c01fc667af739210cc717", "content": "A worst-case $ O ( 1 / t )$ convergence rate is shown for the Douglas--Rachford alternating direction method of multipliers where a general Glowinski relaxation factor is used."}
+{"idx": 9, "title": "On the Convergence of Single-Call Stochastic Extra - Gradient Methods", "date": "", "ddg_snippet": "In this setting, the optimal O ( 1 / t ) convergence rate for solving smooth monotone variational inequalities is achieved by the Extra - Gradient (EG) algorithm and its variants.", "subpage_snippet": "", "source": "inria.hal.science", "link": "https://inria.hal.science/hal-02403555/document", "content": "In this setting, the optimal O ( 1 / t ) convergence rate for solving smooth monotone variational inequalities is achieved by the Extra - Gradient (EG) algorithm and its variants."}

data/sampled_jsons/FlowDec_ScoreDec_NFE_Number_of_Function_Evaluations_comparison.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "FlowDec | A flow-based full-band general audio codec with ...", "date": "", "ddg_snippet": "FlowDec achieves the following metrics at 7.5 kbps with 6 NFE (neural network evaluations ), compared to ScoreDec and other baselines. There is almost no drop in performance for FlowDec at 6 NFE compared to 50 NFE , while ScoreDec shows a significant drop. We have used FlowDec at 6 NFE for all other evaluations and the audio examples shown above.", "subpage_snippet": "", "source": "sp-uhh.github.io", "link": "https://sp-uhh.github.io/FlowDec/", "content": "FlowDec achieves the following metrics at 7.5 kbps with 6 NFE (neural network evaluations ), compared to ScoreDec and other baselines. There is almost no drop in performance for FlowDec at 6 NFE compared to 50 NFE , while ScoreDec shows a significant drop. We have used FlowDec at 6 NFE for all other evaluations and the audio examples shown above."}
+{"idx": 1, "title": "[2503.01485] FlowDec: A flow-based full-band general audio ...", "date": "", "ddg_snippet": "At NFE 50 \\text { NFE }=50, ScoreDec and FlowDec achieve similar SI-SDR, but FlowDec performs significantly better in FAD. A full metric comparison table can be found in SectionA.7.1.", "subpage_snippet": "", "source": "ar5iv.labs.arxiv.org", "link": "https://ar5iv.labs.arxiv.org/html/2503.01485", "content": "At NFE 50 \\text { NFE }=50, ScoreDec and FlowDec achieve similar SI-SDR, but FlowDec performs significantly better in FAD. A full metric comparison table can be found in SectionA.7.1."}
+{"idx": 2, "title": "GitHub - facebookresearch/FlowDec: An neural full-band audio ...", "date": "", "ddg_snippet": "Mar 3, 2025 · FlowDec FlowDec (ICLR 2025) is a full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/facebookresearch/FlowDec", "content": "Mar 3, 2025 · FlowDec FlowDec (ICLR 2025) is a full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method."}
+{"idx": 3, "title": "FlowDec/index.html at main · sp-uhh/FlowDec · GitHub", "date": "", "ddg_snippet": "Compared to the prior work ScoreDec which is based on score matching, we generalize from speech to general audio and move from 24 kbit/s to as low as 4 kbit/s, while improving output quality and reducing the required postfilter DNN evaluations from 60 to 6 without any fine-tuning or distillation techniques.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/sp-uhh/FlowDec/blob/main/index.html", "content": "Compared to the prior work ScoreDec which is based on score matching, we generalize from speech to general audio and move from 24 kbit/s to as low as 4 kbit/s, while improving output quality and reducing the required postfilter DNN evaluations from 60 to 6 without any fine-tuning or distillation techniques."}
+{"idx": 4, "title": "[2503.01485] FlowDec: A flow-based full-band general audio ...", "date": "", "ddg_snippet": "Mar 3, 2025 · We propose FlowDec , a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. Compared to the prior work ScoreDec which is based on score matching, we generalize from speech to general audio and move from 24 kbit/s to as low as 4 kbit/s, while improving output ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2503.01485", "content": "Mar 3, 2025 · We propose FlowDec , a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. Compared to the prior work ScoreDec which is based on score matching, we generalize from speech to general audio and move from 24 kbit/s to as low as 4 kbit/s, while improving output ..."}
+{"idx": 5, "title": "FlowDec : A flow -based full-band general audio codec with high...", "date": "", "ddg_snippet": "NFE . number of function evaluations . ODE. ordinary differential equation., ScoreDec and FlowDec achieve similar SI-SDR, but FlowDec performs significantly better in FAD. A full metric comparison table can be found in Section A.7.1. Finally, in Fig.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2503.01485v1", "content": "NFE . number of function evaluations . ODE. ordinary differential equation., ScoreDec and FlowDec achieve similar SI-SDR, but FlowDec performs significantly better in FAD. A full metric comparison table can be found in Section A.7.1. Finally, in Fig."}
+{"idx": 6, "title": "FlowDec : A flow -based full-band general audio codec... | OpenReview", "date": "", "ddg_snippet": "Compared to the prior work ScoreDec which is based on score matching, we generalize from speech to general audio and move from 24 kbit/s to as low as 4 kbit/s, while improving output quality and reducing the required postfilter DNN evaluations from 60 to 6 without any...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=uxDFlPGRLX", "content": "Compared to the prior work ScoreDec which is based on score matching, we generalize from speech to general audio and move from 24 kbit/s to as low as 4 kbit/s, while improving output quality and reducing the required postfilter DNN evaluations from 60 to 6 without any..."}
+{"idx": 7, "title": "FlowDec : A flow -based full-band general audio codec with high...", "date": "", "ddg_snippet": "We propose FlowDec , a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. Compared to the prior work ScoreDec which is based on score ...", "subpage_snippet": "", "source": "synthical.com", "link": "https://synthical.com/article/FlowDec:-A-flow-based-full-band-general-audio-codec-with-high-perceptual-quality-17045f43-017b-4495-bcb6-65d8964daff3", "content": "We propose FlowDec , a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. Compared to the prior work ScoreDec which is based on score ..."}
+{"idx": 8, "title": "[OPEN SOURCE] FlowDec (by Meta Research)", "date": "", "ddg_snippet": "FlowDec (ICLR 2025) is a full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. From abstract", "subpage_snippet": "", "source": "hydrogenaudio.org", "link": "https://hydrogenaudio.org/index.php/topic,127623.0.html", "content": "FlowDec (ICLR 2025) is a full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. From abstract"}
+{"idx": 9, "title": "flowdec · PyPI", "date": "", "ddg_snippet": "DeconvolutionLab2 Comparison - Comparing execution times between DeconvolutionLab2 and Flowdec . Graph Export - Defining and exporting TensorFlow graphs.", "subpage_snippet": "", "source": "pypi.org", "link": "https://pypi.org/project/flowdec/", "content": "DeconvolutionLab2 Comparison - Comparing execution times between DeconvolutionLab2 and Flowdec . Graph Export - Defining and exporting TensorFlow graphs."}

data/sampled_jsons/FlowDec_Section_4.4_subjective_listening_tests_Figure_6_audio_types.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "FlowDec: A flow-based full-band general audio codec with high ...", "date": "", "ddg_snippet": "A. 6 Detailed results from subjective listening tests In Fig. 10, we show the score distribution from both MUSHRA-like listening tests ( Section 4.4 ) split by audio type.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2503.01485v1", "content": "A. 6 Detailed results from subjective listening tests In Fig. 10, we show the score distribution from both MUSHRA-like listening tests ( Section 4.4 ) split by audio type."}
+{"idx": 1, "title": "[2503.01485] FlowDec: A flow-based full-band general audio ...", "date": "", "ddg_snippet": "Mar 3, 2025 · We propose FlowDec , a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. Compared to the prior work ScoreDec which is based on score matching, we generalize from speech to general audio and move from 24 kbit/s to as low as 4 kbit/s, while improving output ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2503.01485", "content": "Mar 3, 2025 · We propose FlowDec , a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. Compared to the prior work ScoreDec which is based on score matching, we generalize from speech to general audio and move from 24 kbit/s to as low as 4 kbit/s, while improving output ..."}
+{"idx": 2, "title": "EBU Tech 3286s1-2001 Subjective evaluation of quality; Sup.1 ...", "date": "", "ddg_snippet": "This document is a supplement to the main part of EBU Tech 3286, \"Assessment methods for the subjective evaluation of the quality of sound programme material – Music\" [4]. The main part is limited to recommendations for sound systems or programme material using two channels. The purpose of this supplement is to add requirements that relate specifically to the assessment of audio material ...", "subpage_snippet": "", "source": "tech.ebu.ch", "link": "https://tech.ebu.ch/docs/tech/tech3286s1.pdf", "content": "This document is a supplement to the main part of EBU Tech 3286, \"Assessment methods for the subjective evaluation of the quality of sound programme material – Music\" [4]. The main part is limited to recommendations for sound systems or programme material using two channels. The purpose of this supplement is to add requirements that relate specifically to the assessment of audio material ..."}
+{"idx": 3, "title": "Speech Quality Assessment - University of Texas at Dallas A arXiv:2503.01485v1 [cs.SD] 3 Mar 2025 Go Listen: An End-to-End Online Listening Test Platform FlowDec : A flow -based full-band general audio codec with high perce… Go Listen: An End-to-End Online Listening Test Platform FlowDec : A flow -based full-band general audio codec with high perce… Speech Quality Assessment - University of Texas at Dallas Speech Quality Assessment - University of Texas at Dallas Speech Quality Assessment - University of Texas at Dallas D5.6: Report on Audio subjective tests and User tests", "date": "", "ddg_snippet": "Several methods for evaluating speech quality have been proposed in the [1]. These methods can be broadly classified into two categories: are based on relative preference tasks and those that are based on numerical value on the quality of the speech stimuli, i.e., based on quality In the relative preference tests , listeners are presented with a pai... See full list on ecs.utdallas.edu Preference tests typically answer the question: “How well does an average like a particular test signal over another signal or over a reference signal can be easily reproduced?” Listeners must choose between two sequentially sented signals, but do not need to indicate the magnitude of their (except in the CCR test, Table 1) or the reason(s) for the... See full list on ecs.utdallas.edu In addition to the above measures, one can form the so called composite [1, Ch. 9] by combining multiple objective measures. The rational behind of composite measures is that different objective measures capture different acteristics of the distorted signal, and therefore combining them in a linear linear fashion can potentially yield significant g... See full list on ecs.utdallas.edu So far we have not yet discussed what makes a certain objective measure than other. Some objective measures are “optimized” for a particular type tortion and may not be meaningful for another type of distortion. The evaluating the validity of objective measures over a wide range of immense [1]. A suggested process to follow is to create a large dat... See full list on ecs.utdallas.edu d − d ] d − d where S are the subjective quality ratings, are the values of the measure, and and are the mean values of S and respectively. correlation coefficient ρ can be used to predict the subjective results based values of the objectives measures as follows: See full list on ecs.utdallas.edu P 1 −ρ where is the standard error of the estimate. σe The standard error of the of the subjective scores provides a measure of variability of the subjective about the regression line, averaged over all objective scores. For good ity of the subjective scores, we would like the objective measure to yield value of e . Both figures of merit, i.e., cor... See full list on ecs.utdallas.edu Presently, there is no single objective measure that correlates well with listening evaluations for a wide range of speech distortions. Most measures been validated for a specific type of distortion and for a specific language. measures correlate well with distortions introduced by speech coders while (e.g., PESQ measure) correlate well with distor... See full list on ecs.utdallas.edu We showed that FlowDec achieves state-of-the-art FAD scores for the coding task and, in a listening test , performs on par with the current state-of-the-art GAN-based codec DAC (Kumar et al., 2024) at bitrates between 4.5 and 7.5kbit/s. Introduction Advances in audio processing technology often employ a series of objective and subjective tests to compare performance against previous algorithms. In the case of subjective listening tests , the most commonly used methodologies include; Multiple Stimuli with Hidden Reference and Anchor (MUSHRA) [1], Absolute Category Rating (ACR) [2] and A/B comparison testing [2]. Increasingly ... Is flowdec a neural full-band audio codec for general audio sampled at 48 kHz? We propose FlowDec, a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. What is a subjective listening test? Subjective listening tests are routinely conducted by academic researchers and industry professionals to assess the quality of various speech and audio processing algorithms and transmission services . Is flowdec a postfilter-Based Neural Codec for general audio? We presented FlowDec, a novel postfilter-based neural codec for general audio with high perceptual quality . What should be included in a tive listening test? The objective measure should incorporate knowledge from different of processing including low-level processing (e.g., psychoacoustics) and level processing such as prosodics, semantics, linguistics and pragmatics. ideal measure should predict with high accuracy the results obtained from tive listening tests with normal-hearing listeners. What are the limitations of subjective listening tests? Current objective limited in that most require access to the original speech signal, and some model the low-level processing (e.g., masking effects) of the auditory system. despite these limitations some of these objective measures have been found late well with subjective listening tests (e.g., MOS scores). How reliable are subjective listening tests based on rating scores? For the relative preference listening tests, one-sided t-tests need to be sess whether algorithm A is preferred over algorithm B beyond the chance which is 50%. In summary, no reliable conclusions can be drawn based solely on rating scores collected from subjective listening tests. Deliverable D5. 6 presents the results of subjective audio quality tests and user acceptance tests performed in Tasks 5.1 and T5.4. Two different user experience tests have been conducted, which both examined how the ORPHEUS app and, more generally, object-based radio is received by naïve users. In addition, two more studies regarding the perceived quality of object-based audio content have ...", "subpage_snippet": "", "source": "ecs.utdallas.edu", "link": "https://ecs.utdallas.edu/loizou/cimplants/quality_assessment_chapter.pdf", "content": "Several methods for evaluating speech quality have been proposed in the [1]. These methods can be broadly classified into two categories: are based on relative preference tasks and those that are based on numerical value on the quality of the speech stimuli, i.e., based on quality In the relative preference tests , listeners are presented with a pai... See full list on ecs.utdallas.edu Preference tests typically answer the question: “How well does an average like a particular test signal over another signal or over a reference signal can be easily reproduced?” Listeners must choose between two sequentially sented signals, but do not need to indicate the magnitude of their (except in the CCR test, Table 1) or the reason(s) for the... See full list on ecs.utdallas.edu In addition to the above measures, one can form the so called composite [1, Ch. 9] by combining multiple objective measures. The rational behind of composite measures is that different objective measures capture different acteristics of the distorted signal, and therefore combining them in a linear linear fashion can potentially yield significant g... See full list on ecs.utdallas.edu So far we have not yet discussed what makes a certain objective measure than other. Some objective measures are “optimized” for a particular type tortion and may not be meaningful for another type of distortion. The evaluating the validity of objective measures over a wide range of immense [1]. A suggested process to follow is to create a large dat... See full list on ecs.utdallas.edu d − d ] d − d where S are the subjective quality ratings, are the values of the measure, and and are the mean values of S and respectively. correlation coefficient ρ can be used to predict the subjective results based values of the objectives measures as follows: See full list on ecs.utdallas.edu P 1 −ρ where is the standard error of the estimate. σe The standard error of the of the subjective scores provides a measure of variability of the subjective about the regression line, averaged over all objective scores. For good ity of the subjective scores, we would like the objective measure to yield value of e . Both figures of merit, i.e., cor... See full list on ecs.utdallas.edu Presently, there is no single objective measure that correlates well with listening evaluations for a wide range of speech distortions. Most measures been validated for a specific type of distortion and for a specific language. measures correlate well with distortions introduced by speech coders while (e.g., PESQ measure) correlate well with distor... See full list on ecs.utdallas.edu We showed that FlowDec achieves state-of-the-art FAD scores for the coding task and, in a listening test , performs on par with the current state-of-the-art GAN-based codec DAC (Kumar et al., 2024) at bitrates between 4.5 and 7.5kbit/s. Introduction Advances in audio processing technology often employ a series of objective and subjective tests to compare performance against previous algorithms. In the case of subjective listening tests , the most commonly used methodologies include; Multiple Stimuli with Hidden Reference and Anchor (MUSHRA) [1], Absolute Category Rating (ACR) [2] and A/B comparison testing [2]. Increasingly ... Is flowdec a neural full-band audio codec for general audio sampled at 48 kHz? We propose FlowDec, a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. What is a subjective listening test? Subjective listening tests are routinely conducted by academic researchers and industry professionals to assess the quality of various speech and audio processing algorithms and transmission services . Is flowdec a postfilter-Based Neural Codec for general audio? We presented FlowDec, a novel postfilter-based neural codec for general audio with high perceptual quality . What should be included in a tive listening test? The objective measure should incorporate knowledge from different of processing including low-level processing (e.g., psychoacoustics) and level processing such as prosodics, semantics, linguistics and pragmatics. ideal measure should predict with high accuracy the results obtained from tive listening tests with normal-hearing listeners. What are the limitations of subjective listening tests? Current objective limited in that most require access to the original speech signal, and some model the low-level processing (e.g., masking effects) of the auditory system. despite these limitations some of these objective measures have been found late well with subjective listening tests (e.g., MOS scores). How reliable are subjective listening tests based on rating scores? For the relative preference listening tests, one-sided t-tests need to be sess whether algorithm A is preferred over algorithm B beyond the chance which is 50%. In summary, no reliable conclusions can be drawn based solely on rating scores collected from subjective listening tests. Deliverable D5. 6 presents the results of subjective audio quality tests and user acceptance tests performed in Tasks 5.1 and T5.4. Two different user experience tests have been conducted, which both examined how the ORPHEUS app and, more generally, object-based radio is received by naïve users. In addition, two more studies regarding the perceived quality of object-based audio content have ..."}
+{"idx": 4, "title": "Go Listen: An End-to-End Online Listening Test Platform", "date": "", "ddg_snippet": "Introduction Advances in audio processing technology often employ a series of objective and subjective tests to compare performance against previous algorithms. In the case of subjective listening tests , the most commonly used methodologies include; Multiple Stimuli with Hidden Reference and Anchor (MUSHRA) [1], Absolute Category Rating (ACR) [2] and A/B comparison testing [2]. Increasingly ...", "subpage_snippet": "", "source": "openresearchsoftware.metajnl.com", "link": "https://openresearchsoftware.metajnl.com/articles/10.5334/jors.361", "content": "Introduction Advances in audio processing technology often employ a series of objective and subjective tests to compare performance against previous algorithms. In the case of subjective listening tests , the most commonly used methodologies include; Multiple Stimuli with Hidden Reference and Anchor (MUSHRA) [1], Absolute Category Rating (ACR) [2] and A/B comparison testing [2]. Increasingly ..."}
+{"idx": 5, "title": "D5.6: Report on Audio subjective tests and User tests", "date": "", "ddg_snippet": "Deliverable D5. 6 presents the results of subjective audio quality tests and user acceptance tests performed in Tasks 5.1 and T5.4. Two different user experience tests have been conducted, which both examined how the ORPHEUS app and, more generally, object-based radio is received by naïve users. In addition, two more studies regarding the perceived quality of object-based audio content have ...", "subpage_snippet": "", "source": "orpheus-audio.eu", "link": "https://orpheus-audio.eu/wp-content/uploads/2018/07/orpheus-d5.6_report-on-audio-subjective-and-user-tests_v1.3.pdf", "content": "Deliverable D5. 6 presents the results of subjective audio quality tests and user acceptance tests performed in Tasks 5.1 and T5.4. Two different user experience tests have been conducted, which both examined how the ORPHEUS app and, more generally, object-based radio is received by naïve users. In addition, two more studies regarding the perceived quality of object-based audio content have ..."}
+{"idx": 6, "title": "FLOWDEC: A FLOW-BASED FULL-BAND GENERAL", "date": "", "ddg_snippet": "Figure 6 : Subjective listening results from Test A (left) and Test B (right). Numbers in (parentheses) denote the used bitrate in kbit/s. FlowDec is rated on ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf/46581252e0bf80bf4efd8fcbc4002f8627f498bb.pdf", "content": "Figure 6 : Subjective listening results from Test A (left) and Test B (right). Numbers in (parentheses) denote the used bitrate in kbit/s. FlowDec is rated on ..."}
+{"idx": 7, "title": "A arXiv:2503.01485v1 [cs.SD] 3 Mar 2025", "date": "", "ddg_snippet": "We showed that FlowDec achieves state-of-the-art FAD scores for the coding task and, in a listening test , performs on par with the current state-of-the-art GAN-based codec DAC (Kumar et al., 2024) at bitrates between 4.5 and 7.5kbit/s.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2503.01485v1", "content": "We showed that FlowDec achieves state-of-the-art FAD scores for the coding task and, in a listening test , performs on par with the current state-of-the-art GAN-based codec DAC (Kumar et al., 2024) at bitrates between 4.5 and 7.5kbit/s."}
+{"idx": 8, "title": "Proceedings of the First International Conference on ...", "date": "", "ddg_snippet": "Figure 6 appears to show a more favorable position for the emitter than the original ... The results of the tests carried out on the three types of bacteria ... 396 pages", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/content/pdf/10.1007/978-981-99-7775-8.pdf", "content": "Figure 6 appears to show a more favorable position for the emitter than the original ... The results of the tests carried out on the three types of bacteria ... 396 pages"}
+{"idx": 9, "title": "Chesapeake Bay Total Maximum Daily Load for Nitrogen ...", "date": "", "ddg_snippet": "Chesapeake Bay Total Maximum Daily Load for Nitrogen, Phosphorus and Sediment: Technical Appendices.", "subpage_snippet": "", "source": "nepis.epa.gov", "link": "https://nepis.epa.gov/Exe/ZyPURL.cgi?Dockey=9101KBW7.TXT", "content": "Chesapeake Bay Total Maximum Daily Load for Nitrogen, Phosphorus and Sediment: Technical Appendices."}

data/sampled_jsons/FlowDec_Table_8_SIGMOS_values_sitearxiv.org.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "FlowDec: A flow-based full-band general audio codec with high ...", "date": "", "ddg_snippet": "Abstract We propose FlowDec , a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. Compared to the prior work ScoreDec which is based on score matching, we generalize from speech to general audio and move from 24 kbit/s to as low as 4 kbit/s, while improving ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2503.01485v1", "content": "Abstract We propose FlowDec , a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. Compared to the prior work ScoreDec which is based on score matching, we generalize from speech to general audio and move from 24 kbit/s to as low as 4 kbit/s, while improving ..."}
+{"idx": 1, "title": "[2503.01485] FlowDec: A flow-based full-band general audio ...", "date": "", "ddg_snippet": "Mar 3, 2025 · We propose FlowDec , a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. Compared to the prior work ScoreDec which is based on score matching, we generalize from speech to general audio and move from 24 kbit/s to as low as 4 kbit/s, while improving output ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2503.01485", "content": "Mar 3, 2025 · We propose FlowDec , a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. Compared to the prior work ScoreDec which is based on score matching, we generalize from speech to general audio and move from 24 kbit/s to as low as 4 kbit/s, while improving output ..."}
+{"idx": 2, "title": "[2008.11285] Cosmology Intertwined III: $f σ_8$ and $S_8$ A arXiv:2503.01485v1 [cs.SD] 3 Mar 2025 [2503.01485] FlowDec: A flow-based full-band general audio ... Testing Planck 2020 and DESI data on wCDM Models FlowDec : A flow-based full-band general audio codec with high perce… FlowDec : A flow-based full-band general audio codec with high perce… FlowDec : A flow-based full-band general audio codec with high perce… FlowDec : A flow-based full-band general audio codec with high perce… FlowDec : A flow-based full-band general audio codec with high perce… Reconciling 𝑺_𝟖: Insights from Interacting Dark Sectors", "date": "", "ddg_snippet": "Aug 25, 2020 · In this Letter of Interest we focus on the tension of the Planck data with weak lensing measurements and redshift surveys, about the value of the matter energy density $\\Omega_m$, and the amplitude or rate of the growth of structure ($\\ sigma _ 8 ,f\\ sigma _ 8 $). Our main model FlowDec - 75m produces the best FAD values by a large margin and also performs best on the SIGMOS OVRL metric. For the intrusive spectral metrics SI-SDR, fwSSNR, and logSpecMSE, retrained DAC generally outperforms FlowDec , though the gap in the perceptually weighted fwSSNR is small. Mar 3, 2025 · We propose FlowDec , a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. Compared to the prior work ScoreDec which is based on score matching, we generalize from speech to general audio and move from 24 kbit/s to as low as 4 kbit/s, while improving output ... Jul 15, 2025 · This work delves into the dynamical dark energy models of the wCDM parameterisation that are defined by their equation of state by comparing different, well-known parameterisation models, in an attempt to lessen the tensions of {H_0} and {\\ sigma _ 8 } by using the latest observational data. Is flowdec a neural full-band audio codec for general audio sampled at 48 kHz? We propose FlowDec, a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. Is flowdec a generative neural codec based on conditional flow matching? In this work, we propose FlowDec, a generative neural codec based on a novel adaptation of conditional flow matching (CFM) (Lipman et al., 2023; Pooladian et al., 2023; Tong et al., 2024), and show that it is a competitive alternative to the current GAN -focused stream of neural codecs for general full-band audio. Is flowdec a competitive alternative to Gan? We show that FlowDec is a competitive alternative to the recent GAN-dominated stream of neural codecs, achieving FAD scores better than those of the established GAN-based codec DAC and listening test scores that are on par, and producing qualitatively more natural reconstructions for speech and harmonic structures in music. Is flowdec better than scoredec? As the metrics show, FlowDec works significantly better at NFE =6 where ScoreDec and FlowAVSE fail to produce acceptable results, and also generally outperforms ScoreDec at NFE =50. Is flowdec better than DAC? FlowDec is rated on par with DAC (Kumar et al., 2024), with no significant differences between their score distributions at any given bitrate and feature rate. Figure 7: Spectrogram comparison (pre-emphasis of 0.95) of DAC and FlowDec at 7.5 kbit/s for a guitar test audio. FlowDec better preserves harmonics where DAC creates noise-like structures . We further investigate the role of redshift space distortion data sets and find an overall reduction in tension, with a σ8,0subscript𝜎80\\ sigma _{ 8 ,0}italic_σ start_POSTSUBSCRIPT 8 , 0 end_POSTSUBSCRIPTvalue relatively closer to the CMB value .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2008.11285", "content": "Aug 25, 2020 · In this Letter of Interest we focus on the tension of the Planck data with weak lensing measurements and redshift surveys, about the value of the matter energy density $\\Omega_m$, and the amplitude or rate of the growth of structure ($\\ sigma _ 8 ,f\\ sigma _ 8 $). Our main model FlowDec - 75m produces the best FAD values by a large margin and also performs best on the SIGMOS OVRL metric. For the intrusive spectral metrics SI-SDR, fwSSNR, and logSpecMSE, retrained DAC generally outperforms FlowDec , though the gap in the perceptually weighted fwSSNR is small. Mar 3, 2025 · We propose FlowDec , a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. Compared to the prior work ScoreDec which is based on score matching, we generalize from speech to general audio and move from 24 kbit/s to as low as 4 kbit/s, while improving output ... Jul 15, 2025 · This work delves into the dynamical dark energy models of the wCDM parameterisation that are defined by their equation of state by comparing different, well-known parameterisation models, in an attempt to lessen the tensions of {H_0} and {\\ sigma _ 8 } by using the latest observational data. Is flowdec a neural full-band audio codec for general audio sampled at 48 kHz? We propose FlowDec, a neural full-band audio codec for general audio sampled at 48 kHz that combines non-adversarial codec training with a stochastic postfilter based on a novel conditional flow matching method. Is flowdec a generative neural codec based on conditional flow matching? In this work, we propose FlowDec, a generative neural codec based on a novel adaptation of conditional flow matching (CFM) (Lipman et al., 2023; Pooladian et al., 2023; Tong et al., 2024), and show that it is a competitive alternative to the current GAN -focused stream of neural codecs for general full-band audio. Is flowdec a competitive alternative to Gan? We show that FlowDec is a competitive alternative to the recent GAN-dominated stream of neural codecs, achieving FAD scores better than those of the established GAN-based codec DAC and listening test scores that are on par, and producing qualitatively more natural reconstructions for speech and harmonic structures in music. Is flowdec better than scoredec? As the metrics show, FlowDec works significantly better at NFE =6 where ScoreDec and FlowAVSE fail to produce acceptable results, and also generally outperforms ScoreDec at NFE =50. Is flowdec better than DAC? FlowDec is rated on par with DAC (Kumar et al., 2024), with no significant differences between their score distributions at any given bitrate and feature rate. Figure 7: Spectrogram comparison (pre-emphasis of 0.95) of DAC and FlowDec at 7.5 kbit/s for a guitar test audio. FlowDec better preserves harmonics where DAC creates noise-like structures . We further investigate the role of redshift space distortion data sets and find an overall reduction in tension, with a σ8,0subscript𝜎80\\ sigma _{ 8 ,0}italic_σ start_POSTSUBSCRIPT 8 , 0 end_POSTSUBSCRIPTvalue relatively closer to the CMB value ."}
+{"idx": 3, "title": "A arXiv:2503.01485v1 [cs.SD] 3 Mar 2025", "date": "", "ddg_snippet": "Our main model FlowDec - 75m produces the best FAD values by a large margin and also performs best on the SIGMOS OVRL metric. For the intrusive spectral metrics SI-SDR, fwSSNR, and logSpecMSE, retrained DAC generally outperforms FlowDec , though the gap in the perceptually weighted fwSSNR is small.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2503.01485v1", "content": "Our main model FlowDec - 75m produces the best FAD values by a large margin and also performs best on the SIGMOS OVRL metric. For the intrusive spectral metrics SI-SDR, fwSSNR, and logSpecMSE, retrained DAC generally outperforms FlowDec , though the gap in the perceptually weighted fwSSNR is small."}
+{"idx": 4, "title": "RaD-Net 2: A causal two-stage repairing and denoising speech...", "date": "", "ddg_snippet": "Table 1: DNSMOS and SIGMOS scores for the different approaches on the ICASSP 2024 SSI Challenge blind test set.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2406.07498v1", "content": "Table 1: DNSMOS and SIGMOS scores for the different approaches on the ICASSP 2024 SSI Challenge blind test set."}
+{"idx": 5, "title": "Model as Loss: A Self-Consistent Training Paradigm", "date": "", "ddg_snippet": "Models are evaluated using SIGMOS , NISQA v2.0, and ScoreQ (no-reference natural and synthetic MOS) metrics [17, 18, 19] . SIGMOS scores were computed with all enhanced samples normalized to a peak level of -10 dBFS to account for level dependency.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2505.21156v1", "content": "Models are evaluated using SIGMOS , NISQA v2.0, and ScoreQ (no-reference natural and synthetic MOS) metrics [17, 18, 19] . SIGMOS scores were computed with all enhanced samples normalized to a peak level of -10 dBFS to account for level dependency."}
+{"idx": 6, "title": "RaD-Net 2: A causal two-stage repairing and denoising speech...", "date": "", "ddg_snippet": "One TFCM contains 3 depthwise. Table 1: DNSMOS and SIGMOS scores for the different approaches on the ICASSP 2024 SSI Challenge blind test set. The “KDLarge” and “KDNon-causal” denote the knowledge distillation strategy using the large stage one model and the non-causal stage...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2406.07498", "content": "One TFCM contains 3 depthwise. Table 1: DNSMOS and SIGMOS scores for the different approaches on the ICASSP 2024 SSI Challenge blind test set. The “KDLarge” and “KDNon-causal” denote the knowledge distillation strategy using the large stage one model and the non-causal stage..."}
+{"idx": 7, "title": "EARS: An Anechoic Fullband Speech Dataset Benchmarked for...", "date": "", "ddg_snippet": "Table 8 : POLQA for different speaking styles. Mean values . neutral anger desire pain relief.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2406.06185", "content": "Table 8 : POLQA for different speaking styles. Mean values . neutral anger desire pain relief."}
+{"idx": 8, "title": "[1803.01337] Evolution of the $fσ_8$ tension with the ...", "date": "", "ddg_snippet": "Mar 4, 2018 · We show that the tension disappears (becomes less than $1\\ sigma $) when a subsample of the 20 most recently published data is used. A partial cause for this reduced tension is the fact that more recent data tend to probe higher redshifts (with higher errorbars) where there is degeneracy among different models due to matter domination.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/1803.01337", "content": "Mar 4, 2018 · We show that the tension disappears (becomes less than $1\\ sigma $) when a subsample of the 20 most recently published data is used. A partial cause for this reduced tension is the fact that more recent data tend to probe higher redshifts (with higher errorbars) where there is degeneracy among different models due to matter domination."}
+{"idx": 9, "title": "Testing Planck 2020 and DESI data on wCDM Models", "date": "", "ddg_snippet": "Jul 15, 2025 · This work delves into the dynamical dark energy models of the wCDM parameterisation that are defined by their equation of state by comparing different, well-known parameterisation models, in an attempt to lessen the tensions of {H_0} and {\\ sigma _ 8 } by using the latest observational data.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2507.11237v3", "content": "Jul 15, 2025 · This work delves into the dynamical dark energy models of the wCDM parameterisation that are defined by their equation of state by comparing different, well-known parameterisation models, in an attempt to lessen the tensions of {H_0} and {\\ sigma _ 8 } by using the latest observational data."}

data/sampled_jsons/GTA_Greedy_Task_Allocation_strategy_distributed_machine_learning_workers_tasks.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "cherryATA: cherryAdaptive cherryTask cherryAllocation for Efficient...", "date": "", "ddg_snippet": "ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2502.00775", "content": "ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning ."}
+{"idx": 1, "title": "(PDF) Multiagent task allocation in social networks", "date": "", "ddg_snippet": "Algorithm 1 Centralized greedy task allocation algorithm ( GTA ).Firstly, the task allocation is modeled as a dynamic programming problem of multi-objective optimization, which aims to maximize the benefits of workers and platform.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/220660650_Multiagent_task_allocation_in_social_networks", "content": "Algorithm 1 Centralized greedy task allocation algorithm ( GTA ).Firstly, the task allocation is modeled as a dynamic programming problem of multi-objective optimization, which aims to maximize the benefits of workers and platform."}
+{"idx": 2, "title": "Multiagent task allocation in social networks", "date": "", "ddg_snippet": "Keywords Task allocation · Social networks · Resource allocation · Distributed algorithm · Mechanism design.A greedy algorithm ranks tasks with respect to some measure expressing how promising a task is, and then tries to allocate tasks in the order of their ranking.", "subpage_snippet": "", "source": "pure.tue.nl", "link": "https://pure.tue.nl/ws/files/15930213/WeerdtMultiagent2012.pdf", "content": "Keywords Task allocation · Social networks · Resource allocation · Distributed algorithm · Mechanism design.A greedy algorithm ranks tasks with respect to some measure expressing how promising a task is, and then tries to allocate tasks in the order of their ranking."}
+{"idx": 3, "title": "GitHub - alevani/master_project: Ant-Inspired Task Allocation Model...", "date": "", "ddg_snippet": "Investigation: An Ant-Inspired Task Allocation Model With a Near-Optimal Distribution of Labor for Swarms of Robots.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/alevani/master_project", "content": "Investigation: An Ant-Inspired Task Allocation Model With a Near-Optimal Distribution of Labor for Swarms of Robots."}
+{"idx": 4, "title": "CMC | Free Full-Text | Mobile Crowdsourcing Task Allocation Based...", "date": "", "ddg_snippet": "This strategy enhances the autoencoder’s ability to learn the distribution of the original data more effectively. The second part focuses on the matching process between workers and tasks . The paper transforms task allocation into bipartite graph matching.", "subpage_snippet": "", "source": "www.techscience.com", "link": "https://www.techscience.com/cmc/v79n1/56301/html", "content": "This strategy enhances the autoencoder’s ability to learn the distribution of the original data more effectively. The second part focuses on the matching process between workers and tasks . The paper transforms task allocation into bipartite graph matching."}
+{"idx": 5, "title": "Distributed Algorithm with Resilience for Multi-Agent Task Allocation ...", "date": "", "ddg_snippet": "Greedy Decentralized Auction-based Task Allocation for Multi-Agent Systems. Distributed Strategy Adaptation with a Prediction Function in Multi-Agent Task Allocation .", "subpage_snippet": "", "source": "scispace.com", "link": "https://scispace.com/papers/distributed-algorithm-with-resilience-for-multi-agent-task-ns8sbtpnld", "content": "Greedy Decentralized Auction-based Task Allocation for Multi-Agent Systems. Distributed Strategy Adaptation with a Prediction Function in Multi-Agent Task Allocation ."}
+{"idx": 6, "title": "Method and algorithm for task allocation in a heterogeneous group of...", "date": "", "ddg_snippet": "greedy task allocation algorithm and modication due to versa-tility (Romeijn and Romero Morales, 2000) (2000 u.)UAV motion strategies in uncertain dynamic environments: a path planning method based on Q- learning strategy .", "subpage_snippet": "", "source": "elib.bsu.by", "link": "https://elib.bsu.by/bitstream/123456789/305588/1/1-s2.0-S1319157823001349-main.pdf", "content": "greedy task allocation algorithm and modication due to versa-tility (Romeijn and Romero Morales, 2000) (2000 u.)UAV motion strategies in uncertain dynamic environments: a path planning method based on Q- learning strategy ."}
+{"idx": 7, "title": "A Distributed Allocation Strategy for Data Mining Tasks in Mobile...", "date": "", "ddg_snippet": "3 Distributed Task Allocation Strategy . The energy-aware (EA) scheduling strategy deals with a set of independent data mining tasks , dynamically generated over time, which have to be allocated over mobile nodes organized into the cluster-based architecture introduced earlier.", "subpage_snippet": "", "source": "scalab.dimes.unical.it", "link": "https://scalab.dimes.unical.it/papers/pdf/IDC2012.pdf", "content": "3 Distributed Task Allocation Strategy . The energy-aware (EA) scheduling strategy deals with a set of independent data mining tasks , dynamically generated over time, which have to be allocated over mobile nodes organized into the cluster-based architecture introduced earlier."}
+{"idx": 8, "title": "A Distributed Solution to the Multi-robot Task Allocation ... | CoLab", "date": "", "ddg_snippet": "The multi-robot task allocation problem is a very active search field in autonomous multi-robot systems. It consists of three elements: (i) a set of tasks requiring some supports, (ii) a set of robots offering some supports and (iii) an objective function.", "subpage_snippet": "", "source": "colab.ws", "link": "https://colab.ws/articles/10.1007/978-981-15-5243-4_44", "content": "The multi-robot task allocation problem is a very active search field in autonomous multi-robot systems. It consists of three elements: (i) a set of tasks requiring some supports, (ii) a set of robots offering some supports and (iii) an objective function."}
+{"idx": 9, "title": "ATA: Adaptive Task Allocation", "date": "", "ddg_snippet": "ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning .", "subpage_snippet": "", "source": "artomaranjyan.github.io", "link": "https://artomaranjyan.github.io/assets/pdf/posters/ATA_SNSL.pdf", "content": "ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning ."}

data/sampled_jsons/GTA_is_the_fastest_in_terms_of_runtime_but_it_performs_poorly_in_terms_of_total_worker_time_ATA_pape.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "ATA: Adaptive Task Allocation for Efficient Resource ...", "date": "", "ddg_snippet": "2 Feb 2025 — As expected, GTA is the fastest in terms of runtime (first column), but it performs poorly in terms of total worker time (second column).", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2502.00775v1", "content": "2 Feb 2025 — As expected, GTA is the fastest in terms of runtime (first column), but it performs poorly in terms of total worker time (second column)."}
+{"idx": 1, "title": "ATA: Adaptive Task Allocation for Efficient Resource ...", "date": "", "ddg_snippet": "As expected, GTA is the fastest in terms of runtime (first column), but it performs poorly in terms of total worker time (second column). This is because it ...", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/46650", "content": "As expected, GTA is the fastest in terms of runtime (first column), but it performs poorly in terms of total worker time (second column). This is because it ..."}
+{"idx": 2, "title": "ATA: Adaptive Task Allocation for Efficient Resource ...", "date": "", "ddg_snippet": "18 Jun 2025 — We introduce ATA (Adaptive Task Allocation), a method that learns how fast each machine is over time and adapts the task assignment accordingly.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=1BaC3AdG1i&noteId=hkH8Wi9zZm", "content": "18 Jun 2025 — We introduce ATA (Adaptive Task Allocation), a method that learns how fast each machine is over time and adapts the task assignment accordingly."}
+{"idx": 3, "title": "Do any compilers choose and optimize data structures ...", "date": "", "ddg_snippet": "The compiler is free to choose any data structure instead of a specific collection, like a Vec, a HashSet, or TreeSet.", "subpage_snippet": "", "source": "www.reddit.com", "link": "https://www.reddit.com/r/ProgrammingLanguages/comments/1l2j5e0/do_any_compilers_choose_and_optimize_data/", "content": "The compiler is free to choose any data structure instead of a specific collection, like a Vec, a HashSet, or TreeSet."}
+{"idx": 4, "title": "Real-Time Immunosensor for Small-Molecule Monitoring in ...", "date": "", "ddg_snippet": "by C Vu · 2023 · Cited by 17 — We describe a generalizable methodology to develop affinity-based biosensors for the continuous monitoring of small molecules in industrial food processes.", "subpage_snippet": "", "source": "pmc.ncbi.nlm.nih.gov", "link": "https://pmc.ncbi.nlm.nih.gov/articles/PMC10209984/", "content": "by C Vu · 2023 · Cited by 17 — We describe a generalizable methodology to develop affinity-based biosensors for the continuous monitoring of small molecules in industrial food processes."}
+{"idx": 5, "title": "arXiv:2301.11233v2 [cs.CV] 20 May 2023", "date": "", "ddg_snippet": "by H Qin · 2023 · Cited by 62 — This paper presents BiBench, a network binarization benchmark designed to evaluate binarization algorithms comprehensively in terms of accuracy ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2301.11233", "content": "by H Qin · 2023 · Cited by 62 — This paper presents BiBench, a network binarization benchmark designed to evaluate binarization algorithms comprehensively in terms of accuracy ..."}
+{"idx": 6, "title": "Stochastic variational variable selection for high ...", "date": "", "ddg_snippet": "by T Dang · 2021 · Cited by 9 — Conclusions SVVS demonstrated a better performance and significantly faster computation than those of the existing methods in all cases of ...", "subpage_snippet": "", "source": "www.biorxiv.org", "link": "https://www.biorxiv.org/content/10.1101/2021.10.04.462986v2.full-text", "content": "by T Dang · 2021 · Cited by 9 — Conclusions SVVS demonstrated a better performance and significantly faster computation than those of the existing methods in all cases of ..."}
+{"idx": 7, "title": "Protocol: A Multiplexed Reporter Assay to Study Effects ...", "date": "", "ddg_snippet": "by R Schep · 2022 · Cited by 7 — Here we present a step-by-step protocol to perform DSB-TRIP in K562 cells and to analyse the data by a dedicated computational pipeline. We ...", "subpage_snippet": "", "source": "pmc.ncbi.nlm.nih.gov", "link": "https://pmc.ncbi.nlm.nih.gov/articles/PMC8842231/", "content": "by R Schep · 2022 · Cited by 7 — Here we present a step-by-step protocol to perform DSB-TRIP in K562 cells and to analyse the data by a dedicated computational pipeline. We ..."}
+{"idx": 8, "title": "Accelerated Systems for Pattern Matching", "date": "", "ddg_snippet": "by A Subramaniyan · 2021 — and GPUs, however perform poorly on pattern matching tasks that are typically characterized by irregular memory accesses and input-dependent control flow.", "subpage_snippet": "", "source": "deepblue.lib.umich.edu", "link": "https://deepblue.lib.umich.edu/bitstream/handle/2027.42/171324/arunsub_1.pdf?sequence=1", "content": "by A Subramaniyan · 2021 — and GPUs, however perform poorly on pattern matching tasks that are typically characterized by irregular memory accesses and input-dependent control flow."}
+{"idx": 9, "title": "Track: Poster Session 4 - CVPR", "date": "", "ddg_snippet": "14 Jun 2025 — This paper presents MobilePortrait, a lightweight one-shot neural head avatars method that reduces learning complexity by integrating external ...", "subpage_snippet": "", "source": "cvpr.thecvf.com", "link": "https://cvpr.thecvf.com/virtual/2025/session/35268", "content": "14 Jun 2025 — This paper presents MobilePortrait, a lightweight one-shot neural head avatars method that reduces learning complexity by integrating external ..."}