Add files using upload-large-folder tool

data/sampled_jsons/0hrkN07DuO_Linear_convergence_of_Sinkhorn's_algorithm_for_generalized_static_Schrödinger_bridge_Equa_year_2023.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "On the Convergence Rate of Sinkhorn's Algorithm", "date": "", "ddg_snippet": "Since this paper was completed, several results on Sinkhorn’s algorithm have been obtained, tackling some of the aforementioned issues. For quadratic cost and unbounded continuous marginals satisfying a log-concavity condi-tion, [20] proves linear convergence based on a fine analysis of the gradients of Schrödinger potentials and Sinkhorn ...", "subpage_snippet": "", "source": "www.math.columbia.edu", "link": "https://www.math.columbia.edu/~mnutz/docs/Sinkhorn_rate.pdf", "content": "Since this paper was completed, several results on Sinkhorn’s algorithm have been obtained, tackling some of the aforementioned issues. For quadratic cost and unbounded continuous marginals satisfying a log-concavity condi-tion, [20] proves linear convergence based on a fine analysis of the gradients of Schrödinger potentials and Sinkhorn ..."}
+{"idx": 1, "title": "On the Convergence Rate of Sinkhorn’s AlgorithmThe authors ...", "date": "", "ddg_snippet": "Since this paper was completed, several results on Sinkhorn’s algorithm have been obtained, tackling some of the aforementioned issues. For quadratic cost and unbounded continuous marginals satisfying a log-concavity condition, [20]proves linear convergence based on a fine analysis of the gradients of Schrödinger potentials and Sinkhorn ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2212.06000v2", "content": "Since this paper was completed, several results on Sinkhorn’s algorithm have been obtained, tackling some of the aforementioned issues. For quadratic cost and unbounded continuous marginals satisfying a log-concavity condition, [20]proves linear convergence based on a fine analysis of the gradients of Schrödinger potentials and Sinkhorn ..."}
+{"idx": 2, "title": "Linear convergence of Sinkhorn's algorithm for generalized ...", "date": "", "ddg_snippet": "Poster Linear convergence of Sinkhorn's algorithm for generalized static Schrödinger bridge Rahul Choudhary · Hanbaek Lyu West Exhibition Hall B2-B3 #W-506", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/46671", "content": "Poster Linear convergence of Sinkhorn's algorithm for generalized static Schrödinger bridge Rahul Choudhary · Hanbaek Lyu West Exhibition Hall B2-B3 #W-506"}
+{"idx": 3, "title": "Linear Convergence of Sinkhorn’s Algorithm for Generalized ...", "date": "", "ddg_snippet": "In this paper, we present the generalized static Schrödinger bridge problem, establish its Kantorovich dual, and show that the associated generalized Sinkhorn algorithm con-verges linearly in a dimension independent manner under mild assumptions on the general divergence functional f , weight matrix W and margin (r,c).", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=0hrkN07DuO", "content": "In this paper, we present the generalized static Schrödinger bridge problem, establish its Kantorovich dual, and show that the associated generalized Sinkhorn algorithm con-verges linearly in a dimension independent manner under mild assumptions on the general divergence functional f , weight matrix W and margin (r,c)."}
+{"idx": 4, "title": "Onthelinearconvergenceofthe multi-marginalSinkhornalgorithm", "date": "", "ddg_snippet": "The aim of this short note is to give an elementary proof of linear convergence of the Sinkhorn algorithm for the entropic regularization of multi-marginal optimal transport. The proof simply relies on: i) the fact that Sinkhorn iterates are bounded, ii) strong convexity of the exponential on bounded intervals and iii) the convergence analysis of the coordinate descent (Gauss-Seidel) method of ...", "subpage_snippet": "", "source": "www.mathtube.org", "link": "https://www.mathtube.org/sites/default/files/lecture-extra-files/linear-sinkhorn.pdf", "content": "The aim of this short note is to give an elementary proof of linear convergence of the Sinkhorn algorithm for the entropic regularization of multi-marginal optimal transport. The proof simply relies on: i) the fact that Sinkhorn iterates are bounded, ii) strong convexity of the exponential on bounded intervals and iii) the convergence analysis of the coordinate descent (Gauss-Seidel) method of ..."}
+{"idx": 5, "title": "On the Linear Convergence of the Multimarginal Sinkhorn Algorithm", "date": "", "ddg_snippet": "The aim of this note is to give an elementary proof of linear convergence of the Sinkhorn algorithm for the entropic regularization of multimarginal optimal transport in the setting of general probability spaces. The proof simply relies on (i) the fact that Sinkhorn iterates are bounded, (ii) the strong convexity of the exponential on bounded intervals, and (iii) the convergence analysis of ...", "subpage_snippet": "", "source": "epubs.siam.org", "link": "https://epubs.siam.org/doi/10.1137/21M1410634", "content": "The aim of this note is to give an elementary proof of linear convergence of the Sinkhorn algorithm for the entropic regularization of multimarginal optimal transport in the setting of general probability spaces. The proof simply relies on (i) the fact that Sinkhorn iterates are bounded, (ii) the strong convexity of the exponential on bounded intervals, and (iii) the convergence analysis of ..."}
+{"idx": 6, "title": "Sharper exponential convergence rates for Sinkhorn ’ s algorithm in...", "date": "", "ddg_snippet": "We study the convergence rate of Sinkhorn ’ s algorithm for solving entropy-regularized optimal transport problems when at least one of the probability.", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/article/10.1007/s10107-025-02242-z", "content": "We study the convergence rate of Sinkhorn ’ s algorithm for solving entropy-regularized optimal transport problems when at least one of the probability."}
+{"idx": 7, "title": "A survey of the Schrödinger problem and some of its connections with...", "date": "", "ddg_snippet": "A second order equation for Schrödinger bridges with applications to the hot gas experiment and entropic transportation cost[J]. Probability Theory and Related Fields, 2019, 174(0178-8051): 1. doi: 10.1007/ s 00440-018-0856-7.", "subpage_snippet": "", "source": "www.aimsciences.org", "link": "https://www.aimsciences.org/article/doi/10.3934/dcds.2014.34.1533", "content": "A second order equation for Schrödinger bridges with applications to the hot gas experiment and entropic transportation cost[J]. Probability Theory and Related Fields, 2019, 174(0178-8051): 1. doi: 10.1007/ s 00440-018-0856-7."}
+{"idx": 8, "title": "Stability of Schrödinger potentials and convergence of ... | CoLab", "date": "", "ddg_snippet": "As an application, we show convergence of Sinkhorn ' s algorithm in Wasserstein sense, including for quadratic cost.The aim of this short note is to give an elementary proof of linear convergence of the Sinkhorn algorithm for the entropic regularization of multi-marginal optimal transport.", "subpage_snippet": "", "source": "colab.ws", "link": "https://colab.ws/articles/10.1214/22-aop1611", "content": "As an application, we show convergence of Sinkhorn ' s algorithm in Wasserstein sense, including for quadratic cost.The aim of this short note is to give an elementary proof of linear convergence of the Sinkhorn algorithm for the entropic regularization of multi-marginal optimal transport."}
+{"idx": 9, "title": "Tree-Based Diffusion Schrödinger Bridge with Applications to...", "date": "", "ddg_snippet": "General experimental setup. Details on the experiments. Tree-Based Diffusion Schrödinger Bridge with Applications to Wasserstein Barycenters.Carlier, G. On the linear convergence of the multimarginal Sinkhorn algorithm . SIAM Journal on Optimization, 32(2):786–794, 2022.", "subpage_snippet": "", "source": "hal.science", "link": "https://hal.science/hal-04402356/document", "content": "General experimental setup. Details on the experiments. Tree-Based Diffusion Schrödinger Bridge with Applications to Wasserstein Barycenters.Carlier, G. On the linear convergence of the multimarginal Sinkhorn algorithm . SIAM Journal on Optimization, 32(2):786–794, 2022."}

data/sampled_jsons/13.66_EventPS_MAE_average_MAE_3D_printed_objects.jsonl

@@ -0,0 +1,3 @@
+{"idx": 0, "title": "(PDF) What Is Learned in Deep Uncalibrated Photometric Stereo?", "date": "", "ddg_snippet": "PF14 ( MAE : 33.22, relative error: 0.223). Figures 6 (a)-(b) visualize the light-. ing estimation results for the Pot1 and the Goblet.However, EventPS treats each event interval independently, making it sensitive to noise, shadows, and non-Lambertian reflections.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/346874574_What_Is_Learned_in_Deep_Uncalibrated_Photometric_Stereo", "content": "PF14 ( MAE : 33.22, relative error: 0.223). Figures 6 (a)-(b) visualize the light-. ing estimation results for the Pot1 and the Goblet.However, EventPS treats each event interval independently, making it sensitive to noise, shadows, and non-Lambertian reflections."}
+{"idx": 1, "title": "How to get velocity and position for each node when... | ResearchGate", "date": "", "ddg_snippet": "base_rfr_ mae = mean_absolute_error(test_y, base_rfr_pred).Then I fit the \"best parameters\" obtained to get an optimized MAE but the results are always worse than the base model MAE (opt rfr for image).", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/post/how_to_get_velocity_and_position_for_each_node_when_they_move_in_ns3_vanet_scenario", "content": "base_rfr_ mae = mean_absolute_error(test_y, base_rfr_pred).Then I fit the \"best parameters\" obtained to get an optimized MAE but the results are always worse than the base model MAE (opt rfr for image)."}
+{"idx": 2, "title": "", "date": "", "ddg_snippet": "", "subpage_snippet": "", "source": "", "link": "", "content": ""}

data/sampled_jsons/1BaC3AdG1i_ATA-_Adaptive_Task_Allocation_for_Efficient_Resource_Management_in_Distributed_Machine_Le.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "ATA: Adaptive Task Allocation for Efficient Resource ...", "date": "", "ddg_snippet": "Feb 2, 2025 · The challenge lies in achieving this optimal allocation without prior knowledge of the computation time distributions. In this paper, we propose ATA ( Adaptive Task Allocation ), a method that adapts to heterogeneous and random distributions of worker computation times.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2502.00775", "content": "Feb 2, 2025 · The challenge lies in achieving this optimal allocation without prior knowledge of the computation time distributions. In this paper, we propose ATA ( Adaptive Task Allocation ), a method that adapts to heterogeneous and random distributions of worker computation times."}
+{"idx": 1, "title": "ATA: Adaptive Task Allocation for Efficient Resource ...", "date": "", "ddg_snippet": "May 1, 2025 · 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 ATA identifies the optimal task allocation and performs comparably to methods with prior knowledge of computation times.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=1BaC3AdG1i", "content": "May 1, 2025 · 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 ATA identifies the optimal task allocation and performs comparably to methods with prior knowledge of computation times."}
+{"idx": 2, "title": "ATA: Adaptive Task Allocation for Eficient Resource ...", "date": "", "ddg_snippet": "Through rigorous theoretical analysis, we show that ATA identifies the optimal task allocation and performs comparably to meth-ods with prior knowledge of computation times.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2502.00775", "content": "Through rigorous theoretical analysis, we show that ATA identifies the optimal task allocation and performs comparably to meth-ods with prior knowledge of computation times."}
+{"idx": 3, "title": "ATA: Adaptive Task Allocation for Efficient Resource ...", "date": "", "ddg_snippet": "In this work, we formalize the task allocation problem as a combinatorial online learning problem with partial feedback and non-linear losses. Then, we introduce ATA , a lower-confidence bound-based algorithm designed to solve the proposed allocation problem.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2502.00775v2", "content": "In this work, we formalize the task allocation problem as a combinatorial online learning problem with partial feedback and non-linear losses. Then, we introduce ATA , a lower-confidence bound-based algorithm designed to solve the proposed allocation problem."}
+{"idx": 4, "title": "Adaptive and Efficient Resource Allocation in Cloud ...", "date": "", "ddg_snippet": "Dec 3, 2021 · The ever-expanding scale of cloud datacenters necessitates automated resource provisioning to best meet the requirements of low latency and high energy-efficiency. However, due to the dynamic system states and various user demands, efficient resource allocation in cloud faces huge challenges.", "subpage_snippet": "", "source": "ieeexplore.ieee.org", "link": "https://ieeexplore.ieee.org/document/9635652", "content": "Dec 3, 2021 · The ever-expanding scale of cloud datacenters necessitates automated resource provisioning to best meet the requirements of low latency and high energy-efficiency. However, due to the dynamic system states and various user demands, efficient resource allocation in cloud faces huge challenges."}
+{"idx": 5, "title": "[PDF] ATA: Adaptive Task Allocation for Efficient Resource ...", "date": "", "ddg_snippet": "The challenge lies in achieving this optimal allocation without prior knowledge of the computation time distributions. In this paper, we propose ATA ( Adaptive Task Allocation ), a method that adapts to heterogeneous and random distributions of worker computation times.", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/ATA:-Adaptive-Task-Allocation-for-Efficient-in-Maranjyan-Saad/871e17b70c5c31985b6ecb1d61960ad5ee7d1cbd", "content": "The challenge lies in achieving this optimal allocation without prior knowledge of the computation time distributions. In this paper, we propose ATA ( Adaptive Task Allocation ), a method that adapts to heterogeneous and random distributions of worker computation times."}
+{"idx": 6, "title": "ATA : Adaptive Task Allocation for Efficient Resource Management ...", "date": "", "ddg_snippet": "In this paper, we propose ATA ( Adaptive Task Allocation ), a method that adapts to heterogeneous and random distributions of worker computation times.", "subpage_snippet": "", "source": "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."}
+{"idx": 7, "title": "ATA : Adaptive Task Allocation", "date": "", "ddg_snippet": "ATA : Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning . distributed ML training. # Tasks : Computation.", "subpage_snippet": "", "source": "artomaranjyan.github.io", "link": "https://artomaranjyan.github.io/assets/pdf/posters/ATA_ICML.pdf", "content": "ATA : Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning . distributed ML training. # Tasks : Computation."}
+{"idx": 8, "title": "Quantum Inspired Adaptive Resource Management Algorithm for...", "date": "", "ddg_snippet": "Quantum-inspired adaptive Resource Management switches on quite a new conceptual framework toward optimized resource allocation in fog computing environments.", "subpage_snippet": "", "source": "www.sciopen.com", "link": "https://www.sciopen.com/article/10.32604/cmes.2025.060973", "content": "Quantum-inspired adaptive Resource Management switches on quite a new conceptual framework toward optimized resource allocation in fog computing environments."}
+{"idx": 9, "title": "Joint Task and Resource Allocation for Mobile Edge Learning (2020)", "date": "", "ddg_snippet": "We then employ numerical solvers to efficiently solve this simplified problem. Simulation results show gains up to 166% and 250% compared to the task allocation only and the resource allocation only techniques, respectively.", "subpage_snippet": "", "source": "scispace.com", "link": "https://scispace.com/papers/joint-task-and-resource-allocation-for-mobile-edge-learning-10hpi1t00k", "content": "We then employ numerical solvers to efficiently solve this simplified problem. Simulation results show gains up to 166% and 250% compared to the task allocation only and the resource allocation only techniques, respectively."}

data/sampled_jsons/2111.03980_arxiv_abstract.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "[ 2111 . 03980 ] Dynamic Algorithms Against an Adaptive Adversary...", "date": "", "ddg_snippet": "Abstract :A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm.(or arXiv : 2111 . 03980 v1 [cs.DS] for this version).", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2111.03980", "content": "Abstract :A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm.(or arXiv : 2111 . 03980 v1 [cs.DS] for this version)."}
+{"idx": 1, "title": "ash001/ arxiv - abstract · Datasets at Hugging Face", "date": "", "ddg_snippet": "/ arxiv - abstract .", "subpage_snippet": "", "source": "huggingface.co", "link": "https://huggingface.co/datasets/ash001/arxiv-abstract", "content": "/ arxiv - abstract ."}
+{"idx": 2, "title": "Dynamic Algorithms Against an Adaptive Adversary", "date": "", "ddg_snippet": "arXiv : 2111 . 03980 v1 [cs.DS] 7 Nov 2021. Abstract . A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2111.03980", "content": "arXiv : 2111 . 03980 v1 [cs.DS] 7 Nov 2021. Abstract . A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm."}
+{"idx": 3, "title": "Revenue Maximization for Buyers with Costly Participation", "date": "", "ddg_snippet": "Abstract . We study mechanisms for selling a single item when buyers have private costs for participating in the mechanism.Sergiu Hart & Noam Nisan, 2012. \"Approximate Revenue Maximization with Multiple Items,\" Papers 1204.1846, arXiv .org, revised Dec 2017.", "subpage_snippet": "", "source": "ideas.repec.org", "link": "https://ideas.repec.org/p/arx/papers/2103.03980.html", "content": "Abstract . We study mechanisms for selling a single item when buyers have private costs for participating in the mechanism.Sergiu Hart & Noam Nisan, 2012. \"Approximate Revenue Maximization with Multiple Items,\" Papers 1204.1846, arXiv .org, revised Dec 2017."}
+{"idx": 4, "title": "Faster maxflow via improved dynamic spectral vertex sparsifiers", "date": "", "ddg_snippet": "Abstract . We make several advances broadly related to the maintenance of electrical flows in weighted graphs undergoing dynamic resistance updates, including: (1) More efficient dynamic spectral vertex sparsification, achieved by faster lengthCoRR, abs/ 2111 . 03980 (2021).", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/10.1145/3519935.3520068?cookieSet=1", "content": "Abstract . We make several advances broadly related to the maintenance of electrical flows in weighted graphs undergoing dynamic resistance updates, including: (1) More efficient dynamic spectral vertex sparsification, achieved by faster lengthCoRR, abs/ 2111 . 03980 (2021)."}
+{"idx": 5, "title": "Валентин Сидоров Про Женщин На Экскурсии В Питере | TikTok", "date": "", "ddg_snippet": "оригинальный звук - Валентин Сидоров. 2111. Лайки.", "subpage_snippet": "", "source": "www.tiktok.com", "link": "https://www.tiktok.com/discover/валентин-сидоров-про-женщин-на-экскурсии-в-питере", "content": "оригинальный звук - Валентин Сидоров. 2111. Лайки."}
+{"idx": 6, "title": "ORCID", "date": "", "ddg_snippet": "ARXIV : 2306.16227. Contributors : J Antoniadis; P Arumugam; S Arumugam; P Auclair; S Babak; M Bagchi; A.-S Bak Nielsen; E Barausse; C.G Bassa; A Bathula et al.", "subpage_snippet": "", "source": "orcid.org", "link": "https://orcid.org/0000-0001-7469-4250", "content": "ARXIV : 2306.16227. Contributors : J Antoniadis; P Arumugam; S Arumugam; P Auclair; S Babak; M Bagchi; A.-S Bak Nielsen; E Barausse; C.G Bassa; A Bathula et al."}
+{"idx": 7, "title": "The Target-Charging Technique", "date": "", "ddg_snippet": "CoRR, abs/ 2111 . 03980 , 2021. [3] Mark Bun, Thomas Steinke, and Jonathan Ullman. Make Up Your Mind: The Price of Online Queries in Differential Privacy, pages 1306–1325.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=7yjsYrajlt", "content": "CoRR, abs/ 2111 . 03980 , 2021. [3] Mark Bun, Thomas Steinke, and Jonathan Ullman. Make Up Your Mind: The Price of Online Queries in Differential Privacy, pages 1306–1325."}
+{"idx": 8, "title": "Создай скроллинг текст онлайн — «ТЫ САМЫЙ ЛУТШИЙ...»", "date": "", "ddg_snippet": "...03980 ты самый лутший человек в моей жизни я люблю тебя 03981 ты самый лутший человек.", "subpage_snippet": "", "source": "vladpetrov.me", "link": "https://vladpetrov.me/ru/scrolling-text?text=0KLQqyDQodCQ0JzQq9CZINCb0KPQotCo0JjQmSDQp9CV0JvQntCS0JXQmiDQkiDQnNCe0JXQmSDQltCY0JfQndCYINCvINCb0K7QkdCb0K4g0KLQldCR0K8=&template=column&count=10000&numbers=true", "content": "...03980 ты самый лутший человек в моей жизни я люблю тебя 03981 ты самый лутший человек."}
+{"idx": 9, "title": "Глава 6420. Шокирующие изменения, запечатывание входа...", "date": "", "ddg_snippet": "Можешь только ждать смерти Глава 2113. Царство Богов Глава 2112. Исход битвы Глава 2111. Невероятно Глава 2110. Смотри на своё исполнение Глава 2109.", "subpage_snippet": "", "source": "ifreedom.su", "link": "https://ifreedom.su/voinstvennyj-bog-asura-2/glava-6420-shokiruyushhie-izmeneniya-zapechatyvanie-vhoda/", "content": "Можешь только ждать смерти Глава 2113. Царство Богов Глава 2112. Исход битвы Глава 2111. Невероятно Глава 2110. Смотри на своё исполнение Глава 2109."}

data/sampled_jsons/2212.08420_Sarıyıldız_ImageNet-100_results.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "GitHub | ImageNet - 100 -Pytorch/generate_IN100.py at Main...", "date": "", "ddg_snippet": "Use saved searches to filter your results more quickly.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/danielchyeh/ImageNet-100-Pytorch/blob/main/generate_IN100.py", "content": "Use saved searches to filter your results more quickly."}
+{"idx": 1, "title": "ImageNet - 100 (GCD Split) Dataset | Papers With Code", "date": "", "ddg_snippet": "This ImageNet - 100 dataset was introduced in the following paper, Vaze, S., Han, K., Vedaldi, A. and Zisserman, A., 2022.", "subpage_snippet": "", "source": "paperswithcode.com", "link": "https://paperswithcode.com/dataset/imagenet-100-gcd-split", "content": "This ImageNet - 100 dataset was introduced in the following paper, Vaze, S., Han, K., Vedaldi, A. and Zisserman, A., 2022."}
+{"idx": 2, "title": "ImageNet 100 | Kaggle", "date": "", "ddg_snippet": "A Sample of ImageNet Classes...", "subpage_snippet": "", "source": "www.kaggle.com", "link": "https://www.kaggle.com/datasets/ambityga/imagenet100?resource=download-directory&select=val.X", "content": "A Sample of ImageNet Classes..."}
+{"idx": 3, "title": "Example Retrieval Results for HBMP and MIHash on ImageNet 100 .", "date": "", "ddg_snippet": "... Fig. 4, we present example retrieval results for HBMP and MIHash for several image queries from the ImageNet 100 dataset.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/figure/Example-retrieval-results-for-HBMP-and-MIHash-on-ImageNet100-In-all-the-queries-HBMP_fig2_326851596", "content": "... Fig. 4, we present example retrieval results for HBMP and MIHash for several image queries from the ImageNet 100 dataset."}
+{"idx": 4, "title": "Worse results by reproducing MoCo, InsDIS and CMC on ImageNet 100", "date": "", "ddg_snippet": "I can see several gaps as below, which apply to all MoCo, InsDis, and CMC: (1) For pre-training on ImageNet 100 , use batch_size 128 instead of 256.", "subpage_snippet": "", "source": "githubissues.com", "link": "https://githubissues.com/HobbitLong/CMC/28", "content": "I can see several gaps as below, which apply to all MoCo, InsDis, and CMC: (1) For pre-training on ImageNet 100 , use batch_size 128 instead of 256."}
+{"idx": 5, "title": "ImageNet", "date": "", "ddg_snippet": "The most highly-used subset of ImageNet is the ImageNet Large Scale Visual Recognition Challenge (ILSVRC) 2012-2017 image classification and localization dataset.", "subpage_snippet": "", "source": "image-net.org", "link": "https://image-net.org/download.php", "content": "The most highly-used subset of ImageNet is the ImageNet Large Scale Visual Recognition Challenge (ILSVRC) 2012-2017 image classification and localization dataset."}
+{"idx": 6, "title": "NEW Classification Datasets: `Imagenet10`, ` Imagenet 100 ... | GitL...", "date": "", "ddg_snippet": "These are super small versions of imagenet that train/val in seconds with only 1 image per class (with all 1000 classes, only 100 classes, and only 10 classes).", "subpage_snippet": "", "source": "gitlab.com", "link": "https://gitlab.com/ultralytics/yolov3/-/issues/2022", "content": "These are super small versions of imagenet that train/val in seconds with only 1 image per class (with all 1000 classes, only 100 classes, and only 10 classes)."}
+{"idx": 7, "title": "[ 2212 . 08420 ] Fake it Till You Make it: Learning Transferable...", "date": "", "ddg_snippet": "Abstract:Recent image generation models such as Stable Diffusion have exhibited an impressive ability to generate fairly realistic images starting from a simple text prompt.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2212.08420", "content": "Abstract:Recent image generation models such as Stable Diffusion have exhibited an impressive ability to generate fairly realistic images starting from a simple text prompt."}
+{"idx": 8, "title": "Lose INNER & OUTER Thighs Fat in 14 Days ( 100 % Visible Result )...", "date": "", "ddg_snippet": "#legworkout #homeworkout #loseweight This workout is designed to reduce your thighs size, burn legs fat (inner & Outer) and tone up of glute. No equipment ne...", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=MO3lH9QzfqI", "content": "#legworkout #homeworkout #loseweight This workout is designed to reduce your thighs size, burn legs fat (inner & Outer) and tone up of glute. No equipment ne..."}
+{"idx": 9, "title": "Free AI Video Face Swap Online (No Signup, No Limits)", "date": "", "ddg_snippet": "So easy to use and the results are super realistic.", "subpage_snippet": "", "source": "arting.ai", "link": "https://arting.ai/video-face-swap", "content": "So easy to use and the results are super realistic."}

data/sampled_jsons/2403.07932_Feint_Behaviors_scheduler_Section_4.2.2.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Abstract page for arXiv paper 2403 . 07932 : Feint in Multi-Player Games", "date": "", "ddg_snippet": "Our work first formalizes Feint from the perspective of Multi-Player Games, in terms of the temporal, spatial, and their collective impacts. The formalization is built upon Non-transitive Active Markov Game Model, where Feint can have a considerable amount of impacts.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2403.07932", "content": "Our work first formalizes Feint from the perspective of Multi-Player Games, in terms of the temporal, spatial, and their collective impacts. The formalization is built upon Non-transitive Active Markov Game Model, where Feint can have a considerable amount of impacts."}
+{"idx": 1, "title": "Feint Behaviors and Strategies: Formalization, Implementation and...", "date": "", "ddg_snippet": "The figure illustrates three ways to generate Feint behavior templates by extracting and combining sections of these sequences, emphasizing the semi-symmetric nature and ensuring physically realistic movements. read the caption.", "subpage_snippet": "", "source": "deep-diver.github.io", "link": "https://deep-diver.github.io/neurips2024/posters/aciddntbsj/", "content": "The figure illustrates three ways to generate Feint behavior templates by extracting and combining sections of these sequences, emphasizing the semi-symmetric nature and ensuring physically realistic movements. read the caption."}
+{"idx": 2, "title": "Technical Report-Feb-24, at User-Centric Computing Group, 2024", "date": "", "ddg_snippet": "arXiv: 2403 . 07932 v1 [cs.GT] 4 Mar 2024.tial impacts Rewspatial ( Section 3. 2 . 2 ) are aggregated on temporal domain. µ1 and µ2 denote the. weights of aggregated temporal impacts and spatial impacts respectively, enabling flexible adap", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2403.07932", "content": "arXiv: 2403 . 07932 v1 [cs.GT] 4 Mar 2024.tial impacts Rewspatial ( Section 3. 2 . 2 ) are aggregated on temporal domain. µ1 and µ2 denote the. weights of aggregated temporal impacts and spatial impacts respectively, enabling flexible adap"}
+{"idx": 3, "title": "How to Run Wan 2 . 2 Image to Video Model in ComfyUI... - Next Diffusion", "date": "", "ddg_snippet": "In the next section , we’ll dive into the key settings to optimize your video generation.Define the animation behavior and camera motion using a detailed text prompt. This guides the wan 2 . 2 module to transform the base image into a video with realistic or stylized movement.", "subpage_snippet": "", "source": "www.nextdiffusion.ai", "link": "https://www.nextdiffusion.ai/tutorials/exploring-the-new-wan22-image-to-video-generation-model-in-comfyui", "content": "In the next section , we’ll dive into the key settings to optimize your video generation.Define the animation behavior and camera motion using a detailed text prompt. This guides the wan 2 . 2 module to transform the base image into a video with realistic or stylized movement."}
+{"idx": 4, "title": "dblp: List of computer science publications by Junyu Liu", "date": "", "ddg_snippet": "Junyu Liu, Xiangjun Peng: Feint Behaviors and Strategies: Formalization, Implementation and Evaluation. NeurIPS 2024.journals/corr/abs- 2403 - 07932 .", "subpage_snippet": "", "source": "dblp.uni-trier.de", "link": "https://dblp.uni-trier.de/pid/96/7401.html", "content": "Junyu Liu, Xiangjun Peng: Feint Behaviors and Strategies: Formalization, Implementation and Evaluation. NeurIPS 2024.journals/corr/abs- 2403 - 07932 ."}
+{"idx": 5, "title": "Анти-Плагио - Бесплатный АнтиПлагиат | Без регистрации, без...", "date": "", "ddg_snippet": "Проверяйте уникальность больших текстов и на ИИ онлайн бесплатно и без ограничений. Российский сервис Анти-Плагио поможет создать качественный контент.", "subpage_snippet": "", "source": "anti-plagio.ru", "link": "https://anti-plagio.ru/", "content": "Проверяйте уникальность больших текстов и на ИИ онлайн бесплатно и без ограничений. Российский сервис Анти-Плагио поможет создать качественный контент."}
+{"idx": 6, "title": "qBittorrent - скачать бесплатно qBittorrent 4.4.5 / 5.1.2", "date": "", "ddg_snippet": "Бесплатно. Windows. QBittorrent - бесплатный, мощный и удобный в работе кроссплатформенный клиент файлообменной сети BitTorrent. Несмотря на кажущуюся простоту, программа обладает внушительным набором весьма полезных возможностей...", "subpage_snippet": "", "source": "www.SoftPortal.com", "link": "https://www.SoftPortal.com/software-18505-qbittorrent.html", "content": "Бесплатно. Windows. QBittorrent - бесплатный, мощный и удобный в работе кроссплатформенный клиент файлообменной сети BitTorrent. Несмотря на кажущуюся простоту, программа обладает внушительным набором весьма полезных возможностей..."}
+{"idx": 7, "title": "ESET NOD32 | Свежие Ключи 2025 | Бесплатно | СТЕНА – Telegram", "date": "", "ddg_snippet": "Личные ключи в боте @eset_free_nod32_bot (Напишите для начала /start). ESET HOME Security Premium | До 15-10-2025 1 | 5SG2-XPWE-K46M-RJ92-HAXH 2 | JE3E-XB9C-ANJK-UJ6U-2M6W 3 | RJWJ-XUAU-52GG-FTF4-W7VP 4 | AE8P-XXVG-KHW4-EEEC-AGRG 5...", "subpage_snippet": "", "source": "t.me", "link": "https://t.me/s/eset_nod32_free", "content": "Личные ключи в боте @eset_free_nod32_bot (Напишите для начала /start). ESET HOME Security Premium | До 15-10-2025 1 | 5SG2-XPWE-K46M-RJ92-HAXH 2 | JE3E-XB9C-ANJK-UJ6U-2M6W 3 | RJWJ-XUAU-52GG-FTF4-W7VP 4 | AE8P-XXVG-KHW4-EEEC-AGRG 5..."}
+{"idx": 8, "title": "Fix Windows Alerts by Removing Trojan:Win32/Vigorf.A Completely...", "date": "", "ddg_snippet": "Make Trojan:Win32/Vigorf.A Stop Relaunching After Reboots. If components are still active, running code often points to its location by holding locks, creating logs, or scheduling relaunches. Use that behavior to identify persistence cleanly.", "subpage_snippet": "", "source": "howtoremove.guide", "link": "https://howtoremove.guide/remove-trojanwin32-vigorf-a/", "content": "Make Trojan:Win32/Vigorf.A Stop Relaunching After Reboots. If components are still active, running code often points to its location by holding locks, creating logs, or scheduling relaunches. Use that behavior to identify persistence cleanly."}
+{"idx": 9, "title": "Build software products, using only a chat interface", "date": "", "ddg_snippet": "Build software products, using only a chat interface...", "subpage_snippet": "", "source": "lovable.dev", "link": "https://lovable.dev/", "content": "Build software products, using only a chat interface..."}

data/sampled_jsons/2403.07932_implementation_details_scheduler_weights.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Abstract page for arXiv paper 2403 . 07932 : Feint in Multi-Player Games", "date": "", "ddg_snippet": "Then, our work considers practical implementation details of Feint in Multi-Player Games, under the state-of-the-art progress of multi-agent modeling to date (namely Multi-Agent Reinforcement Learning).", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2403.07932", "content": "Then, our work considers practical implementation details of Feint in Multi-Player Games, under the state-of-the-art progress of multi-agent modeling to date (namely Multi-Agent Reinforcement Learning)."}
+{"idx": 1, "title": "Hello eBPF: Writing a Linux scheduler in Java with eBPF (15)", "date": "", "ddg_snippet": "Why another scheduler ? Creating your own scheduler allows you to explore new scheduling policies and rapidly iterate on custom implementation . To quote Tejun Heo on why we need the sched-ext extension for the Linux kernel", "subpage_snippet": "", "source": "mostlynerdless.de", "link": "https://mostlynerdless.de/blog/2024/09/10/hello-ebpf-writing-a-linux-scheduler-in-java-with-ebpf-15/", "content": "Why another scheduler ? Creating your own scheduler allows you to explore new scheduling policies and rapidly iterate on custom implementation . To quote Tejun Heo on why we need the sched-ext extension for the Linux kernel"}
+{"idx": 2, "title": "Go scheduler details | Yet Another Dev Blog", "date": "", "ddg_snippet": "Scheduler logic in details . LRQ. Finding a runnable goroutine.Goroutines are very light weight (~2KB+) and very cheap to operate. You can have millions of them in your program. Context switch between goroutines is also pretty cheap. There are 5 main entities Scheduler operates", "subpage_snippet": "", "source": "blog.bullgare.com", "link": "https://blog.bullgare.com/2022/11/go-scheduler-details/", "content": "Scheduler logic in details . LRQ. Finding a runnable goroutine.Goroutines are very light weight (~2KB+) and very cheap to operate. You can have millions of them in your program. Context switch between goroutines is also pretty cheap. There are 5 main entities Scheduler operates"}
+{"idx": 3, "title": "Telegram: View @kizma_v_teme", "date": "", "ddg_snippet": "The webpage at https://t.me/kizma_v_teme/7932?embed=1&mode=tme might be temporarily down or it may have moved to a new web address. Details .", "subpage_snippet": "", "source": "t.me", "link": "https://t.me/kizma_v_teme/7932", "content": "The webpage at https://t.me/kizma_v_teme/7932?embed=1&mode=tme might be temporarily down or it may have moved to a new web address. Details ."}
+{"idx": 4, "title": "stabilityai/stable-diffusion-3.5-large · Hugging Face", "date": "", "ddg_snippet": "Implementation Details . QK Normalization: Implements the QK normalization technique to improve training Stability. Text Encoders： CLIPs: OpenCLIP-ViT/G, CLIP-ViT/L, context length 77 tokens.", "subpage_snippet": "", "source": "huggingface.co", "link": "https://huggingface.co/stabilityai/stable-diffusion-3.5-large", "content": "Implementation Details . QK Normalization: Implements the QK normalization technique to improve training Stability. Text Encoders： CLIPs: OpenCLIP-ViT/G, CLIP-ViT/L, context length 77 tokens."}
+{"idx": 5, "title": "Sample Complexity and Representation Ability of Test-time", "date": "", "ddg_snippet": "We demonstrate that a Transformer equipped with verifier feedback at test time can implement online learning algorithms over a pool of expert models ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2506.05295v1", "content": "We demonstrate that a Transformer equipped with verifier feedback at test time can implement online learning algorithms over a pool of expert models ..."}
+{"idx": 6, "title": "Schedule 1 How & Where To Get LED & UV Lights In... - YouTube", "date": "", "ddg_snippet": "About Press Copyright Contact us Creators Advertise Developers Terms Privacy Policy & Safety How...", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=pUT1PZQ22c4", "content": "About Press Copyright Contact us Creators Advertise Developers Terms Privacy Policy & Safety How..."}
+{"idx": 7, "title": "Schedule 1: Where to Buy Pots and LED or UV Lights", "date": "", "ddg_snippet": "But without the right gear, your grow room is just a sad, dusty corner. If you’re looking for pots, LED lights , or suspension racks, here’s where you can find each item in Schedule 1.LED Lights from the game schedule 1. Where to Buy LED Lights & Suspension Racks.", "subpage_snippet": "", "source": "gamerblurb.com", "link": "https://gamerblurb.com/articles/schedule-1-where-to-buy-pots-and-led-lights", "content": "But without the right gear, your grow room is just a sad, dusty corner. If you’re looking for pots, LED lights , or suspension racks, here’s where you can find each item in Schedule 1.LED Lights from the game schedule 1. Where to Buy LED Lights & Suspension Racks."}
+{"idx": 8, "title": "Manus: General AI agent that bridges mind and action", "date": "", "ddg_snippet": "Manus is a general AI agent that turns your thoughts into actions. It excels at various tasks in work and life, getting everything done while you rest.", "subpage_snippet": "", "source": "manus.im", "link": "https://manus.im/", "content": "Manus is a general AI agent that turns your thoughts into actions. It excels at various tasks in work and life, getting everything done while you rest."}
+{"idx": 9, "title": "Tampa Bay Lightning Schedule | Tampa Bay Lightning", "date": "", "ddg_snippet": "Navigation Menu. Schedule . Community. Team.Youth Hockey. NHL.com. Schedule .", "subpage_snippet": "", "source": "www.nhl.com", "link": "https://www.nhl.com/lightning/schedule", "content": "Navigation Menu. Schedule . Community. Team.Youth Hockey. NHL.com. Schedule ."}

data/sampled_jsons/2412.11576_limitations_Section_5_applicability.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "[ 2412 . 11576 ] DCBM: Data-Efficient Visual Concept Bottleneck Models", "date": "", "ddg_snippet": "This removes reliance on textual descriptions and large-scale pre-training, making DCBMs applicable for fine-grained classification and out-of-distribution tasks.Computer Vision and Pattern Recognition (cs.CV). Cite as: arXiv: 2412 . 11576 [cs.CV].", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2412.11576", "content": "This removes reliance on textual descriptions and large-scale pre-training, making DCBMs applicable for fine-grained classification and out-of-distribution tasks.Computer Vision and Pattern Recognition (cs.CV). Cite as: arXiv: 2412 . 11576 [cs.CV]."}
+{"idx": 1, "title": "5 Applicability to Different Distances – Norwegian Singles", "date": "", "ddg_snippet": "5 Applicability to Different Distances. This method, focusing on sub-threshold work, is primarily designed for the general preparation phase of training, building a strong aerobic base. Its direct applicability varies slightly by race distance: 5 .1 5 k to Half Marathon.", "subpage_snippet": "", "source": "norwegiansingles.run", "link": "https://norwegiansingles.run/section5_applicability_distances.html", "content": "5 Applicability to Different Distances. This method, focusing on sub-threshold work, is primarily designed for the general preparation phase of training, building a strong aerobic base. Its direct applicability varies slightly by race distance: 5 .1 5 k to Half Marathon."}
+{"idx": 2, "title": "Section 315 at Thompson-Boling Arena - RateYourSeats.com", "date": "", "ddg_snippet": "See the view from Section 315, read reviews and buy tickets.", "subpage_snippet": "", "source": "www.rateyourseats.com", "link": "https://www.rateyourseats.com/thompson-boling-arena/seating/sections/315", "content": "See the view from Section 315, read reviews and buy tickets."}
+{"idx": 3, "title": "TGame | Daily Lives Of My Countryside character section ... - YouTube", "date": "", "ddg_snippet": "Daily Lives Of My Countryside experience part Mae- The main thing is to have fun.- The video I made is a guide to the events in the game, I didn't make the u...", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=BirIRgPd6QM", "content": "Daily Lives Of My Countryside experience part Mae- The main thing is to have fun.- The video I made is a guide to the events in the game, I didn't make the u..."}
+{"idx": 4, "title": "14th Amendment - Citizenship Rights, Equal... | Constitution Center", "date": "", "ddg_snippet": "14th Amendment. Section 1. Section 1. All persons born or naturalized in the United States, and subject to the jurisdiction thereof, are citizens of the United States and of the State wherein they reside.", "subpage_snippet": "", "source": "constitutioncenter.org", "link": "https://constitutioncenter.org/the-constitution/amendments/amendment-xiv", "content": "14th Amendment. Section 1. Section 1. All persons born or naturalized in the United States, and subject to the jurisdiction thereof, are citizens of the United States and of the State wherein they reside."}
+{"idx": 5, "title": "9 Best Uncensored Local LLM (7 To 20B) - Sci Fi Logic", "date": "", "ddg_snippet": "This versatility enhances its applicability in roleplay, instruction following, and coding scenarios, placing it on par with many 30 billion parameter models. Throughout my testing, I observed excellent results from this improved flagship model.", "subpage_snippet": "", "source": "scifilogic.com", "link": "https://scifilogic.com/open-uncensored-llm-model/", "content": "This versatility enhances its applicability in roleplay, instruction following, and coding scenarios, placing it on par with many 30 billion parameter models. Throughout my testing, I observed excellent results from this improved flagship model."}
+{"idx": 6, "title": "e-Filing Home Page, Income Tax Department, Government of India", "date": "", "ddg_snippet": "Pre-login section .", "subpage_snippet": "", "source": "eportal.incometax.gov.in", "link": "https://eportal.incometax.gov.in/iec/foservices/", "content": "Pre-login section ."}
+{"idx": 7, "title": "Atbash Cipher - Decryption and Encryption Online", "date": "", "ddg_snippet": "If the alphabet used in encryption is limited (for example, only letters), this can greatly limit the applicability of the cipher. For long texts, the Atbash Cipher can be inconvenient, as it requires a large amount of manual work and can be prone to errors.", "subpage_snippet": "", "source": "ciphersonline.com", "link": "https://ciphersonline.com/atbash-cipher", "content": "If the alphabet used in encryption is limited (for example, only letters), this can greatly limit the applicability of the cipher. For long texts, the Atbash Cipher can be inconvenient, as it requires a large amount of manual work and can be prone to errors."}
+{"idx": 8, "title": "Ограничения по контракту | Служить Родине", "date": "", "ddg_snippet": "Список ограничений, препятствующих добровольцам заключить контракт на СВО.", "subpage_snippet": "", "source": "armyworld.ru", "link": "https://armyworld.ru/limitations/", "content": "Список ограничений, препятствующих добровольцам заключить контракт на СВО."}
+{"idx": 9, "title": "7 важных ограничений после выкидыша: рекомендации врачей", "date": "", "ddg_snippet": "Что нельзя делать после выкидыша: узнайте о 7 важных физических ограничениях, включая запрет на интимную жизнь в течение 2-4 недель, и рекомендациях врачей для безопасного восстановления организма.", "subpage_snippet": "", "source": "onlinepharm.uz", "link": "https://onlinepharm.uz/physical-limitations-after-miscarriage/", "content": "Что нельзя делать после выкидыша: узнайте о 7 важных физических ограничениях, включая запрет на интимную жизнь в течение 2-4 недель, и рекомендациях врачей для безопасного восстановления организма."}

data/sampled_jsons/2412.17997_diagonal_update_simultaneous_grid_parallel_sampling.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "[ 2412 . 17997 ] Shifted Composition III: Local Error Framework for KL...", "date": "", "ddg_snippet": "Mathematics > Statistics Theory. arXiv: 2412 . 17997 (math).We apply this framework to the problem of sampling from a target distribution $\\pi$. Here, the two stochastic processes are the Langevin diffusion and an algorithmic discretization thereof.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2412.17997", "content": "Mathematics > Statistics Theory. arXiv: 2412 . 17997 (math).We apply this framework to the problem of sampling from a target distribution $\\pi$. Here, the two stochastic processes are the Langevin diffusion and an algorithmic discretization thereof."}
+{"idx": 1, "title": "Parallel Sampling Algorithms", "date": "", "ddg_snippet": "Parallel Sampling Algorithms. Updated 30 June 2025. Parallel sampling algorithms are computational methods designed to generate random samples from specified probability distributions using multiple computational resources simultaneously .", "subpage_snippet": "", "source": "www.emergentmind.com", "link": "https://www.emergentmind.com/topics/parallel-sampling-algorithms", "content": "Parallel Sampling Algorithms. Updated 30 June 2025. Parallel sampling algorithms are computational methods designed to generate random samples from specified probability distributions using multiple computational resources simultaneously ."}
+{"idx": 2, "title": "Turning mutable grid access into a thread-safe grid access (stencils)", "date": "", "ddg_snippet": "Run 1): parallel over the mutable black references: 1 black reference a uses the list of all white immutable references cells to get its correct neighbors and does the update a.div and a.u and a.v from 2).", "subpage_snippet": "", "source": "users.rust-lang.org", "link": "https://users.rust-lang.org/t/turning-mutable-grid-access-into-a-thread-safe-grid-access-stencils/87502", "content": "Run 1): parallel over the mutable black references: 1 black reference a uses the list of all white immutable references cells to get its correct neighbors and does the update a.div and a.u and a.v from 2)."}
+{"idx": 3, "title": "SQL UPDATE Statement - GeeksforGeeks", "date": "", "ddg_snippet": "Without WHERE, all rows will be updated . Examples of SQL UPDATE Statement. Let’s begin by creating a Customer table with some sample data. This table contains each customer's unique ID, name, last name, phone number and country.", "subpage_snippet": "", "source": "www.geeksforgeeks.org", "link": "https://www.geeksforgeeks.org/sql/sql-update-statement/", "content": "Without WHERE, all rows will be updated . Examples of SQL UPDATE Statement. Let’s begin by creating a Customer table with some sample data. This table contains each customer's unique ID, name, last name, phone number and country."}
+{"idx": 4, "title": "Applying Concurrency Patterns with Parallel BFS in C# for... | IT trip", "date": "", "ddg_snippet": "In this code, Parallel .For is used to process all nodes at the current level of BFS simultaneously . This helps speed up the exploration of neighboring nodes. Optimizing Grid Division.", "subpage_snippet": "", "source": "en.ittrip.xyz", "link": "https://en.ittrip.xyz/c-sharp/concurrency-bfs-game-ai-csharp", "content": "In this code, Parallel .For is used to process all nodes at the current level of BFS simultaneously . This helps speed up the exploration of neighboring nodes. Optimizing Grid Division."}
+{"idx": 5, "title": "(PDF) Communication Reduced Parallel Multigrid: Analysis and...", "date": "", "ddg_snippet": "A parallel multigrid method with this technique avoids all communication on the finest grid levels. This article will examine some features of this class of algorithms as compared to standard parallel multigrid methods.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/2393821_Communication_Reduced_Parallel_Multigrid_Analysis_and_Experiments", "content": "A parallel multigrid method with this technique avoids all communication on the finest grid levels. This article will examine some features of this class of algorithms as compared to standard parallel multigrid methods."}
+{"idx": 6, "title": "How do I fix \"'ag- grid -angular' is not a known element...\" -...", "date": "", "ddg_snippet": "I am having an issue with my angular code where my ag- grid tags aren't being recognised, and neither are my columnDefs and rowData. I have looked up the issues and imported what I needed to but the problem still persists.", "subpage_snippet": "", "source": "stackoverflow.com", "link": "https://stackoverflow.com/questions/75971845/how-do-i-fix-ag-grid-angular-is-not-a-known-element-problem", "content": "I am having an issue with my angular code where my ag- grid tags aren't being recognised, and neither are my columnDefs and rowData. I have looked up the issues and imported what I needed to but the problem still persists."}
+{"idx": 7, "title": "How to Get Position Type in MQL5?", "date": "", "ddg_snippet": "You’ll typically need to access other properties simultaneously : Type + Volume: Manage risk based on position size and direction. Type + Entry Price: Calculate profit/loss (POSITION_PROFIT, POSITION_PRICE_CURRENT) relative to the entry for a specific direction.", "subpage_snippet": "", "source": "trading-strategies.academy", "link": "https://trading-strategies.academy/archives/3234", "content": "You’ll typically need to access other properties simultaneously : Type + Volume: Manage risk based on position size and direction. Type + Entry Price: Calculate profit/loss (POSITION_PROFIT, POSITION_PRICE_CURRENT) relative to the entry for a specific direction."}
+{"idx": 8, "title": "Video Generation with Wan2.1 - Chutes Documentation", "date": "", "ddg_snippet": "Initialize Wan2.1 models in distributed fashion across GPUs. \"\"\"import torch import torch.distributed as dist import wan from wan.configs import WAN_CONFIGS from xfuser.core.distributed import initialize_model_ parallel , init_distributed_environment #.", "subpage_snippet": "", "source": "chutes.ai", "link": "https://chutes.ai/docs/examples/video-generation", "content": "Initialize Wan2.1 models in distributed fashion across GPUs. \"\"\"import torch import torch.distributed as dist import wan from wan.configs import WAN_CONFIGS from xfuser.core.distributed import initialize_model_ parallel , init_distributed_environment #."}
+{"idx": 9, "title": "Journal of Medical Internet Research - Evaluating the Utility of...", "date": "", "ddg_snippet": "These systems monitor the movement of multiple body parts simultaneously by integrating multiple accelerometers and gyroscopes or IMUs, enabling comprehensive analysis of whole-body movement.", "subpage_snippet": "", "source": "www.jmir.org", "link": "https://www.jmir.org/2025/1/e69422/", "content": "These systems monitor the movement of multiple body parts simultaneously by integrating multiple accelerometers and gyroscopes or IMUs, enabling comprehensive analysis of whole-body movement."}

data/sampled_jsons/2503.10694_Table_1_MedQA_accuracy_alpha_conditional.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "9.7 - Futility Assessment with Conditional Power; Adaptive ...", "date": "", "ddg_snippet": "View the table from Bhatt DL, Mehta C. Adaptive designs for clinical trials. New England Journal of Medicine. 2016;375 ( 1 ):65–74. doi: 10.1056/NEJMra1510061. pmid:27406349, to see the strengths and weaknesses of different adaptive designs.", "subpage_snippet": "", "source": "online.stat.psu.edu", "link": "https://online.stat.psu.edu/stat509/lesson/9/9.7", "content": "View the table from Bhatt DL, Mehta C. Adaptive designs for clinical trials. New England Journal of Medicine. 2016;375 ( 1 ):65–74. doi: 10.1056/NEJMra1510061. pmid:27406349, to see the strengths and weaknesses of different adaptive designs."}
+{"idx": 1, "title": "Chapter 2 Contingency Tables - University of Chicago", "date": "", "ddg_snippet": "A conditional distribution of Y given X refers to the probability distribution of Y when we restrict attention to a fixed level of X. P(X = i; Y = j) P(Y = j j X = i) = = P(X = i)", "subpage_snippet": "", "source": "www.stat.uchicago.edu", "link": "https://www.stat.uchicago.edu/~yibi/teaching/stat226/2017/lectures/C02A.pdf", "content": "A conditional distribution of Y given X refers to the probability distribution of Y when we restrict attention to a fixed level of X. P(X = i; Y = j) P(Y = j j X = i) = = P(X = i)"}
+{"idx": 2, "title": "MedQA", "date": "", "ddg_snippet": "The cost- accuracy graph shows a few models that define a Pareto curve of tradeoffs: o 1 Preview, o 1 Mini, Llama 3. 1 405b, Llama 3. 1 70b, and GPT 4o mini. Among these five models, Llama 3. 1 70b stands out for its strong quality-to-price ratio.", "subpage_snippet": "", "source": "www.vals.ai", "link": "https://www.vals.ai/benchmarks/medqa-01-27-2025", "content": "The cost- accuracy graph shows a few models that define a Pareto curve of tradeoffs: o 1 Preview, o 1 Mini, Llama 3. 1 405b, Llama 3. 1 70b, and GPT 4o mini. Among these five models, Llama 3. 1 70b stands out for its strong quality-to-price ratio."}
+{"idx": 3, "title": "GBaker/ MedQA -USMLE-4-options · Datasets at Hugging Face", "date": "", "ddg_snippet": "Bone marrow biopsy shows cellular hyperplasia with proliferation of immature granulocytic cells. Which of the following mechanisms is most likely responsible for this patient's condition ?Models trained or fine-tuned on GBaker/ MedQA -USMLE-4-options. sileod/deberta-v3-base-tasksource-nli.", "subpage_snippet": "", "source": "huggingface.co", "link": "https://huggingface.co/datasets/GBaker/MedQA-USMLE-4-options", "content": "Bone marrow biopsy shows cellular hyperplasia with proliferation of immature granulocytic cells. Which of the following mechanisms is most likely responsible for this patient's condition ?Models trained or fine-tuned on GBaker/ MedQA -USMLE-4-options. sileod/deberta-v3-base-tasksource-nli."}
+{"idx": 4, "title": "Brief Review — MedQA : What Disease Does This Patient... | Medium", "date": "", "ddg_snippet": "1 . MedQA Dataset.The task is defined by its three components: Question: question in text, either in one sentence asking for a certain piece of knowledge, or in a long paragraph starting with a description of the patient condition .", "subpage_snippet": "", "source": "sh-tsang.medium.com", "link": "https://sh-tsang.medium.com/brief-review-medqa-what-disease-does-this-patient-have-a-large-scale-open-domain-question-e26e4d682c83", "content": "1 . MedQA Dataset.The task is defined by its three components: Question: question in text, either in one sentence asking for a certain piece of knowledge, or in a long paragraph starting with a description of the patient condition ."}
+{"idx": 5, "title": "Google's Gemini AI Achieves 91. 1 % Accuracy in MedQA ... | DeepNewz", "date": "", "ddg_snippet": "Med-Gemini has achieved state-of-the-art performance on 10 out of 14 benchmarks, surpassing GPT-4 in all comparisons, and achieves 91. 1 % accuracy on the MedQA (USMLE) benchmark.", "subpage_snippet": "", "source": "deepnewz.com", "link": "https://deepnewz.com/ai/google-s-gemini-ai-achieves-91-1-accuracy-medqa-benchmark", "content": "Med-Gemini has achieved state-of-the-art performance on 10 out of 14 benchmarks, surpassing GPT-4 in all comparisons, and achieves 91. 1 % accuracy on the MedQA (USMLE) benchmark."}
+{"idx": 6, "title": "Medical Large Language Model Benchmarks Should Prioritize ...", "date": "", "ddg_snippet": "The results in Table 1 show a modest correlation between LLM performance on the MedQA benchmark and real-world cases. In a scenario of perfect criterion validity, we would expect α to approach 1 .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2503.10694", "content": "The results in Table 1 show a modest correlation between LLM performance on the MedQA benchmark and real-world cases. In a scenario of perfect criterion validity, we would expect α to approach 1 ."}
+{"idx": 7, "title": "MedGemma Technical Report - arXiv.org", "date": "", "ddg_snippet": "Applying RL to the MedGemma 27B resulted in a substantial improvement in its EHRQA accuracy , closing the gap with top-performing models, as shown in Table 14. Notably, the greatest gains were observed in question categories requiring reasoning across inter-dependent records (Appendix Figure A3).", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2507.05201v3", "content": "Applying RL to the MedGemma 27B resulted in a substantial improvement in its EHRQA accuracy , closing the gap with top-performing models, as shown in Table 14. Notably, the greatest gains were observed in question categories requiring reasoning across inter-dependent records (Appendix Figure A3)."}
+{"idx": 8, "title": "Mind the Gap: Evaluating the Representativeness of Medical ...", "date": "", "ddg_snippet": "Stage 1 randomly harmonised six heterogeneous question-answer benchmarks from AfriMed-QA, PubMedQA, MedMCQA, MedQA -USMLE, MMLU-Medical and the in-house Alama-Health-QA—into a single master dataframe. All non-essential fields are collapsed into a cleaned unified column.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2507.16322", "content": "Stage 1 randomly harmonised six heterogeneous question-answer benchmarks from AfriMed-QA, PubMedQA, MedMCQA, MedQA -USMLE, MMLU-Medical and the in-house Alama-Health-QA—into a single master dataframe. All non-essential fields are collapsed into a cleaned unified column."}
+{"idx": 9, "title": "Medical Large Language Model Benchmarks Should Prioritize...", "date": "", "ddg_snippet": "Table 1 : Predictive validity of the MedQA benchmark. Report issue for preceding element. Figure 5: Left: Impact of number of answer choices in MedQA on accuracy . Middle: Distribution of clinical tasks and scenarios in MedQA and real-world data.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2503.10694v1", "content": "Table 1 : Predictive validity of the MedQA benchmark. Report issue for preceding element. Figure 5: Left: Impact of number of answer choices in MedQA on accuracy . Middle: Distribution of clinical tasks and scenarios in MedQA and real-world data."}

data/sampled_jsons/2506.05503_section_3.2_coordinate-wise_private_median_regression_challenge.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "MAT240 Module 3 Challenge Activities - YouTube", "date": "", "ddg_snippet": "In this video we'll look at using a linear regression equation to predict, estimate the slope and intercept from a graph, talk about correlation and R-square...", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=w0pE1PgoGYk", "content": "In this video we'll look at using a linear regression equation to predict, estimate the slope and intercept from a graph, talk about correlation and R-square..."}
+{"idx": 1, "title": "challenge activity 2.3.2 excel linear regression.jpg", "date": "", "ddg_snippet": "Unformatted text preview: GI-lflLBIGE . . mm I 2.3.2. Excel. Linear regresSIon . Click this link to download the spreadsheet for use in this activity. Jump to level 1 According to the Farmer's Almanac, the frequency of cricket chirps varies according to the ambient temperature. As a resutt by counting the number of chirps and dividing by the time period] the temperature can be predicted using ...", "subpage_snippet": "", "source": "www.coursehero.com", "link": "https://www.coursehero.com/file/93407621/challenge-activity-232-excel-linear-regressionjpg/", "content": "Unformatted text preview: GI-lflLBIGE . . mm I 2.3.2. Excel. Linear regresSIon . Click this link to download the spreadsheet for use in this activity. Jump to level 1 According to the Farmer's Almanac, the frequency of cricket chirps varies according to the ambient temperature. As a resutt by counting the number of chirps and dividing by the time period] the temperature can be predicted using ..."}
+{"idx": 2, "title": "C1_W3_Logistic_Regression.ipynb - Colab - Google Colab", "date": "", "ddg_snippet": "2.4 Cost function for logistic regression In this section , you will implement the cost function for logistic regression . Exercise 2 Please complete the compute_cost function using the equations below. Recall that for logistic regression , the cost function is of the form", "subpage_snippet": "", "source": "colab.research.google.com", "link": "https://colab.research.google.com/github/kaieye/2022-Machine-Learning-Specialization/blob/main/Supervised+Machine+Learning+Regression+and+Classification/week3/9.Week+3+practice+lab+logistic+regression/C1_W3_Logistic_Regression.ipynb", "content": "2.4 Cost function for logistic regression In this section , you will implement the cost function for logistic regression . Exercise 2 Please complete the compute_cost function using the equations below. Recall that for logistic regression , the cost function is of the form"}
+{"idx": 3, "title": "PDF Modern regression 2: The lasso - Carnegie Mellon University", "date": "", "ddg_snippet": "The lasso uses a penalty like ridge regression , except the penalty is the `1 norm of the coe cient vector, which causes the estimates of some coe cients to be exactly zero. This is in constrast to ridge regression which never sets coe cients to zero The tuning parameter controls the strength of the `1 penalty.", "subpage_snippet": "", "source": "www.stat.cmu.edu", "link": "https://www.stat.cmu.edu/~ryantibs/datamining/lectures/17-modr2.pdf", "content": "The lasso uses a penalty like ridge regression , except the penalty is the `1 norm of the coe cient vector, which causes the estimates of some coe cients to be exactly zero. This is in constrast to ridge regression which never sets coe cients to zero The tuning parameter controls the strength of the `1 penalty."}
+{"idx": 4, "title": "MAT 240 Assignment 3-3 - Median Housing Price Prediction ... - Studocu", "date": "", "ddg_snippet": "Assignment 3-3 median housing price prediction model for pan real estate company median housing price prediction model for pan real estate company karel ehlers", "subpage_snippet": "", "source": "www.studocu.com", "link": "https://www.studocu.com/en-us/document/southern-new-hampshire-university/applied-statistics/mat-240-assignment-3-3/12129464", "content": "Assignment 3-3 median housing price prediction model for pan real estate company median housing price prediction model for pan real estate company karel ehlers"}
+{"idx": 5, "title": "MATH240 - Challenge Exercises - Section 2.3 - Part 1 - YouTube", "date": "", "ddg_snippet": "Subscribed Like 6.6K views 4 years ago MATH240 - Challenge Exercises - Section 2.3 - Part 1...more", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=VHdqAdIP-Dk", "content": "Subscribed Like 6.6K views 4 years ago MATH240 - Challenge Exercises - Section 2.3 - Part 1...more"}
+{"idx": 6, "title": "Statistics module three notes - MAT-240 Mod 3 Notes: Mod 3 ... - Studocu", "date": "", "ddg_snippet": "Notes on the reading for module three of applied statistics. This also contains examples, tables, and Excel formulas. mod notes: mod more on linear regression", "subpage_snippet": "", "source": "www.studocu.com", "link": "https://www.studocu.com/en-us/document/southern-new-hampshire-university/applied-statistics/statistics-module-three-notes/17322885", "content": "Notes on the reading for module three of applied statistics. This also contains examples, tables, and Excel formulas. mod notes: mod more on linear regression"}
+{"idx": 7, "title": "Solved MAT 240: Applied Statistics home - Chegg", "date": "", "ddg_snippet": "Question: MAT 240: Applied Statistics home > 2.3: Least squares method zyBooks CHALLENGE ACTIVITY 2.3.3. Excel: Residuals. Click this link to download the spreadsheet for use in this activity. 249.66729276. dan Jump to level 1 The systolic blood pressure dataset (in the third sheet of the spreadsheet linked above) contains the systolic blood pressure and age of 30", "subpage_snippet": "", "source": "www.chegg.com", "link": "https://www.chegg.com/homework-help/questions-and-answers/mat-240-applied-statistics-home-23-least-squares-method-zybooks-challenge-activity-233-exc-q87319295", "content": "Question: MAT 240: Applied Statistics home > 2.3: Least squares method zyBooks CHALLENGE ACTIVITY 2.3.3. Excel: Residuals. Click this link to download the spreadsheet for use in this activity. 249.66729276. dan Jump to level 1 The systolic blood pressure dataset (in the third sheet of the spreadsheet linked above) contains the systolic blood pressure and age of 30"}
+{"idx": 8, "title": "Jko Lms", "date": "", "ddg_snippet": "JKO Help Desk: 24 hours a day, 7 days a week, except Federal Holidays.", "subpage_snippet": "", "source": "jkodirect.jten.mil", "link": "https://jkodirect.jten.mil/", "content": "JKO Help Desk: 24 hours a day, 7 days a week, except Federal Holidays."}
+{"idx": 9, "title": "Stanford Math 51: Linear Algebra, Multivariable Calculus & Apps", "date": "", "ddg_snippet": "Explore Stanford University's Math 51 course text covering linear algebra, multivariable calculus, and modern applications. Learn vectors, matrices, optimization, and eigenvalues for data science and engineering.", "subpage_snippet": "", "source": "studylib.net", "link": "https://studylib.net/doc/27857883/math51book", "content": "Explore Stanford University's Math 51 course text covering linear algebra, multivariable calculus, and modern applications. Learn vectors, matrices, optimization, and eigenvalues for data science and engineering."}

data/sampled_jsons/32867_Descriptor-In-Pixel_SCAMP-7_PPA_prototype_maximum_FPS.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Descriptor-In-Pixel : Point-Feature Tracking For Pixel Processor Arrays", "date": "", "ddg_snippet": "This approach is very fast, our implementation upon the SCAMP-7 PPA prototype runs at over 3000 FPS (Frames Per Second), tracking point-features reliably even under violent motion. This is the first work performing point-feature detection and tracking entirely \" in-pixel \".", "subpage_snippet": "", "source": "cvpr.thecvf.com", "link": "https://cvpr.thecvf.com/virtual/2025/poster/32867", "content": "This approach is very fast, our implementation upon the SCAMP-7 PPA prototype runs at over 3000 FPS (Frames Per Second), tracking point-features reliably even under violent motion. This is the first work performing point-feature detection and tracking entirely \" in-pixel \"."}
+{"idx": 1, "title": "Live Demonstration: SCAMP-7 - IEEE Xplore", "date": "", "ddg_snippet": "We propose to demonstrate the next generation of the SCAMP vision sensor, SCAMP-7 , whose architecture embeds programmable processing cores into each pixel . This IC allows various computer vision tasks to be performed \"on-sensor\" at high speeds while avoiding the slow and power hungry transfer of image data off the device. Through in-pixel computations over the image array, visual information ...", "subpage_snippet": "", "source": "ieeexplore.ieee.org", "link": "https://ieeexplore.ieee.org/document/10208514", "content": "We propose to demonstrate the next generation of the SCAMP vision sensor, SCAMP-7 , whose architecture embeds programmable processing cores into each pixel . This IC allows various computer vision tasks to be performed \"on-sensor\" at high speeds while avoiding the slow and power hungry transfer of image data off the device. Through in-pixel computations over the image array, visual information ..."}
+{"idx": 2, "title": "SCAMP Vision Sensor - Technology", "date": "", "ddg_snippet": "Our prototype device, SCAMP-5 integrated circuit, integrates 65,536 processor cores, in a 256x256 pixel array. At peak performance it can carry out over 500 GOPS (billion operations per second) at power consumption below 1.2W.", "subpage_snippet": "", "source": "www.scamp-vision-chip.org", "link": "https://www.scamp-vision-chip.org/technology", "content": "Our prototype device, SCAMP-5 integrated circuit, integrates 65,536 processor cores, in a 256x256 pixel array. At peak performance it can carry out over 500 GOPS (billion operations per second) at power consumption below 1.2W."}
+{"idx": 3, "title": "SCAMP Vision Sensor - University of Manchester", "date": "", "ddg_snippet": "The SCAMP Vision Sensor integrates a massively parallel SIMD processor array into the pixels of the image sensor device. Unlike a conventional image sensor, it does not output raw images, but rather the results of on-sensor computations, for instance a feature map, optic flow map and/or address-events describing locations of pixels of interest. The device is fully programmable, to execute a ...", "subpage_snippet": "", "source": "personalpages.manchester.ac.uk", "link": "https://personalpages.manchester.ac.uk/staff/p.dudek/scamp/", "content": "The SCAMP Vision Sensor integrates a massively parallel SIMD processor array into the pixels of the image sensor device. Unlike a conventional image sensor, it does not output raw images, but rather the results of on-sensor computations, for instance a feature map, optic flow map and/or address-events describing locations of pixels of interest. The device is fully programmable, to execute a ..."}
+{"idx": 4, "title": "Bose Descriptor-In-Pixel Point-Feature Tracking For Pixel Processor ...", "date": "", "ddg_snippet": "This paper introduces a novel method for point-feature detection and tracking using Pixel Processor Array ( PPA ) vision sensors, which enables in-pixel computation and significantly reduces data transfer requirements. The proposed Descriptor- In - Pixel paradigm allows for efficient processing at over 3000 FPS , making it suitable for high-speed applications while maintaining low latency. By ...", "subpage_snippet": "", "source": "www.scribd.com", "link": "https://www.scribd.com/document/890539401/Bose-Descriptor-In-Pixel-Point-Feature-Tracking-for-Pixel-Processor-Arrays-CVPR-2025-Paper", "content": "This paper introduces a novel method for point-feature detection and tracking using Pixel Processor Array ( PPA ) vision sensors, which enables in-pixel computation and significantly reduces data transfer requirements. The proposed Descriptor- In - Pixel paradigm allows for efficient processing at over 3000 FPS , making it suitable for high-speed applications while maintaining low latency. By ..."}
+{"idx": 5, "title": "Descriptor In Pixel : Point Feature Tracking for Pixel ... - YouTube", "date": "", "ddg_snippet": "This approach is very fast, our implementation upon the SCAMP-7 PPA prototype runs at over 3000 FPS (Frames Per Second), tracking point-features reliably even under violent motion.", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=HIdQtf6mFSs", "content": "This approach is very fast, our implementation upon the SCAMP-7 PPA prototype runs at over 3000 FPS (Frames Per Second), tracking point-features reliably even under violent motion."}
+{"idx": 6, "title": "Live Demonstration: SCAMP-7 - computer.org", "date": "", "ddg_snippet": "We propose to demonstrate the next generation of the SCAMP vision sensor, SCAMP-7 , whose architecture embeds programmable processing cores into each pixel . This IC allows various computer vision tasks to be performed", "subpage_snippet": "", "source": "www.computer.org", "link": "https://www.computer.org/csdl/proceedings-article/cvprw/2023/024900d995/1PBy0sv9HtC", "content": "We propose to demonstrate the next generation of the SCAMP vision sensor, SCAMP-7 , whose architecture embeds programmable processing cores into each pixel . This IC allows various computer vision tasks to be performed"}
+{"idx": 7, "title": "PDF Live Demonstration: Scamp-7 - CVF Open Access", "date": "", "ddg_snippet": "Abstract We propose to demonstrate the next generation of the SCAMP vision sensor, SCAMP-7 , whose architecture em-beds programmable processing cores into each pixel . This IC allows various computer vision tasks to be performed \"on-sensor\" at high speeds while avoiding the slow and power hungry transfer of image data off the device. Through in-pixel computations over the image array, visual ...", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2023W/EventVision/papers/Bose_Live_Demonstration_Scamp-7_CVPRW_2023_paper.pdf", "content": "Abstract We propose to demonstrate the next generation of the SCAMP vision sensor, SCAMP-7 , whose architecture em-beds programmable processing cores into each pixel . This IC allows various computer vision tasks to be performed \"on-sensor\" at high speeds while avoiding the slow and power hungry transfer of image data off the device. Through in-pixel computations over the image array, visual ..."}
+{"idx": 8, "title": "DEMO : Point-Feature Tracking for Pixel Processor Arrays", "date": "", "ddg_snippet": "We implemented our approach upon the SCAMP-7 PPA prototype , upon which it can operate at just over 3000 FPS (Frames Per Second) given sufficient illumination, allowing real-time point-feature tracking under violent motion.", "subpage_snippet": "", "source": "ieeexplore.ieee.org", "link": "https://ieeexplore.ieee.org/abstract/document/11147459", "content": "We implemented our approach upon the SCAMP-7 PPA prototype , upon which it can operate at just over 3000 FPS (Frames Per Second) given sufficient illumination, allowing real-time point-feature tracking under violent motion."}
+{"idx": 9, "title": "CVPR 2025 Open Access Repository", "date": "", "ddg_snippet": "The sparse readout and complete utilization of all pixel -processors makes our approach very efficient. Our implementation upon the SCAMP-7 PPA prototype runs at over 3000 FPS (Frames Per Second), tracking point-features reliably under violent motion. This is the first work performing point-feature detection and tracking entirely in-pixel .", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/html/Bose_Descriptor-In-Pixel__Point-Feature_Tracking_For_Pixel_Processor_Arrays_CVPR_2025_paper.html", "content": "The sparse readout and complete utilization of all pixel -processors makes our approach very efficient. Our implementation upon the SCAMP-7 PPA prototype runs at over 3000 FPS (Frames Per Second), tracking point-features reliably under violent motion. This is the first work performing point-feature detection and tracking entirely in-pixel ."}

data/sampled_jsons/33390_GUI-Xplore_Empowering_Generalizable_GUI_Agents_with_One_Exploration.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "GUI-Xplore: Empowering Generalizable GUI Agents with One Exploration", "date": "", "ddg_snippet": "GUI agents hold significant potential to enhance the experience and efficiency of human-device interaction. However, current methods face challenges in generalizing across applications (apps) and tasks, primarily due to two fundamental limitations in existing datasets. First, these datasets overlook developer-induced structural variations among apps, limiting the transferability of knowledge ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2503.17709", "content": "GUI agents hold significant potential to enhance the experience and efficiency of human-device interaction. However, current methods face challenges in generalizing across applications (apps) and tasks, primarily due to two fundamental limitations in existing datasets. First, these datasets overlook developer-induced structural variations among apps, limiting the transferability of knowledge ..."}
+{"idx": 1, "title": "GitHub - 921112343/GUI-Xplore: [CVPR 2025] GUI-Xplore: Empowering ...", "date": "", "ddg_snippet": "GUI - Xplore is a novel dataset designed to enhance cross-application and cross-task generalization for GUI agents . It provides exploration videos for diverse applications, combined with five structured downstream tasks, aiming to push the boundaries of generalizable GUI automation.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/921112343/GUI-Xplore", "content": "GUI - Xplore is a novel dataset designed to enhance cross-application and cross-task generalization for GUI agents . It provides exploration videos for diverse applications, combined with five structured downstream tasks, aiming to push the boundaries of generalizable GUI automation."}
+{"idx": 2, "title": "GUI-Xplore: Empowering Generalizable GUI Agents with One Exploration", "date": "", "ddg_snippet": "GUI - Xplore integrates pre-recorded exploration videos providing contextual insights, alongside five hierarchically structured downstream tasks designed to comprehensively evaluate GUI agent capabilities.", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/html/Sun_GUI-Xplore_Empowering_Generalizable_GUI_Agents_with_One_Exploration_CVPR_2025_paper.html", "content": "GUI - Xplore integrates pre-recorded exploration videos providing contextual insights, alongside five hierarchically structured downstream tasks designed to comprehensively evaluate GUI agent capabilities."}
+{"idx": 3, "title": "GUI-Xplore: Empowering Generalizable GUI Agents with One Exploration ...", "date": "", "ddg_snippet": "Further experiments indicate that Xplore - Agent achieves a 10% improvement over existing methods in unfamiliar environments, yet there remains significant potential for further enhancement towards truly generalizable GUI agents .", "subpage_snippet": "", "source": "www.alphaxiv.org", "link": "https://www.alphaxiv.org/overview/2503.17709v1", "content": "Further experiments indicate that Xplore - Agent achieves a 10% improvement over existing methods in unfamiliar environments, yet there remains significant potential for further enhancement towards truly generalizable GUI agents ."}
+{"idx": 4, "title": "Visual Agents at CVPR 2025 - Voxel51", "date": "", "ddg_snippet": "The Visual Agent papers from CVPR I'm most excited about are: From Multimodal LLMs to Generalist Embodied Agents : Methods and Lessons ShowUI: One Vision-Language-Action Model for GUI Visual Agent GUI - Xplore : Empowering Generalizable GUI Agents with One Exploration SpiritSight Agent : Advanced GUI Agent with One Look", "subpage_snippet": "", "source": "voxel51.com", "link": "https://voxel51.com/blog/visual-agents-at-cvpr-2025", "content": "The Visual Agent papers from CVPR I'm most excited about are: From Multimodal LLMs to Generalist Embodied Agents : Methods and Lessons ShowUI: One Vision-Language-Action Model for GUI Visual Agent GUI - Xplore : Empowering Generalizable GUI Agents with One Exploration SpiritSight Agent : Advanced GUI Agent with One Look"}
+{"idx": 5, "title": "GUI-Xplore: Empowering Generalizable GUI Agents with One Exploration", "date": "", "ddg_snippet": "GUI - Xplore in-tegrates pre-recorded exploration videos providing contex-tual insights, alongside five hierarchically structured down-stream tasks designed to comprehensively evaluate GUI agent capabilities.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2503.17709", "content": "GUI - Xplore in-tegrates pre-recorded exploration videos providing contex-tual insights, alongside five hierarchically structured down-stream tasks designed to comprehensively evaluate GUI agent capabilities."}
+{"idx": 6, "title": "GUI-Xplore: Empowering Generalizable GUI Agents with One Exploration ...", "date": "", "ddg_snippet": "The paper introduces GUI - Xplore , a new dataset aimed at improving how computer programs understand and interact with different apps by watching recorded user interactions ( exploration videos). It ...", "subpage_snippet": "", "source": "bytez.com", "link": "https://bytez.com/docs/cvpr/33390/paper", "content": "The paper introduces GUI - Xplore , a new dataset aimed at improving how computer programs understand and interact with different apps by watching recorded user interactions ( exploration videos). It ..."}
+{"idx": 7, "title": "GUI-Xplore/README.md at main · 921112343/GUI-Xplore · GitHub", "date": "", "ddg_snippet": "GUI - Xplore is a novel dataset designed to enhance cross-application and cross-task generalization for GUI agents . It provides exploration videos for diverse applications, combined with five structured downstream tasks, aiming to push the boundaries of generalizable GUI automation.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/921112343/GUI-Xplore/blob/main/README.md", "content": "GUI - Xplore is a novel dataset designed to enhance cross-application and cross-task generalization for GUI agents . It provides exploration videos for diverse applications, combined with five structured downstream tasks, aiming to push the boundaries of generalizable GUI automation."}
+{"idx": 8, "title": "GUI-Xplore: Empowering Generalizable GUI Agents with One Exploration ...", "date": "", "ddg_snippet": "GUI - Xplore represents a significant step forward in developing flexible, generalizable GUI agents that can adapt to diverse applications. By demonstrating that a single exploration session can provide sufficient understanding for effective task completion, the research challenges the assumption that extensive app-specific training is necessary.", "subpage_snippet": "", "source": "www.aimodels.fyi", "link": "https://www.aimodels.fyi/papers/arxiv/gui-xplore-empowering-generalizable-gui-agents-one", "content": "GUI - Xplore represents a significant step forward in developing flexible, generalizable GUI agents that can adapt to diverse applications. By demonstrating that a single exploration session can provide sufficient understanding for effective task completion, the research challenges the assumption that extensive app-specific training is necessary."}
+{"idx": 9, "title": "PDF GUI-Xplore: Empowering Generalizable GUI Agents with One Exploration ...", "date": "", "ddg_snippet": "y videos in the GUI - Xplore dataset aim to achieve comprehensive coverag of software pages. How-ever, in practical apps, full page coverage is often unattain-able. To examine the impact of varying exploration cov-erage rates on Xplore - Agent's reasoning accuracy, we con-ducted additional experiments focusing exclusively on tasks unrelate", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/supplemental/Sun_GUI-Xplore_Empowering_Generalizable_CVPR_2025_supplemental.pdf", "content": "y videos in the GUI - Xplore dataset aim to achieve comprehensive coverag of software pages. How-ever, in practical apps, full page coverage is often unattain-able. To examine the impact of varying exploration cov-erage rates on Xplore - Agent's reasoning accuracy, we con-ducted additional experiments focusing exclusively on tasks unrelate"}

data/sampled_jsons/33775_Instant_Gaussian_Stream_Meeting_Room_Dataset_Table_2_storage_efficiency_Ours-s_3DGStream[51]†_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "CVPR Poster Instant Gaussian Stream", "date": "", "ddg_snippet": "For the Meeting Room dataset , we train the Gaussians of the first frame ... Our method outperforms 3DGStream in rendering quality, train time, and storage ...", "subpage_snippet": "", "source": "cvpr.thecvf.com", "link": "https://cvpr.thecvf.com/virtual/2025/poster/33775", "content": "For the Meeting Room dataset , we train the Gaussians of the first frame ... Our method outperforms 3DGStream in rendering quality, train time, and storage ..."}
+{"idx": 1, "title": "Ways to Watch the NFL | TV, Streaming & Radio | NFL.com", "date": "", "ddg_snippet": "ESPN is the exclusive home of the NFL' s Monday Night Football. On ESPN Deportes, Monday Night Football is broadcast live via streaming through computers, smartphones, tablets, and connected TV ...", "subpage_snippet": "", "source": "www.nfl.com", "link": "https://www.nfl.com/ways-to-watch/by-device", "content": "ESPN is the exclusive home of the NFL' s Monday Night Football. On ESPN Deportes, Monday Night Football is broadcast live via streaming through computers, smartphones, tablets, and connected TV ..."}
+{"idx": 2, "title": "Ways to Watch the NFL | TNF, SNF & MNF | NFL.com", "date": "", "ddg_snippet": "ESPN is the exclusive home of the NFL' s Monday Night Football. On ESPN Deportes, Monday Night Football is broadcast live via streaming through computers, smartphones, tablets, and connected TV ...", "subpage_snippet": "", "source": "www.nfl.com", "link": "https://www.nfl.com/ways-to-watch/by-day", "content": "ESPN is the exclusive home of the NFL' s Monday Night Football. On ESPN Deportes, Monday Night Football is broadcast live via streaming through computers, smartphones, tablets, and connected TV ..."}
+{"idx": 3, "title": "NFL Monday Night Football Schedule on ESPN | NFL.com", "date": "", "ddg_snippet": "Get the 2024 Monday Night Football Schedule. See which teams are playing this Monday or plan your Football Mondays for the entire NFL season.", "subpage_snippet": "", "source": "www.nfl.com", "link": "https://www.nfl.com/schedules/monday-night-football/", "content": "Get the 2024 Monday Night Football Schedule. See which teams are playing this Monday or plan your Football Mondays for the entire NFL season."}
+{"idx": 4, "title": "NFL 2025 - WEEK 3 Schedule | NFL.com", "date": "", "ddg_snippet": "In Week 18, two games will be played on Saturday (4:30 PM ET and 8:00 PM ET) with the remainder to be played either on Thursday night (8:15 PM ET), Sunday afternoon (1:00 PM ET and 4:25 PM ET), or ...", "subpage_snippet": "", "source": "www.nfl.com", "link": "https://www.nfl.com/schedules/", "content": "In Week 18, two games will be played on Saturday (4:30 PM ET and 8:00 PM ET) with the remainder to be played either on Thursday night (8:15 PM ET), Sunday afternoon (1:00 PM ET and 4:25 PM ET), or ..."}
+{"idx": 5, "title": "NFL.com | Official Site of the National Football League", "date": "", "ddg_snippet": "Jul 30, 2007 · What to watch for in Lions-Ravens on 'Monday Night Football' NFL+: Watch post-Week 3 press conferences! Niners' Bosa believed to have suffered torn ACL in win over Cardinals", "subpage_snippet": "", "source": "www.nfl.com", "link": "https://www.nfl.com/", "content": "Jul 30, 2007 · What to watch for in Lions-Ravens on 'Monday Night Football' NFL+: Watch post-Week 3 press conferences! Niners' Bosa believed to have suffered torn ACL in win over Cardinals"}
+{"idx": 6, "title": "Live NFL Scores for 2025 - Week 3 | NFL.com", "date": "", "ddg_snippet": "Football iconFacebook logo Instagram logo Snapchat logo YouTube logo TikTok logo Spotify logo LinkedIn logo Grid icon Key icon", "subpage_snippet": "", "source": "www.nfl.com", "link": "https://www.nfl.com/scores/", "content": "Football iconFacebook logo Instagram logo Snapchat logo YouTube logo TikTok logo Spotify logo LinkedIn logo Grid icon Key icon"}
+{"idx": 7, "title": "How to access LIVE NFL Regular Season games? – NFL", "date": "", "ddg_snippet": "Aug 25, 2025 · Includes Sunday Night Football, Monday Night Football, Thursday Night Football, NFL Network games, and select Saturday games. Full and condensed game replays are available on all devices, including connected TVs.", "subpage_snippet": "", "source": "support.nfl.com", "link": "https://support.nfl.com/hc/en-us/articles/40568374746644-How-to-access-LIVE-NFL-Regular-Season-games", "content": "Aug 25, 2025 · Includes Sunday Night Football, Monday Night Football, Thursday Night Football, NFL Network games, and select Saturday games. Full and condensed game replays are available on all devices, including connected TVs."}
+{"idx": 8, "title": "Vikings-Bears on 'Monday Night Football': What We Learned from...", "date": "", "ddg_snippet": "Sep 9, 2025 · Following a woeful first three quarters, J.J. McCarthy rallied the Minnesota Vikings to a dramatic win over Caleb Williams and the Chicago Bears on Monday night in his first NFL game.", "subpage_snippet": "", "source": "www.nfl.com", "link": "https://www.nfl.com/news/vikings-bears-on-monday-night-football-what-we-learned-from-minnesota-s-27-24-win", "content": "Sep 9, 2025 · Following a woeful first three quarters, J.J. McCarthy rallied the Minnesota Vikings to a dramatic win over Caleb Williams and the Chicago Bears on Monday night in his first NFL game."}
+{"idx": 9, "title": "Sunday Night Football Schedule | NFL.com", "date": "", "ddg_snippet": "Get the Sunday Night Football Schedule. See which teams are playing this week or plan your Sunday football for the entire NFL season.", "subpage_snippet": "", "source": "www.nfl.com", "link": "https://www.nfl.com/schedules/sunday-night-football/", "content": "Get the Sunday Night Football Schedule. See which teams are playing this week or plan your Sunday football for the entire NFL season."}

data/sampled_jsons/4uOEiitySn_A_Checks-and-Balances_Framework_Context-Aware_Ethical_AI_Alignment.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Artificial Intelligence Act - Wikipedia", "date": "", "ddg_snippet": "The Artificial Intelligence Act is a European Union regulation concerning artificial intelligence. It establishes a common regulatory and legal framework for AI within the European Union. It came into force on 1 August 2024...", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/Artificial_Intelligence_Act", "content": "The Artificial Intelligence Act is a European Union regulation concerning artificial intelligence. It establishes a common regulatory and legal framework for AI within the European Union. It came into force on 1 August 2024..."}
+{"idx": 1, "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...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2502.00136", "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..."}
+{"idx": 2, "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": 3, "title": "A Three-Branch Checks - and - Balances Framework", "date": "", "ddg_snippet": "A Three-Branch Checks - and - Balances Framework for Context - Aware Ethical Alignment of Large Language Models.This work presents a three-branch framework for ethical AI behavior, inspired by governmental checks and balances , centered on the DIKE-ERIS duality.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=o2afWIxjKD", "content": "A Three-Branch Checks - and - Balances Framework for Context - Aware Ethical Alignment of Large Language Models.This work presents a three-branch framework for ethical AI behavior, inspired by governmental checks and balances , centered on the DIKE-ERIS duality."}
+{"idx": 4, "title": "(PDF) A Three-Branch Checks - and - Balances Framework for...", "date": "", "ddg_snippet": "This work , which will be presented at NeurIPS this week, proposes a paradigm shift: using three LLM modules to perform checks and balances to represent knowledge, legislative, and judicial functions.", "subpage_snippet": "", "source": "www.linkedin.com", "link": "https://www.linkedin.com/posts/edward-y-chang-218b182_pdf-a-three-branch-checks-and-balances-activity-7272792943923458050-RO6k", "content": "This work , which will be presented at NeurIPS this week, proposes a paradigm shift: using three LLM modules to perform checks and balances to represent knowledge, legislative, and judicial functions."}
+{"idx": 5, "title": "Context - aware Prompt Adaptation: AI ’s Next Frontier - Artificial...", "date": "", "ddg_snippet": "Adopting context - aware AI requires more trust in AI technology. We’re moving from detailed instructions to letting AI figure things out on its own. This shift needs faith in AI ’s ability to understand and respond to context. Even with minimal prompts, human creativity is still key.", "subpage_snippet": "", "source": "esoftskills.com", "link": "https://esoftskills.com/ai/context-aware-prompt-adaptation/", "content": "Adopting context - aware AI requires more trust in AI technology. We’re moving from detailed instructions to letting AI figure things out on its own. This shift needs faith in AI ’s ability to understand and respond to context. Even with minimal prompts, human creativity is still key."}
+{"idx": 6, "title": "Human Ai Test for Ai Alignment | Restackio", "date": "", "ddg_snippet": "Explore the human AI test and its significance in AI alignment , ensuring ethical and effective AI development.Research and Development: Continuous efforts to enhance contextual awareness in AI .", "subpage_snippet": "", "source": "d2wozrt205r2fu.cloudfront.net", "link": "https://d2wozrt205r2fu.cloudfront.net/p/ai-alignment-answer-human-ai-test-cat-ai", "content": "Explore the human AI test and its significance in AI alignment , ensuring ethical and effective AI development.Research and Development: Continuous efforts to enhance contextual awareness in AI ."}
+{"idx": 7, "title": "The Gardener’s Guide to AI Alignment : A New Paradigm of... | Medium", "date": "", "ddg_snippet": "The field of AI Alignment is built on a simple, terrifying premise: an AI does not need to be malicious to be catastrophic. The central fear is one of misaligned competence. The classic thought experiment, the “Paperclip Maximizer,” illustrates this perfectly.", "subpage_snippet": "", "source": "medium.com", "link": "https://medium.com/@dom.pennock/the-gardeners-guide-to-ai-alignment-a-new-paradigm-of-emergent-culture-408687c3531c", "content": "The field of AI Alignment is built on a simple, terrifying premise: an AI does not need to be malicious to be catastrophic. The central fear is one of misaligned competence. The classic thought experiment, the “Paperclip Maximizer,” illustrates this perfectly."}
+{"idx": 8, "title": "Third Way Alignment - Ethical AI Coexistence", "date": "", "ddg_snippet": "A New Approach to AI Ethics . Third Way Alignment : AI Coexistence. Moving beyond fear and control toward mutual respect, shared flourishing, and ethical partnership between humans and artificial intelligence.", "subpage_snippet": "", "source": "thirdwayalignment.com", "link": "https://thirdwayalignment.com/", "content": "A New Approach to AI Ethics . Third Way Alignment : AI Coexistence. Moving beyond fear and control toward mutual respect, shared flourishing, and ethical partnership between humans and artificial intelligence."}
+{"idx": 9, "title": "Design and Evaluation Methods for LLM-Based Explainable AI", "date": "", "ddg_snippet": "Visualization and intuitiveness of explanation. Interactivity and controllability. Context awareness and adaptability. Feedback mechanism.", "subpage_snippet": "", "source": "www.oajaiml.com", "link": "https://www.oajaiml.com/uploads/archivepdf/430552340.pdf", "content": "Visualization and intuitiveness of explanation. Interactivity and controllability. Context awareness and adaptability. Feedback mechanism."}

data/sampled_jsons/6ojzpDczIY_Global_Optimization_with_a_Power-Transformed_Objective_and_Gaussian_Smoothing_Rosenbrock_.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Global Optimization with a Power-Transformed Objective and Gaussian ...", "date": "", "ddg_snippet": "Abstract We propose a novel method, namely Gaussian Smoothing with a Power-Transformed Objective (GS-PowerOpt), that solves global optimization problems in two steps: (1) perform a (exponen-tial) power-N transformation to the not necessar-Rd ! ily differentiable objective f : and get R fN, and (2) optimize the Gaussian -smoothed fN with stochastic approximations. Under mild con-ditions on f ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=6ojzpDczIY", "content": "Abstract We propose a novel method, namely Gaussian Smoothing with a Power-Transformed Objective (GS-PowerOpt), that solves global optimization problems in two steps: (1) perform a (exponen-tial) power-N transformation to the not necessar-Rd ! ily differentiable objective f : and get R fN, and (2) optimize the Gaussian -smoothed fN with stochastic approximations. Under mild con-ditions on f ..."}
+{"idx": 1, "title": "Global Optimization with A Power-Transformed Objective and Gaussian ...", "date": "", "ddg_snippet": "We propose a novel method that solves global optimization problems in two steps: (1) perform a (exponential) power - N transformation to the not-necessarily differentiable objective function f and get f_N, and (2) optimize the Gaussian -smoothed f_N with stochastic approximations. Under mild conditions on f, for any \\delta>0, we prove that with a sufficiently large power N_\\delta, this method ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2412.05204", "content": "We propose a novel method that solves global optimization problems in two steps: (1) perform a (exponential) power - N transformation to the not-necessarily differentiable objective function f and get f_N, and (2) optimize the Gaussian -smoothed f_N with stochastic approximations. Under mild conditions on f, for any \\delta>0, we prove that with a sufficiently large power N_\\delta, this method ..."}
+{"idx": 2, "title": "Global Optimization with a Power-Transformed Objective and Gaussian ...", "date": "", "ddg_snippet": "Abstract: We propose a novel method, namely Gaussian Smoothing with a Power-Transformed Objective (GS-PowerOpt), that solves global optimization problems in two steps: (1) perform a (exponential) power - N transformation to the not necessarily differentiable objective f : R d → R and get f N , and (2) optimize the Gaussian -smoothed f N with stochastic approximations. Under mild conditions on ...", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/chen-research/GS-PowerTransform", "content": "Abstract: We propose a novel method, namely Gaussian Smoothing with a Power-Transformed Objective (GS-PowerOpt), that solves global optimization problems in two steps: (1) perform a (exponential) power - N transformation to the not necessarily differentiable objective f : R d → R and get f N , and (2) optimize the Gaussian -smoothed f N with stochastic approximations. Under mild conditions on ..."}
+{"idx": 3, "title": "dblp: Global Optimization with A Power-Transformed Objective and ...", "date": "", "ddg_snippet": "Bibliographic details on Global Optimization with A Power-Transformed Objective and Gaussian Smoothing .", "subpage_snippet": "", "source": "dblp.org", "link": "https://dblp.org/rec/journals/corr/abs-2412-05204", "content": "Bibliographic details on Global Optimization with A Power-Transformed Objective and Gaussian Smoothing ."}
+{"idx": 4, "title": "Global Optimization with A Power-Transformed Objective and Gaussian ...", "date": "", "ddg_snippet": "We propose a novel method that solves global optimization problems in two steps: (1) perform a (exponential) power-$N$ transformation to the not-necessarily differentiable objective function $f$ and get $f_N$, and (2) optimize the Gaussian -smoothed $f_N$ with stochastic approximations.", "subpage_snippet": "", "source": "ui.adsabs.harvard.edu", "link": "https://ui.adsabs.harvard.edu/abs/2024arXiv241205204X/abstract", "content": "We propose a novel method that solves global optimization problems in two steps: (1) perform a (exponential) power-$N$ transformation to the not-necessarily differentiable objective function $f$ and get $f_N$, and (2) optimize the Gaussian -smoothed $f_N$ with stochastic approximations."}
+{"idx": 5, "title": "GlobalOptimizationwithAPower-Transformed ObjectiveandGaussianSmoothing", "date": "", "ddg_snippet": "We propose a novel method that solves global optimization problems in two steps: (1) perform a (exponential) power-N transformation to the not-necessarily differen-tiable objective function f to obtain fN, and (2) optimize the Gaussian -smoothed fN with stochastic approximations. Under mild conditions on f, for any δ > 0, we prove that with a sufficiently large power Nδ, this method converges ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2412.05204v1", "content": "We propose a novel method that solves global optimization problems in two steps: (1) perform a (exponential) power-N transformation to the not-necessarily differen-tiable objective function f to obtain fN, and (2) optimize the Gaussian -smoothed fN with stochastic approximations. Under mild conditions on f, for any δ > 0, we prove that with a sufficiently large power Nδ, this method converges ..."}
+{"idx": 6, "title": "PDF Deterministic global optimization with Gaussian processes embedded", "date": "", "ddg_snippet": "These optimization problems are nonconvex and global optimization is desired. However, previous literature observed computational burdens limiting deterministic global opti-mization to Gaussian processes trained on few data points. We propose a reduced-space formulation for deterministic global optimization with trained Gaussian processes embedded.", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/content/pdf/10.1007/s12532-021-00204-y.pdf", "content": "These optimization problems are nonconvex and global optimization is desired. However, previous literature observed computational burdens limiting deterministic global opti-mization to Gaussian processes trained on few data points. We propose a reduced-space formulation for deterministic global optimization with trained Gaussian processes embedded."}
+{"idx": 7, "title": "PDF Global Optimization with a Power-Transformed Objective and Gaussian ...", "date": "", "ddg_snippet": "The Problem to Solve We propose a novel method, namely Gaussian Smoothing with a Power-Transformed Objective (GS-PowerOpt), that solves the following continuous optimization problems max f (x),", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/media/icml-2025/Slides/46360_JdTUNKo.pdf", "content": "The Problem to Solve We propose a novel method, namely Gaussian Smoothing with a Power-Transformed Objective (GS-PowerOpt), that solves the following continuous optimization problems max f (x),"}
+{"idx": 8, "title": "Global Optimization with A Power-Transformed Objective and Gaussian ...", "date": "", "ddg_snippet": "The power-transformed objective with Gaussian smoothing represents a significant advance in global optimization . The method offers practical benefits for machine learning and statistical applications while maintaining theoretical rigor.", "subpage_snippet": "", "source": "www.aimodels.fyi", "link": "https://www.aimodels.fyi/papers/arxiv/global-optimization-power-transformed-objective-gaussian-smoothing", "content": "The power-transformed objective with Gaussian smoothing represents a significant advance in global optimization . The method offers practical benefits for machine learning and statistical applications while maintaining theoretical rigor."}
+{"idx": 9, "title": "Revisions | OpenReview", "date": "", "ddg_snippet": "12 Aug 2025, 20:24 Pacific Daylight Time TLDR: We propose a zeroth-order method for optimizing a non-convex function , which applies Gaussian smoothing and Stochastic Gradient Ascent to the (exponential) power of the objective . Abstract:", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/revisions?id=6ojzpDczIY", "content": "12 Aug 2025, 20:24 Pacific Daylight Time TLDR: We propose a zeroth-order method for optimizing a non-convex function , which applies Gaussian smoothing and Stochastic Gradient Ascent to the (exponential) power of the objective . Abstract:"}

data/sampled_jsons/ACIDDnTbSJ_Feint_Behaviors_and_Strategies_Formalization_Figure_4_MASAC_model.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Feint Behaviors and Strategies : Formalization , Implementation and...", "date": "", "ddg_snippet": "Such behaviors are crucial tactics in most competitive multi-player games (e.g., boxing, fencing, basketball, motor racing, etc.). However, existing literature does not provide a comprehensive (and/or concrete) formalization for Feint behaviors , and their implications on game strategies .", "subpage_snippet": "", "source": "papers.cool", "link": "https://papers.cool/venue/ACIDDnTbSJ@OpenReview", "content": "Such behaviors are crucial tactics in most competitive multi-player games (e.g., boxing, fencing, basketball, motor racing, etc.). However, existing literature does not provide a comprehensive (and/or concrete) formalization for Feint behaviors , and their implications on game strategies ."}
+{"idx": 1, "title": "Abstract page for arXiv paper 2403.07932: Feint in Multi-Player Games", "date": "", "ddg_snippet": "Our work first formalizes Feint from the perspective of Multi-Player Games, in terms of the temporal, spatial, and their collective impacts. The formalization is built upon Non-transitive Active Markov Game Model , where Feint can have a considerable amount of impacts.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2403.07932", "content": "Our work first formalizes Feint from the perspective of Multi-Player Games, in terms of the temporal, spatial, and their collective impacts. The formalization is built upon Non-transitive Active Markov Game Model , where Feint can have a considerable amount of impacts."}
+{"idx": 2, "title": "Feint Behaviors and Strategies : Formalization , Implementation and...", "date": "", "ddg_snippet": "# The Dual- Behavior Model is a crucial concept for integrating feint behaviors into game strategies . Figure 4 : Comparison of Game Reward when using Feint and not using Feint in a 1 VS 1 scenario.", "subpage_snippet": "", "source": "deep-diver.github.io", "link": "https://deep-diver.github.io/neurips2024/posters/aciddntbsj/", "content": "# The Dual- Behavior Model is a crucial concept for integrating feint behaviors into game strategies . Figure 4 : Comparison of Game Reward when using Feint and not using Feint in a 1 VS 1 scenario."}
+{"idx": 3, "title": "Borderlands 4 Frank the Furnace Location, Route and Loot Drops", "date": "", "ddg_snippet": "Boss behavior and fight strategy . Frank the Furnace specializes in strong furnace and flamethrower-based attacks covering wide areas.", "subpage_snippet": "", "source": "nerdschalk.com", "link": "https://nerdschalk.com/borderlands-4-frank-the-furnace-location-route-and-loot-drops/", "content": "Boss behavior and fight strategy . Frank the Furnace specializes in strong furnace and flamethrower-based attacks covering wide areas."}
+{"idx": 4, "title": "How to Create a Python Trading Bot and Implement a Secure License...", "date": "", "ddg_snippet": "Supports Different Licensing Models : Facilitates offering various features or usage limits based on license type. Overview of the Article: Building a Secure Trading Bot. We’ll cover the following key areas", "subpage_snippet": "", "source": "trading-strategies.academy", "link": "https://trading-strategies.academy/archives/1661", "content": "Supports Different Licensing Models : Facilitates offering various features or usage limits based on license type. Overview of the Article: Building a Secure Trading Bot. We’ll cover the following key areas"}
+{"idx": 5, "title": "Rationalizable Strategic Behavior and the Problem of Perfection on...", "date": "", "ddg_snippet": "Strategy profiles that are rationalizable are not always Nash equilibria; conversely, the information in an extensive form game often allows certain \"unreasonable\" Nash equilibria to be excluded from the set of rationalizable profiles.", "subpage_snippet": "", "source": "www.jstor.org", "link": "https://www.jstor.org/stable/1911197", "content": "Strategy profiles that are rationalizable are not always Nash equilibria; conversely, the information in an extensive form game often allows certain \"unreasonable\" Nash equilibria to be excluded from the set of rationalizable profiles."}
+{"idx": 6, "title": "Junyu LIU - Google Scholar", "date": "", "ddg_snippet": "Feint behaviors and strategies : formalization , implementation and evaluation.", "subpage_snippet": "", "source": "scholar.google.com", "link": "https://scholar.google.com/citations?user=EiSrD1UAAAAJ&hl=en", "content": "Feint behaviors and strategies : formalization , implementation and evaluation."}
+{"idx": 7, "title": "New Jepang Viral Phenomenon Of ABG Viral SMA 2025... - Video Viral", "date": "", "ddg_snippet": "Stay informed, stay connected, and leverage viral trends to enhance your marketing, SEO strategies , and content development efforts. Visit videoviral.baby today and never miss the latest viral sensation!", "subpage_snippet": "", "source": "videoviral.baby", "link": "https://videoviral.baby/new-jepang-viral-phenomenon-of-abg-viral-sma-2025-kak-zahra-tutorial-wiwik-dalam-mobil-di-tempat-parkir-one-for-all-indonesia/", "content": "Stay informed, stay connected, and leverage viral trends to enhance your marketing, SEO strategies , and content development efforts. Visit videoviral.baby today and never miss the latest viral sensation!"}
+{"idx": 8, "title": "dblp: List of computer science publications by Xiangjun Peng", "date": "", "ddg_snippet": "Junyu Liu, Xiangjun Peng: Feint Behaviors and Strategies : Formalization , Implementation and Evaluation. NeurIPS 2024.", "subpage_snippet": "", "source": "dblp.uni-trier.de", "link": "https://dblp.uni-trier.de/pid/123/5256.html", "content": "Junyu Liu, Xiangjun Peng: Feint Behaviors and Strategies : Formalization , Implementation and Evaluation. NeurIPS 2024."}
+{"idx": 9, "title": "Formalized Strategic Planning in Organizations - MBA Knowledge Base", "date": "", "ddg_snippet": "Strategic planning is an organization’s process of understanding its strategy and making decisions on where to allocate the companies resources in order to peruse the strategy .Problems Associated with Formalized Strategic Decision Making.", "subpage_snippet": "", "source": "www.mbaknol.com", "link": "https://www.mbaknol.com/strategic-management/formalized-strategic-planning-in-organizations/", "content": "Strategic planning is an organization’s process of understanding its strategy and making decisions on where to allocate the companies resources in order to peruse the strategy .Problems Associated with Formalized Strategic Decision Making."}

data/sampled_jsons/ACIDDnTbSJ_NeurIPS_2024_Feint_Behaviors_scheduler_weights_implementation_details.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "International Conference on Learning Representations - Wikipedia", "date": "", "ddg_snippet": "Machine learningand data mining. v. t. e. The International Conference on Learning Representations is a machine learning conference typically held in late April or early May each year. Along with NeurIPS and ICML...", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/International_Conference_on_Learning_Representations", "content": "Machine learningand data mining. v. t. e. The International Conference on Learning Representations is a machine learning conference typically held in late April or early May each year. Along with NeurIPS and ICML..."}
+{"idx": 1, "title": "Brown University · NeurIPS 2024", "date": "", "ddg_snippet": "RTify: Aligning Deep Neural Networks with Human Behavioral Decisions. 26 September 2024 ·1884 words·9 mins· loading. Feint Behaviors and Strategies: Formalization, Implementation and Evaluation.", "subpage_snippet": "", "source": "deep-diver.github.io", "link": "https://deep-diver.github.io/neurips2024/tags/-brown-university/", "content": "RTify: Aligning Deep Neural Networks with Human Behavioral Decisions. 26 September 2024 ·1884 words·9 mins· loading. Feint Behaviors and Strategies: Formalization, Implementation and Evaluation."}
+{"idx": 2, "title": "GitHub - CAMMA-public/PeskaVLP: [ NeurIPS '24 Spotlight]...", "date": "", "ddg_snippet": "[ NeurIPS 2024 ] Procedure-Aware Surgical Video-language Pretraining with Hierarchical Knowledge Augmentation. Kun Yuan, Vinkle Srivastav, Nassir Navab, Nicolas Padoy, NeurIPS 2024 . arXiv OpenReview.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/CAMMA-public/PeskaVLP", "content": "[ NeurIPS 2024 ] Procedure-Aware Surgical Video-language Pretraining with Hierarchical Knowledge Augmentation. Kun Yuan, Vinkle Srivastav, Nassir Navab, Nicolas Padoy, NeurIPS 2024 . arXiv OpenReview."}
+{"idx": 3, "title": "hide_event_type_ details only hides on first step. Expected behavior ?", "date": "", "ddg_snippet": "The behavior of `hide_event_type_ details ` seems a bit odd to me, is this expected behavior ?If I set `hideEventTypeDetails: true`, the event title, and event duration are hidden on step 1 and step 2, but not on step 3. It does seem valuable to show the user what they selected in step 3...", "subpage_snippet": "", "source": "community.calendly.com", "link": "https://community.calendly.com/api-webhook-help-61/hide-event-type-details-only-hides-on-first-step-expected-behavior-2159", "content": "The behavior of `hide_event_type_ details ` seems a bit odd to me, is this expected behavior ?If I set `hideEventTypeDetails: true`, the event title, and event duration are hidden on step 1 and step 2, but not on step 3. It does seem valuable to show the user what they selected in step 3..."}
+{"idx": 4, "title": "Complete PyTorch implementation of Selective Self-Attention...", "date": "", "ddg_snippet": "Weight Sharing: <0.5% parameter overhead through efficient weight reuse. ComfyUI Integration: Optimized for diffusion model workflows. Performance Highlights. 15-30% inference speedup with maintained quality. Consistent improvements across GPT-2, ...", "subpage_snippet": "", "source": "pypi.org", "link": "https://pypi.org/project/selective-self-attention/", "content": "Weight Sharing: <0.5% parameter overhead through efficient weight reuse. ComfyUI Integration: Optimized for diffusion model workflows. Performance Highlights. 15-30% inference speedup with maintained quality. Consistent improvements across GPT-2, ..."}
+{"idx": 5, "title": "2025 Conference", "date": "", "ddg_snippet": "2024 . 2023. 2021. NeurIPS announces a 2nd physical location in Mexico City and an affiliated meeting in Europe (EurIPS) for Dec 2025. (Press Releases). NeurIPS has released an LLM policy.", "subpage_snippet": "", "source": "neurips.cc", "link": "https://neurips.cc/", "content": "2024 . 2023. 2021. NeurIPS announces a 2nd physical location in Mexico City and an affiliated meeting in Europe (EurIPS) for Dec 2025. (Press Releases). NeurIPS has released an LLM policy."}
+{"idx": 6, "title": "Intern Sued by Byte for 8 Million Due to Malicious Attack Wins Best...", "date": "", "ddg_snippet": "1.4k. Recently, Tian Keyu has once again become the focus of attention due to a malicious attack incident during his internship at ByteDance. This Peking University intern won the Best Paper Award at NeurIPS 2024 for a paper he participated in during his internship at ByteDance...", "subpage_snippet": "", "source": "www.aibase.com", "link": "https://www.aibase.com/news/13687", "content": "1.4k. Recently, Tian Keyu has once again become the focus of attention due to a malicious attack incident during his internship at ByteDance. This Peking University intern won the Best Paper Award at NeurIPS 2024 for a paper he participated in during his internship at ByteDance..."}
+{"idx": 7, "title": "Outlook", "date": "", "ddg_snippet": "Autumn 2023 | Spring 2024 Card 4 Face to Face Programmes Login.", "subpage_snippet": "", "source": "outlook.office365.com", "link": "https://outlook.office365.com/", "content": "Autumn 2023 | Spring 2024 Card 4 Face to Face Programmes Login."}
+{"idx": 8, "title": "Tampa Bay Lightning Schedule | Tampa Bay Lightning", "date": "", "ddg_snippet": "Navigation Menu. Schedule . Community. Team.Youth Hockey. NHL.com. Schedule .", "subpage_snippet": "", "source": "www.nhl.com", "link": "https://www.nhl.com/lightning/schedule", "content": "Navigation Menu. Schedule . Community. Team.Youth Hockey. NHL.com. Schedule ."}
+{"idx": 9, "title": "Book tickets online now and fly out into the world | Discover Airlines", "date": "", "ddg_snippet": "Discover Airlines flies from Frankfurt and Munich to the most attractive destinations on short-, medium- and long-haul routes.", "subpage_snippet": "", "source": "www.discover-airlines.com", "link": "https://www.discover-airlines.com/", "content": "Discover Airlines flies from Frankfurt and Munich to the most attractive destinations on short-, medium- and long-haul routes."}

data/sampled_jsons/AECM_learning_rate_EntityErasure_supplementary.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "machinelearningmastery.com/understand-the-dynamics-of- learning ...", "date": "", "ddg_snippet": "the Impact of Learning Rate on Neural Network.", "subpage_snippet": "", "source": "machinelearningmastery.com", "link": "https://machinelearningmastery.com/understand-the-dynamics-of-learning-rate-on-deep-learning-neural-networks/", "content": "the Impact of Learning Rate on Neural Network."}
+{"idx": 1, "title": "Guide to Pytorch Learning Rate Scheduling", "date": "", "ddg_snippet": "Explore and run machine learning code with Kaggle Notebooks | Using data from No attached data sources.", "subpage_snippet": "", "source": "www.kaggle.com", "link": "https://www.kaggle.com/code/isbhargav/guide-to-pytorch-learning-rate-scheduling", "content": "Explore and run machine learning code with Kaggle Notebooks | Using data from No attached data sources."}
+{"idx": 2, "title": "GSPO Reinforcement Learning | Unsloth Documentation", "date": "", "ddg_snippet": "Reinforcement Learning - DPO, ORPO & KTO. New. Vision Reinforcement Learning (VLM RL). Unsloth Dynamic GGUFs on Aider Polyglot. Memory Efficient RL.", "subpage_snippet": "", "source": "docs.unsloth.ai", "link": "https://docs.unsloth.ai/get-started/reinforcement-learning-rl-guide/gspo-reinforcement-learning", "content": "Reinforcement Learning - DPO, ORPO & KTO. New. Vision Reinforcement Learning (VLM RL). Unsloth Dynamic GGUFs on Aider Polyglot. Memory Efficient RL."}
+{"idx": 3, "title": "Meta- learning with negative learning rates | OpenReview", "date": "", "ddg_snippet": "Deep learning models require a large amount of data to perform well. When data is scarce for a target task, we can transfer the knowledge gained by training on similar tasks to quickly learn the target.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=60j5LygnmD", "content": "Deep learning models require a large amount of data to perform well. When data is scarce for a target task, we can transfer the knowledge gained by training on similar tasks to quickly learn the target."}
+{"idx": 4, "title": "Video: Progettazione e costruzione di proteine aECM a matrice...", "date": "", "ddg_snippet": "Design and Construction of Artificial Extracellular Matrix ( aECM ) Proteins from Escherichia coli for Skin Tissue Engineering.Then transfer 10 milliliters of the starter culture into one liter of fresh and sterile TB media. Supplemented with the same antibiotics in a three liter erlin Meyer flask.", "subpage_snippet": "", "source": "www.jove.com", "link": "https://www.jove.com/it/v/52845/design-construction-artificial-extracellular-matrix-aecm-proteins", "content": "Design and Construction of Artificial Extracellular Matrix ( aECM ) Proteins from Escherichia coli for Skin Tissue Engineering.Then transfer 10 milliliters of the starter culture into one liter of fresh and sterile TB media. Supplemented with the same antibiotics in a three liter erlin Meyer flask."}
+{"idx": 5, "title": "Model Agnostic Meta- Learning made simple | InstaDeep...", "date": "", "ddg_snippet": "In this post, we introduce our first Meta-RL algorithm: MAML (Model-Agnostic Meta- Learning for Fast Adaptation of Deep Networks). With MAML, you can train agents that quickly adapt in almost any dense-reward environment. Let’s detail how it works.", "subpage_snippet": "", "source": "instadeep.com", "link": "https://instadeep.com/research/blog/model-agnostic-meta-learning-made-simple/", "content": "In this post, we introduce our first Meta-RL algorithm: MAML (Model-Agnostic Meta- Learning for Fast Adaptation of Deep Networks). With MAML, you can train agents that quickly adapt in almost any dense-reward environment. Let’s detail how it works."}
+{"idx": 6, "title": "Что такое глубокое машинное обучение (Deep Learning )... - «Plaan»", "date": "", "ddg_snippet": "Внутри ИИ находится машинное обучение (Machine Learning , ML) — подраздел, который использует статистические алгоритмы, чтобы дать компьютерам возможность обучаться на данных без явного программирования.", "subpage_snippet": "", "source": "plaan.ai", "link": "https://plaan.ai/deep-learning/", "content": "Внутри ИИ находится машинное обучение (Machine Learning , ML) — подраздел, который использует статистические алгоритмы, чтобы дать компьютерам возможность обучаться на данных без явного программирования."}
+{"idx": 7, "title": "L1 и L2 регуляризация в машинном обучении: эффективные методы", "date": "", "ddg_snippet": "Совмещение L2 регуляризации с другими техниками: Dropout, Batch NormalizationГрадуальное уменьшение регуляризации в процессе обучения ( learning rate scheduling)", "subpage_snippet": "", "source": "sky.pro", "link": "https://sky.pro/wiki/analytics/l1-i-l2-regulyarizatsiya-v-mashinnom-obuchenii-effektivnye-metody/", "content": "Совмещение L2 регуляризации с другими техниками: Dropout, Batch NormalizationГрадуальное уменьшение регуляризации в процессе обучения ( learning rate scheduling)"}
+{"idx": 8, "title": "Как обучить нейросеть на своих данных: пошаговый разбор", "date": "", "ddg_snippet": "Настройки learning rate — скорости обучения. Правильного выбора размера батча — сколько примеров показывать за раз. Подбора функции потерь и оптимизатора.", "subpage_snippet": "", "source": "scrile.ru", "link": "https://scrile.ru/obuchenie-neiroseti/", "content": "Настройки learning rate — скорости обучения. Правильного выбора размера батча — сколько примеров показывать за раз. Подбора функции потерь и оптимизатора."}
+{"idx": 9, "title": "CatBoost / Хабр", "date": "", "ddg_snippet": "# Создание и обучение модели model = CatBoostClassifier(iterations=100, learning _ rate =0.1) model.fit(X_train, y_train, verbose=False).", "subpage_snippet": "", "source": "habr.com", "link": "https://habr.com/ru/companies/otus/articles/778714/", "content": "# Создание и обучение модели model = CatBoostClassifier(iterations=100, learning _ rate =0.1) model.fit(X_train, y_train, verbose=False)."}

data/sampled_jsons/AERO_Table_1_learning_rate_Enhancing_Sharding_Blockchain_Deep_Reinforcement_Learning_for_Account_Mig_year_2025.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "AERO : Enhancing Sharding Blockchain via Deep Reinforcement ...", "date": "", "ddg_snippet": "Blockchain , Sharding , Account migration , Reinforcement learning . ACM Reference Format: Anonymous authors.Sender Shard Transaction Count. AERO : Enhancing Sharding Blockchain via Deep Reinforcement Learning for Account Migration .", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=WcuXvn3HVk", "content": "Blockchain , Sharding , Account migration , Reinforcement learning . ACM Reference Format: Anonymous authors.Sender Shard Transaction Count. AERO : Enhancing Sharding Blockchain via Deep Reinforcement Learning for Account Migration ."}
+{"idx": 1, "title": "AERO : Enhancing Sharding Blockchain via Deep Reinforcement ...", "date": "", "ddg_snippet": "Blockchain , Sharding , Account migration , Reinforcement learning . ∗Corresponding author.Sender Shard Transaction Count. AERO : Enhancing Sharding Blockchain via Deep Reinforcement Learning for Account Migration .", "subpage_snippet": "", "source": "zhenxiao.com", "link": "http://zhenxiao.com/papers/WWW_AERO_camera_ready.pdf", "content": "Blockchain , Sharding , Account migration , Reinforcement learning . ∗Corresponding author.Sender Shard Transaction Count. AERO : Enhancing Sharding Blockchain via Deep Reinforcement Learning for Account Migration ."}
+{"idx": 2, "title": "Peking University - Cited by 70 - Deep Learning - Google Scholar", "date": "", "ddg_snippet": "AERO : Enhancing sharding blockchain via deep reinforcement learning for account migration .", "subpage_snippet": "", "source": "scholar.google.com", "link": "https://scholar.google.com/citations?user=BdT5CzcAAAAJ&hl=en", "content": "AERO : Enhancing sharding blockchain via deep reinforcement learning for account migration ."}
+{"idx": 3, "title": "(PDF) Sharding for Blockchain based Mobile Edge Computing...", "date": "", "ddg_snippet": "AERO : Enhancing Sharding Blockchain via Deep Reinforcement Learning for Account Migration . Blockchain -Based Transformer-Assisted Multi-Agent Reinforcement Learning for Resource Allocation and Computation Offloading in 5G Private Networks.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/363131667_Sharding_for_Blockchain_based_Mobile_Edge_Computing_System_A_Deep_Reinforcement_Learning_Approach", "content": "AERO : Enhancing Sharding Blockchain via Deep Reinforcement Learning for Account Migration . Blockchain -Based Transformer-Assisted Multi-Agent Reinforcement Learning for Resource Allocation and Computation Offloading in 5G Private Networks."}
+{"idx": 4, "title": "MIT 6.S091: Introduction to Deep Reinforcement Learning ... - YouTube", "date": "", "ddg_snippet": "First lecture of MIT course 6.S091: Deep Reinforcement Learning , introducing the fascinating field of Deep RL.", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=zR11FLZ-O9M", "content": "First lecture of MIT course 6.S091: Deep Reinforcement Learning , introducing the fascinating field of Deep RL."}
+{"idx": 5, "title": "SmartChain: A Dynamic and Self-Adaptive Sharding Framework for...", "date": "", "ddg_snippet": "Learning Algorithm, Malicious Nodes, Deep Reinforcement Learning Agent, Byzantine Fault Tolerance, Successful Defense, Replay Memory, Blockchain Nodes, Internet Of Things Nodes, Message Authentication Code, Time Varying Environment, Shannons Information Theory...", "subpage_snippet": "", "source": "www.computer.org", "link": "https://www.computer.org/csdl/journal/sc/2024/02/10468552/1VpXOUcfXEs", "content": "Learning Algorithm, Malicious Nodes, Deep Reinforcement Learning Agent, Byzantine Fault Tolerance, Successful Defense, Replay Memory, Blockchain Nodes, Internet Of Things Nodes, Message Authentication Code, Time Varying Environment, Shannons Information Theory..."}
+{"idx": 6, "title": "Scalability of blockchain : Review of cross- sharding with high...", "date": "", "ddg_snippet": "During migration , account migration is required to guard against hostile nodes assaulting the system and execution errors. deep more scalable. and blockchain security and atomicity. learning with the proposed reinforcement - Blockchain transpare of cross- shard transactions.", "subpage_snippet": "", "source": "www.bio-conferences.org", "link": "https://www.bio-conferences.org/articles/bioconf/pdf/2024/16/bioconf_iscku2024_00075.pdf", "content": "During migration , account migration is required to guard against hostile nodes assaulting the system and execution errors. deep more scalable. and blockchain security and atomicity. learning with the proposed reinforcement - Blockchain transpare of cross- shard transactions."}
+{"idx": 7, "title": "LB-Chain: Load-Balanced and Low-Latency Blockchain Sharding via...", "date": "", "ddg_snippet": "Index Terms— Blockchain , blockchain sharding , load balance, account migration . First , how to propose an efcient and secure migration scheme in blockchain sharding ? To balance the load on different shards , account migration is required.", "subpage_snippet": "", "source": "cse.hkust.edu.hk", "link": "https://cse.hkust.edu.hk/~weiwa/papers/lb-chain-tpds22.pdf", "content": "Index Terms— Blockchain , blockchain sharding , load balance, account migration . First , how to propose an efcient and secure migration scheme in blockchain sharding ? To balance the load on different shards , account migration is required."}
+{"idx": 8, "title": "BlockEmulator: An Emulator Enabling to Test Blockchain Sharding ...", "date": "", "ddg_snippet": "In state sharding that adopts the account /balance-based transaction model, the blockchain system can be described as a structure consisting of a final committee and several worker shards . The final committee is also called the main shard .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2311.03612v3/", "content": "In state sharding that adopts the account /balance-based transaction model, the blockchain system can be described as a structure consisting of a final committee and several worker shards . The final committee is also called the main shard ."}
+{"idx": 9, "title": "Analysing and Improving Shard Allocation Protocols for Sharded...", "date": "", "ddg_snippet": "2021. Shard Scheduler: object placement and migration in sharded account -based blockchains . In Proceedings of the 3rd ACM Conference on Advances in Financial Technologies.", "subpage_snippet": "", "source": "eprint.iacr.org", "link": "https://eprint.iacr.org/2020/943.pdf", "content": "2021. Shard Scheduler: object placement and migration in sharded account -based blockchains . In Proceedings of the 3rd ACM Conference on Advances in Financial Technologies."}

data/sampled_jsons/A_Checks-and-Balances_Framework_for_Context-Aware_Ethical_AI_Alignment_dataset_empirical_study_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Justified Evidence Collection for Argument-based AI Fairness", "date": "", "ddg_snippet": "The increasing investment and demand for AI -enabled systems raises critical concerns about fairness, accountability, and transparency in the design ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2505.08064v1", "content": "The increasing investment and demand for AI -enabled systems raises critical concerns about fairness, accountability, and transparency in the design ..."}
+{"idx": 1, "title": "A Unified Framework for Evaluating the Effectiveness and", "date": "", "ddg_snippet": "... organized as follows: Section 2 provides an overview of earlier studies in this area, establishing the foundational work and context for our research.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2412.03884v2", "content": "... organized as follows: Section 2 provides an overview of earlier studies in this area, establishing the foundational work and context for our research."}
+{"idx": 2, "title": "Understanding Ethical Practices in AI: Insights from a", "date": "", "ddg_snippet": "Recent advances in AI applications have raised growing concerns about the need for ethical guidelines and regulations to mitigate the risks posed by ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2508.09219v1", "content": "Recent advances in AI applications have raised growing concerns about the need for ethical guidelines and regulations to mitigate the risks posed by ..."}
+{"idx": 3, "title": "Multi-level Value Alignment in Agentic AI Systems: Survey and", "date": "", "ddg_snippet": "This has brought significant attention to value alignment for agentic AI systems, which aims to ensure that an agent’s goals, preferences, and ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2506.09656v2", "content": "This has brought significant attention to value alignment for agentic AI systems, which aims to ensure that an agent’s goals, preferences, and ..."}
+{"idx": 4, "title": "Navigating the ethical landscape of AI... | F1000Research", "date": "", "ddg_snippet": "... an analysis of existing frameworks and current AI implementations in education, the paper calls for clear ethical guidelines to ensure the responsible ...", "subpage_snippet": "", "source": "f1000research.com", "link": "https://f1000research.com/articles/14-299", "content": "... an analysis of existing frameworks and current AI implementations in education, the paper calls for clear ethical guidelines to ensure the responsible ..."}
+{"idx": 5, "title": "AI Ethics Knowledge Among Chinese Teachers: An Empirical", "date": "", "ddg_snippet": "... a high priority on utilizing AI for educational reform, but the extent of teachers’ awareness of AI ethics , or the degree to which AI ethics are ...", "subpage_snippet": "", "source": "www.researchsquare.com", "link": "https://www.researchsquare.com/article/rs-7042877/v1", "content": "... a high priority on utilizing AI for educational reform, but the extent of teachers’ awareness of AI ethics , or the degree to which AI ethics are ..."}
+{"idx": 6, "title": "FAIR Enough: Develop and Assess a FAIR-Compliant Dataset for", "date": "", "ddg_snippet": "He holds an expert positions at the UN Economic Commission of Europe-Task Force for Digitalization in Energy, and is Technical Steering Committee ...", "subpage_snippet": "", "source": "direct.mit.edu", "link": "https://direct.mit.edu/dint/article/6/2/559/123375/FAIR-Enough-Develop-and-Assess-a-FAIR-Compliant", "content": "He holds an expert positions at the UN Economic Commission of Europe-Task Force for Digitalization in Energy, and is Technical Steering Committee ..."}
+{"idx": 7, "title": "(PDF) A Unified Framework for Human AI Collaboration in", "date": "", "ddg_snippet": "... article presents a structured framework for Human- AI collaboration in Security Operations Centers (SOCs), integrating AI autonomy, trust calibration, ...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/392204042_A_Unified_Framework_for_Human_AI_Collaboration_in_Security_Operations_Centers_with_Trusted_Autonomy", "content": "... article presents a structured framework for Human- AI collaboration in Security Operations Centers (SOCs), integrating AI autonomy, trust calibration, ..."}
+{"idx": 8, "title": "Responsible AI in NLP: GUS-Net Span-Level Bias Detection", "date": "", "ddg_snippet": "We introduce the GUS-Net Framework , comprising the GUS dataset and a multi-label token-level detector for span-level analysis of social bias.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2410.08388v5", "content": "We introduce the GUS-Net Framework , comprising the GUS dataset and a multi-label token-level detector for span-level analysis of social bias."}
+{"idx": 9, "title": "Perspectives on Managing AI Ethics in the Digital Age", "date": "", "ddg_snippet": "Feature papers are submitted upon individual invitation or recommendation by the scientific editors and must receive positive feedback from the ...", "subpage_snippet": "", "source": "www.mdpi.com", "link": "https://www.mdpi.com/2078-2489/16/4/318", "content": "Feature papers are submitted upon individual invitation or recommendation by the scientific editors and must receive positive feedback from the ..."}

data/sampled_jsons/A_Geometric_Approach_to_Personalized_Recommendation_with_Set-Theoretic_Constraints_Using_Box_Embeddi.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "A Geometric Approach to Personalized Recommendation with Set-Theoretic ...", "date": "", "ddg_snippet": "Queries involving set-theoretic constraints can be efficiently computed directly on the embedding space by performing geometric operations on the representations. We empirically demonstrate the superiority of box embeddings over vector-based neural methods on both simple and complex item recommendation queries by up to 30 \\% overall.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2502.10875", "content": "Queries involving set-theoretic constraints can be efficiently computed directly on the embedding space by performing geometric operations on the representations. We empirically demonstrate the superiority of box embeddings over vector-based neural methods on both simple and complex item recommendation queries by up to 30 \\% overall."}
+{"idx": 1, "title": "dblp: A Geometric Approach to Personalized Recommendation with Set ...", "date": "", "ddg_snippet": "Bibliographic details on A Geometric Approach to Personalized Recommendation with Set-Theoretic Constraints Using Box Embeddings .", "subpage_snippet": "", "source": "dblp.org", "link": "https://dblp.org/rec/journals/corr/abs-2502-10875", "content": "Bibliographic details on A Geometric Approach to Personalized Recommendation with Set-Theoretic Constraints Using Box Embeddings ."}
+{"idx": 2, "title": "A Geometric Approach to Personalized Recommendation with Set-Theoretic ...", "date": "", "ddg_snippet": "This research paper talks about improving how we recommend movies and other items to people based on their preferences, using a new approach called \" box embeddings .\" Traditional methods struggled ...", "subpage_snippet": "", "source": "bytez.com", "link": "https://bytez.com/docs/icml/46603/paper", "content": "This research paper talks about improving how we recommend movies and other items to people based on their preferences, using a new approach called \" box embeddings .\" Traditional methods struggled ..."}
+{"idx": 3, "title": "A Geometric Approach to Personalized Recommendation With Set T C U B ...", "date": "", "ddg_snippet": "t also naturally and faithfully support arbi-trary set-theoretic relationships. Queries involving set-theoretic constraints can be eficiently computed directly o the embedding space by performing geometric operations on the representations. We empirically demonstrate the superiority of box embeddings over vector-based neural meth 030 031", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=0HWAbWgI3T", "content": "t also naturally and faithfully support arbi-trary set-theoretic relationships. Queries involving set-theoretic constraints can be eficiently computed directly o the embedding space by performing geometric operations on the representations. We empirically demonstrate the superiority of box embeddings over vector-based neural meth 030 031"}
+{"idx": 4, "title": "PhD Thesis Defense: Shib Dasgupta, Box Embeddings as Set-theoretic ...", "date": "", "ddg_snippet": "To address this, I frame personalized item search as matrix completion with set-theoretic constraints , where both users and attributes are represented as hyper-rectangles (boxes). This enables the system to reason over complex, structured preferences in a principled and interpretable way.", "subpage_snippet": "", "source": "www.cics.umass.edu", "link": "https://www.cics.umass.edu/events/phd-thesis-defense-shib-dasgupta", "content": "To address this, I frame personalized item search as matrix completion with set-theoretic constraints , where both users and attributes are represented as hyper-rectangles (boxes). This enables the system to reason over complex, structured preferences in a principled and interpretable way."}
+{"idx": 5, "title": "Geometric Approach to Personalized Recommendation with Set-Theoretic ...", "date": "", "ddg_snippet": "Queries involving set-theoretic con-straints can be eficiently computed directly on the embedding space by performing geometric operations on the representations. We empirically demonstrate the superiority of box embeddings over vector-based neural methods on both simple and complex item recommendation queries by up to 30% overall.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2502.10875", "content": "Queries involving set-theoretic con-straints can be eficiently computed directly on the embedding space by performing geometric operations on the representations. We empirically demonstrate the superiority of box embeddings over vector-based neural methods on both simple and complex item recommendation queries by up to 30% overall."}
+{"idx": 6, "title": "Foundation Model for Personalized Recommendation | by Netflix ...", "date": "", "ddg_snippet": "For example, new title embeddings can be initialized by adding slight random noise to existing average embeddings or by using a weighted combination of similar titles' embeddings based on metadata. This approach allows new titles to start with relevant embeddings , facilitating faster fine-tuning.", "subpage_snippet": "", "source": "netflixtechblog.com", "link": "https://netflixtechblog.com/foundation-model-for-personalized-recommendation-1a0bd8e02d39", "content": "For example, new title embeddings can be initialized by adding slight random noise to existing average embeddings or by using a weighted combination of similar titles' embeddings based on metadata. This approach allows new titles to start with relevant embeddings , facilitating faster fine-tuning."}
+{"idx": 7, "title": "A Geometric Approach to Personalized Recommendation with Set-Theoretic ...", "date": "", "ddg_snippet": "Queries involving set-theoretic constraints can be efficiently computed directly on the embedding space by performing geometric operations on the representations. We empirically demonstrate the superiority of box embeddings over vector-based neural methods on both simple and complex item recommendation queries by up to 30% overall.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=0HWAbWgI3T", "content": "Queries involving set-theoretic constraints can be efficiently computed directly on the embedding space by performing geometric operations on the representations. We empirically demonstrate the superiority of box embeddings over vector-based neural methods on both simple and complex item recommendation queries by up to 30% overall."}
+{"idx": 8, "title": "GitHub Pages - Shib Dasgupta", "date": "", "ddg_snippet": "My work on Personalized Recommendation with Set-Theoretic Constraints explored attribute-aware recommendations , enhancing performance when user preferences follow set -based patterns. I also integrated box embeddings with transformer-based dual encoders, improving search and personalized recommendation performance (results coming soon).", "subpage_snippet": "", "source": "ssdasgupta.github.io", "link": "https://ssdasgupta.github.io/", "content": "My work on Personalized Recommendation with Set-Theoretic Constraints explored attribute-aware recommendations , enhancing performance when user preferences follow set -based patterns. I also integrated box embeddings with transformer-based dual encoders, improving search and personalized recommendation performance (results coming soon)."}
+{"idx": 9, "title": "The effect is less for the non-compounding error. - ResearchGate", "date": "", "ddg_snippet": "A Geometric Approach to Personalized Recommendation with Set-Theoretic Constraints Using Box Embeddings Preprint Full-text available Feb 2025 Shib Dasgupta Michael Boratko Andrew McCallum", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/figure/The-effect-is-less-for-the-non-compounding-error_fig4_389091382", "content": "A Geometric Approach to Personalized Recommendation with Set-Theoretic Constraints Using Box Embeddings Preprint Full-text available Feb 2025 Shib Dasgupta Michael Boratko Andrew McCallum"}

data/sampled_jsons/A_Likelihood_Based_Approach_to_Distribution_Regression_Figure_2_alpha_noise_variance.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "A Likelihood Based Approach to Distribution Regression ...", "date": "", "ddg_snippet": "2 Oct 2024 — When α 𝛼 \\ alpha italic_α is large, the noise variance is very small, and the perturbed data facilitates efficient estimation. Report issue for ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2410.02025v1", "content": "2 Oct 2024 — When α 𝛼 \\ alpha italic_α is large, the noise variance is very small, and the perturbed data facilitates efficient estimation. Report issue for ..."}
+{"idx": 1, "title": "A Likelihood Based Approach to Distribution Regression Using ...", "date": "", "ddg_snippet": "ity of the true data distribution . • When α is large, the noise variance is small, and the perturbed data facilitates efficient estimation. This observed ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=1IyPRv1A0r", "content": "ity of the true data distribution . • When α is large, the noise variance is small, and the perturbed data facilitates efficient estimation. This observed ..."}
+{"idx": 2, "title": "A Likelihood Based Approach to Distribution Regression ...", "date": "", "ddg_snippet": "The noise sequence follows a two -dimensional centered Gaussian distribution , ε ∼ N(02, σ2∗I2) . We investigated this setup across various noise variances ...", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/46645", "content": "The noise sequence follows a two -dimensional centered Gaussian distribution , ε ∼ N(02, σ2∗I2) . We investigated this setup across various noise variances ..."}
+{"idx": 3, "title": "A likelihood based approach to distribution regression ...", "date": "", "ddg_snippet": "by S Kumar · 2024 · Cited by 1 — A Likelihood Based Approach to Distribution Regression Using ... variance of noise by the factor α . When α is very small, indicating that ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2410.02025", "content": "by S Kumar · 2024 · Cited by 1 — A Likelihood Based Approach to Distribution Regression Using ... variance of noise by the factor α . When α is very small, indicating that ..."}
+{"idx": 4, "title": "Likelihood-ratio-based confidence intervals for neural ...", "date": "", "ddg_snippet": "by L Sluijterman · 2025 · Cited by 1 — This paper introduces a first implementation of a novel likelihood -ratio- based approach for constructing confidence intervals for neural networks.", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/article/10.1007/s10994-024-06639-3", "content": "by L Sluijterman · 2025 · Cited by 1 — This paper introduces a first implementation of a novel likelihood -ratio- based approach for constructing confidence intervals for neural networks."}
+{"idx": 5, "title": "A Likelihood Approach to Nonparametric Estimation of a ...", "date": "", "ddg_snippet": "by M Chae · 2023 · Cited by 33 — We investigate statistical properties of a likelihood approach to nonparametric estimation of a singular distribution using deep generative models. 42 pages", "subpage_snippet": "", "source": "www.jmlr.org", "link": "https://www.jmlr.org/papers/volume24/21-1099/21-1099.pdf", "content": "by M Chae · 2023 · Cited by 33 — We investigate statistical properties of a likelihood approach to nonparametric estimation of a singular distribution using deep generative models. 42 pages"}
+{"idx": 6, "title": "Statistical Methods: Likelihood, Bayes and Regression", "date": "", "ddg_snippet": "by K Strimmer · 2023 · Cited by 3 — In the beta-binomial model the likelihood is based on the binomial distribution ... The maximum likelihood estimate of the noise variance ... 107 pages", "subpage_snippet": "", "source": "strimmerlab.github.io", "link": "https://strimmerlab.github.io/publications/lecture-notes/MATH20802/math20802-script-a4.pdf", "content": "by K Strimmer · 2023 · Cited by 3 — In the beta-binomial model the likelihood is based on the binomial distribution ... The maximum likelihood estimate of the noise variance ... 107 pages"}
+{"idx": 7, "title": "A generalized likelihood-based Bayesian approach for ...", "date": "", "ddg_snippet": "by S Samanta · 2022 · Cited by 8 — The paper addresses joint sparsity selection in the regression coefficient matrix and the error precision (inverse covariance) matrix for high-dimensional ...", "subpage_snippet": "", "source": "pmc.ncbi.nlm.nih.gov", "link": "https://pmc.ncbi.nlm.nih.gov/articles/PMC9881595/", "content": "by S Samanta · 2022 · Cited by 8 — The paper addresses joint sparsity selection in the regression coefficient matrix and the error precision (inverse covariance) matrix for high-dimensional ..."}
+{"idx": 8, "title": "TIVE MODELS", "date": "", "ddg_snippet": "To the best of our knowledge, our study is the first attempt to explore the likelihood - based ap- proach for distributional regression using a conditional deep ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/notes/edits/attachment?id=bKSeeDBAan&name=pdf", "content": "To the best of our knowledge, our study is the first attempt to explore the likelihood - based ap- proach for distributional regression using a conditional deep ..."}
+{"idx": 9, "title": "Beyond Least Squares: Estimation of Dynamic Models With ...", "date": "", "ddg_snippet": "by T Li · 2025 — Using the classical SEIR model, we compare standard least squares against maximum likelihood estimators including variance -scaled Gaussian, log ...", "subpage_snippet": "", "source": "onlinelibrary.wiley.com", "link": "https://onlinelibrary.wiley.com/doi/full/10.1002/sdr.70004", "content": "by T Li · 2025 — Using the classical SEIR model, we compare standard least squares against maximum likelihood estimators including variance -scaled Gaussian, log ..."}

data/sampled_jsons/A_Likelihood_Based_Approach_to_Distribution_Regression_Using_Conditional_Deep_Generative_Models_FD2_.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "A Likelihood Based Approach to Distribution Regression Using ...", "date": "", "ddg_snippet": "A deep generative approach to conditional sampling. Journal of the American Statistical Association, pages 1–12. Supplementary Materials for “ A Likelihood Based Approach to Distribution Regression Using Conditional Deep Generative Models ”.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2410.02025v1", "content": "A deep generative approach to conditional sampling. Journal of the American Statistical Association, pages 1–12. Supplementary Materials for “ A Likelihood Based Approach to Distribution Regression Using Conditional Deep Generative Models ”."}
+{"idx": 1, "title": "(PDF) A Likelihood Based Approach to Distribution Regression ...", "date": "", "ddg_snippet": "Keywords: Distribution Regression ; Conditional Deep Generative Models ; Intrinsic Manifold StructureThe second approach , based on adversarial learning, matches the empirical distribution of the data with a. distribution estimator using an adversarial loss.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/384630603_A_Likelihood_Based_Approach_to_Distribution_Regression_Using_Conditional_Deep_Generative_Models", "content": "Keywords: Distribution Regression ; Conditional Deep Generative Models ; Intrinsic Manifold StructureThe second approach , based on adversarial learning, matches the empirical distribution of the data with a. distribution estimator using an adversarial loss."}
+{"idx": 2, "title": "ICML Poster A Likelihood Based Approach to Distribution ...", "date": "", "ddg_snippet": "models ), can estimate those high-dimensional conditional distributions as if the data were low-dimensional. The trick is a likelihood - based fit called a sieve maximum-likelihood estimator that grows in complexity with sample size.", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/46645", "content": "models ), can estimate those high-dimensional conditional distributions as if the data were low-dimensional. The trick is a likelihood - based fit called a sieve maximum-likelihood estimator that grows in complexity with sample size."}
+{"idx": 3, "title": "A Likelihood Based Approach to Distribution Regression Using ...", "date": "", "ddg_snippet": "These findings provide an explanation of why conditional deep generative models can circumvent the curse of dimensionality from the perspective of statistical foundations and demonstrate that they can learn a broader class of nearly singular conditional distributions.", "subpage_snippet": "", "source": "synthical.com", "link": "https://synthical.com/article/A-Likelihood-Based-Approach-to-Distribution-Regression-Using-Conditional-Deep-Generative-Models-0a08e8b9-48c6-483c-8ab4-4ef338d3619c", "content": "These findings provide an explanation of why conditional deep generative models can circumvent the curse of dimensionality from the perspective of statistical foundations and demonstrate that they can learn a broader class of nearly singular conditional distributions."}
+{"idx": 4, "title": "A Likelihood Based Approach to Distribution Regression Using ...", "date": "", "ddg_snippet": "A deep neural network models the conditional generator, enabling a flexible approach to distribution regression . The method's convergence rates and approximability are analyzed, providing insights into its effectiveness.", "subpage_snippet": "", "source": "powerdrill.ai", "link": "https://powerdrill.ai/discover/discover-A-Likelihood-Based-cm1v7rba8uvnv013whs4l4bq4", "content": "A deep neural network models the conditional generator, enabling a flexible approach to distribution regression . The method's convergence rates and approximability are analyzed, providing insights into its effectiveness."}
+{"idx": 5, "title": "A Likelihood Based Approach to Distribution Regression Using ...", "date": "", "ddg_snippet": "This paper presents a likelihood - based approach for distribution regression using conditional deep generative models .", "subpage_snippet": "", "source": "www.aimodels.fyi", "link": "https://www.aimodels.fyi/papers/arxiv/likelihood-based-approach-to-distribution-regression-using", "content": "This paper presents a likelihood - based approach for distribution regression using conditional deep generative models ."}
+{"idx": 6, "title": "Level-Wise Conditional Distribution", "date": "", "ddg_snippet": "Wasserstein- Based Deep Conditional Generative Models : Recent approaches pose conditional generative modeling as learning a mapping from a reference noise distribution (plus covariates. xx. x) to.", "subpage_snippet": "", "source": "www.emergentmind.com", "link": "https://www.emergentmind.com/topics/level-wise-conditional-distribution", "content": "Wasserstein- Based Deep Conditional Generative Models : Recent approaches pose conditional generative modeling as learning a mapping from a reference noise distribution (plus covariates. xx. x) to."}
+{"idx": 7, "title": "[PDF] Discussion of: “Nonparametric regression using deep neural...”", "date": "", "ddg_snippet": "A Likelihood Based Approach to Distribution Regression Using Conditional Deep Generative Models .", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/Discussion-of:-“Nonparametric-regression-using-deep-Ghorbani-Mei/688b87f8e83080a024eb0fd7e55288de313aff8b", "content": "A Likelihood Based Approach to Distribution Regression Using Conditional Deep Generative Models ."}
+{"idx": 8, "title": "Papers by Lizhen Lin with links to code and results.", "date": "", "ddg_snippet": "A Likelihood Based Approach to Distribution Regression Using Conditional Deep Generative Models .We introduce, for the first time, a metric geometry approach to studying edge weight prediction in WDNs.", "subpage_snippet": "", "source": "paperswithcode.com", "link": "https://paperswithcode.com/search?q=author:Lizhen+Lin", "content": "A Likelihood Based Approach to Distribution Regression Using Conditional Deep Generative Models .We introduce, for the first time, a metric geometry approach to studying edge weight prediction in WDNs."}
+{"idx": 9, "title": "openreview.net/profile?id=~Lizhen_Lin2", "date": "", "ddg_snippet": "A Likelihood Based Approach to Distribution Regression Using Conditional Deep Generative Models .A Semi-Bayesian Nonparametric Estimator of the Maximum Mean Discrepancy Measure: Applications in Goodness-of-Fit Testing and Generative Adversarial Networks.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/profile?id=~Lizhen_Lin2", "content": "A Likelihood Based Approach to Distribution Regression Using Conditional Deep Generative Models .A Semi-Bayesian Nonparametric Estimator of the Maximum Mean Discrepancy Measure: Applications in Goodness-of-Fit Testing and Generative Adversarial Networks."}

data/sampled_jsons/A_Likelihood_Based_Approach_to_Distribution_Regression_sieve_MLE_FD3_MSE(SD)_table_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Maximum likelihood estimation - Wikipedia", "date": "", "ddg_snippet": "In statistics, maximum likelihood estimation ( MLE ) is a method of estimating the parameters of an assumed probability distribution , given some observed data. This is achieved by maximizing a likelihood function so that, under the assumed statistical model, the observed data is most probable.", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/Maximum_likelihood_estimation", "content": "In statistics, maximum likelihood estimation ( MLE ) is a method of estimating the parameters of an assumed probability distribution , given some observed data. This is achieved by maximizing a likelihood function so that, under the assumed statistical model, the observed data is most probable."}
+{"idx": 1, "title": "A Likelihood Based Approach to Distribution Regression Using ...", "date": "", "ddg_snippet": "More specifically, we study the large-sample properties of a likelihood-based approach for estimating these models. Our results lead to the convergence rate of a sieve maximum likelihood estimator ( MLE ) for estimating the conditional distribution (and its devolved counterpart) of the response given predictors in the Hellinger (Wasserstein) metric.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2410.02025", "content": "More specifically, we study the large-sample properties of a likelihood-based approach for estimating these models. Our results lead to the convergence rate of a sieve maximum likelihood estimator ( MLE ) for estimating the conditional distribution (and its devolved counterpart) of the response given predictors in the Hellinger (Wasserstein) metric."}
+{"idx": 2, "title": "A Likelihood Based Approach to Distribution Regression Using ...", "date": "", "ddg_snippet": "he large-sample properties of a likelihood-based approach for estimating these models. Our results lead to the convergence rate of a sieve maximum likelihood estimator ( MLE ) for estimating the conditional distribution (and its devolv d counterpart) of the response given predictors in the Hellinger (Wasserstein) metric. Our rates depend", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=V6hhhXoTSq", "content": "he large-sample properties of a likelihood-based approach for estimating these models. Our results lead to the convergence rate of a sieve maximum likelihood estimator ( MLE ) for estimating the conditional distribution (and its devolv d counterpart) of the response given predictors in the Hellinger (Wasserstein) metric. Our rates depend"}
+{"idx": 3, "title": "A Likelihood Based Approach to Distribution Regression Using ...", "date": "", "ddg_snippet": "How-ever, for the FD3 dataset, we found that as the training sam-ple size increases further, the MSE(SD) of the sieve MLE achieves performance increasingly comparable to CKDE.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=1IyPRv1A0r", "content": "How-ever, for the FD3 dataset, we found that as the training sam-ple size increases further, the MSE(SD) of the sieve MLE achieves performance increasingly comparable to CKDE."}
+{"idx": 4, "title": "A Likelihood Based Approach to Distribution Regression Using ...", "date": "", "ddg_snippet": "Our results lead to the convergence rate of a sieve maximum likelihood estimator ( MLE ) for estimating the conditional distribution (and its devolved counterpart) of the response given predictors ...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/384630603_A_Likelihood_Based_Approach_to_Distribution_Regression_Using_Conditional_Deep_Generative_Models", "content": "Our results lead to the convergence rate of a sieve maximum likelihood estimator ( MLE ) for estimating the conditional distribution (and its devolved counterpart) of the response given predictors ..."}
+{"idx": 5, "title": "PDF 20_mle_annotated - Stanford University", "date": "", "ddg_snippet": "Maximum Likelihood Estimator Defining the likelihood of data: Bernoulli of iid random variables", "subpage_snippet": "", "source": "web.stanford.edu", "link": "https://web.stanford.edu/class/archive/cs/cs109/cs109.1234/lectures/20_mle_annotated.pdf", "content": "Maximum Likelihood Estimator Defining the likelihood of data: Bernoulli of iid random variables"}
+{"idx": 6, "title": "PDF 10-315 Notes Maximum Likelihood Estimation", "date": "", "ddg_snippet": "1.3 Gaussian The Gaussian, or normal, distribution is a continuous distribution with two parameters: one for the mean, μ, and one for the variance, σ2 (or equivalently, the standard deviation, σ). The Gaussian distribution is our go- to distribution for representing continuous random variables.", "subpage_snippet": "", "source": "www.cs.cmu.edu", "link": "https://www.cs.cmu.edu/~10315/notes/10315_S24_Notes_MLE.pdf", "content": "1.3 Gaussian The Gaussian, or normal, distribution is a continuous distribution with two parameters: one for the mean, μ, and one for the variance, σ2 (or equivalently, the standard deviation, σ). The Gaussian distribution is our go- to distribution for representing continuous random variables."}
+{"idx": 7, "title": "PDF 20_mle_annotated - Stanford University", "date": "", "ddg_snippet": "Maximum Likelihood Estimator Defining the likelihood of data: Bernoulli random variables", "subpage_snippet": "", "source": "web.stanford.edu", "link": "https://web.stanford.edu/class/archive/cs/cs109/cs109.1244/lectures/20_mle_annotated.pdf", "content": "Maximum Likelihood Estimator Defining the likelihood of data: Bernoulli random variables"}
+{"idx": 8, "title": "arXiv:2410.02025v1 [math.ST] 2 Oct 2024", "date": "", "ddg_snippet": "In this work, we explore the theoretical properties of conditional deep generative models under the statistical framework of distribution regression where the response variable lies in a high-dimensional am-bient space but concentrates around a potentially lower-dimensional manifold. More specifically, we study the large-sample properties of a likelihood-based approach for estimating these ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2410.02025", "content": "In this work, we explore the theoretical properties of conditional deep generative models under the statistical framework of distribution regression where the response variable lies in a high-dimensional am-bient space but concentrates around a potentially lower-dimensional manifold. More specifically, we study the large-sample properties of a likelihood-based approach for estimating these ..."}
+{"idx": 9, "title": "fit — SciPy v1.16.2 Manual", "date": "", "ddg_snippet": "Guesses for parameters which must be integral will be rounded to integral values, and guesses that lie outside the intersection of the user-provided bounds and the domain of the distribution will be clipped. method{'mle', 'mse'} With method=\"mle\" (default), the fit is computed by minimizing the negative log- likelihood function.", "subpage_snippet": "", "source": "docs.scipy.org", "link": "https://docs.scipy.org/doc/scipy/reference/generated/scipy.stats.fit.html", "content": "Guesses for parameters which must be integral will be rounded to integral values, and guesses that lie outside the intersection of the user-provided bounds and the domain of the distribution will be clipped. method{'mle', 'mse'} With method=\"mle\" (default), the fit is computed by minimizing the negative log- likelihood function."}

data/sampled_jsons/Ad-Hoc_Human-AI_Coordination_Challenge_dataset_3079_games.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "[2506.21490] Ad-Hoc Human-AI Coordination Challenge", "date": "", "ddg_snippet": "by T Dizdarević · 2025 — To encourage the development of data-efficient methods, we open-source a dataset of 3,079 games , deliberately limiting the amount of available ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2506.21490", "content": "by T Dizdarević · 2025 — To encourage the development of data-efficient methods, we open-source a dataset of 3,079 games , deliberately limiting the amount of available ..."}
+{"idx": 1, "title": "Ad-Hoc Human-AI Coordination Challenge", "date": "", "ddg_snippet": "by T Dizdarević — To encourage the development of data-efficient methods, we open-source a dataset of 3,079 games , deliberately limiting the amount of available ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=FuGps5Zyia", "content": "by T Dizdarević — To encourage the development of data-efficient methods, we open-source a dataset of 3,079 games , deliberately limiting the amount of available ..."}
+{"idx": 2, "title": "Ad-Hoc Human-AI Coordination Challenge", "date": "", "ddg_snippet": "To encourage the development of data-efficient methods, we open-source a dataset of 3,079 games , deliberately limiting the amount of available human gameplay ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2506.21490v1", "content": "To encourage the development of data-efficient methods, we open-source a dataset of 3,079 games , deliberately limiting the amount of available human gameplay ..."}
+{"idx": 3, "title": "Ad-Hoc Human-AI Coordination Challenge", "date": "", "ddg_snippet": "AH2AC2, a human-proxy challenge in 3,079 Hanabi games , assesses efficient human - AI coordination . Aimed at cost reduction, it offers a benchmark for fair, ...", "subpage_snippet": "", "source": "powerdrill.ai", "link": "https://powerdrill.ai/discover/summary-ad-hoc-human-ai-coordination-challenge-cmcfaq3ifm18907nqbp2j6wty", "content": "AH2AC2, a human-proxy challenge in 3,079 Hanabi games , assesses efficient human - AI coordination . Aimed at cost reduction, it offers a benchmark for fair, ..."}
+{"idx": 4, "title": "ICML Poster Ad-Hoc Human-AI Coordination Challenge", "date": "", "ddg_snippet": "... dataset of 3,079 games , deliberately limiting the amount of available human gameplay data. We present baseline results for both two- and three- player ...", "subpage_snippet": "", "source": "dev.icml.cc", "link": "https://dev.icml.cc/virtual/2025/poster/45867", "content": "... dataset of 3,079 games , deliberately limiting the amount of available human gameplay data. We present baseline results for both two- and three- player ..."}
+{"idx": 5, "title": "Ad-Hoc Human-AI Coordination Challenge", "date": "", "ddg_snippet": "26 Jun 2025 — ... dataset of 3,079 games , deliberately limiting the amount of available human gameplay data. We present baseline results for both two- and ...", "subpage_snippet": "", "source": "k8s.consensus.app", "link": "https://k8s.consensus.app/papers/details/785e955ec83554cb85641742cf052b41/", "content": "26 Jun 2025 — ... dataset of 3,079 games , deliberately limiting the amount of available human gameplay data. We present baseline results for both two- and ..."}
+{"idx": 6, "title": "Ad-Hoc Human-AI Coordination Challenge", "date": "", "ddg_snippet": "... dataset of 3,079 games , deliberately limiting the amount of available human gameplay data. We present baseline results for both two- and three- player ...", "subpage_snippet": "", "source": "chatpaper.com", "link": "https://chatpaper.com/de/chatpaper/paper/165106", "content": "... dataset of 3,079 games , deliberately limiting the amount of available human gameplay data. We present baseline results for both two- and three- player ..."}
+{"idx": 7, "title": "Ad-Hoc Human-AI Coordination Challenge", "date": "", "ddg_snippet": "18 Jun 2025 — To encourage the development of data-efficient methods, we open-source a dataset of 3,079 games , deliberately limiting the amount of available ...", "subpage_snippet": "", "source": "chatpaper.com", "link": "https://chatpaper.com/fr/chatpaper/paper/165106", "content": "18 Jun 2025 — To encourage the development of data-efficient methods, we open-source a dataset of 3,079 games , deliberately limiting the amount of available ..."}
+{"idx": 8, "title": "Human-AI Coordination via Human-Regularized Search ...", "date": "", "ddg_snippet": "11 Oct 2022 — This work develops a three-step algorithm that achieve strong performance in coordinating with real humans in the Hanabi benchmark, and uses ...", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/Human-AI-Coordination-via-Human-Regularized-Search-Hu-Wu/d42ac61b938a2173d0fcb9c327684748d9e880bd", "content": "11 Oct 2022 — This work develops a three-step algorithm that achieve strong performance in coordinating with real humans in the Hanabi benchmark, and uses ..."}
+{"idx": 9, "title": "AH2AC2", "date": "", "ddg_snippet": "A standardized benchmark for evaluating AI agents' ability to coordinate with human like partners using the cooperative card game Hanabi.", "subpage_snippet": "", "source": "ah2ac2.com", "link": "https://ah2ac2.com/", "content": "A standardized benchmark for evaluating AI agents' ability to coordinate with human like partners using the cooperative card game Hanabi."}

data/sampled_jsons/Adcock_Collier_2001_American_Political_Science_Review.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "THE 10 BEST Cafés in Seattle (Updated 2025) - Tripadvisor", "date": "", "ddg_snippet": "Best Cafés in Seattle , Washington: Find Tripadvisor traveller reviews of Seattle Cafés and search by price, location, and more.", "subpage_snippet": "", "source": "www.tripadvisor.com", "link": "https://www.tripadvisor.com/Restaurants-g60878-c8-Seattle_Washington.html", "content": "Best Cafés in Seattle , Washington: Find Tripadvisor traveller reviews of Seattle Cafés and search by price, location, and more."}
+{"idx": 1, "title": "The Absolute Best Coffee Shops in Downtown Seattle [Updated 2025]", "date": "", "ddg_snippet": "Mar 28, 2025 · From quaint corner cafes to bustling roasteries, the coffee scene here is rich and diverse. After thoroughly exploring and reviewing 12 standout spots, I’ve gathered a selection that perfectly encapsulates the vibrant coffee culture of the city.", "subpage_snippet": "", "source": "seattlesecrets.org", "link": "https://seattlesecrets.org/best-coffee-shops-in-downtown-seattle", "content": "Mar 28, 2025 · From quaint corner cafes to bustling roasteries, the coffee scene here is rich and diverse. After thoroughly exploring and reviewing 12 standout spots, I’ve gathered a selection that perfectly encapsulates the vibrant coffee culture of the city."}
+{"idx": 2, "title": "THE BEST 10 CAFES in SEATTLE, WA - Updated 2025 - Yelp", "date": "", "ddg_snippet": "Best Cafes in Seattle , WA - Last Updated September 2025 - Café Hagen, Hood Famous, Bakery Nouveau, Nana’s Green Tea, Petit Pierre Bakery, Volunteer Park Cafe & Pantry, Cardoon, Skalka, Soufend Cafe & Eatery", "subpage_snippet": "", "source": "www.yelp.com", "link": "https://www.yelp.com/search?cflt=cafes&find_loc=Seattle,+WA", "content": "Best Cafes in Seattle , WA - Last Updated September 2025 - Café Hagen, Hood Famous, Bakery Nouveau, Nana’s Green Tea, Petit Pierre Bakery, Volunteer Park Cafe & Pantry, Cardoon, Skalka, Soufend Cafe & Eatery"}
+{"idx": 3, "title": "The 19 Best Coffee Shops In Seattle - Seattle - The Infatuation", "date": "", "ddg_snippet": "Check out the best coffee shops in Seattle , from little walk-up windows and iconic roasting operations to grungy lounges that double as vinyl stores.", "subpage_snippet": "", "source": "www.theinfatuation.com", "link": "https://www.theinfatuation.com/seattle/guides/best-coffee-shops-seattle", "content": "Check out the best coffee shops in Seattle , from little walk-up windows and iconic roasting operations to grungy lounges that double as vinyl stores."}
+{"idx": 4, "title": "The 10 Best Coffee Shops In Seattle According To Locals", "date": "", "ddg_snippet": "Jul 13, 2023 · We asked local Seattleites for their recommendations for the very best coffee shops in Seattle . These are their tried-and-true favorites.", "subpage_snippet": "", "source": "secretseattle.co", "link": "https://secretseattle.co/coffee-shops-seattle/", "content": "Jul 13, 2023 · We asked local Seattleites for their recommendations for the very best coffee shops in Seattle . These are their tried-and-true favorites."}
+{"idx": 5, "title": "10 of the best cafes to drink coffee in Seattle - Lonely Planet", "date": "", "ddg_snippet": "Sep 10, 2025 · 3. Caffe Vita Coffee Roasting Co. One of the “three Vs” of Seattle coffee, Vita has poured some of the city’s boldest flavors since its cafe -roastery opened in 1995. From its first location at the bottom of Queen Anne Hill, the brand now operates nine locations in the Pacific Northwest, with cafes in New York and Phoenix.", "subpage_snippet": "", "source": "www.lonelyplanet.com", "link": "https://www.lonelyplanet.com/articles/best-places-to-drink-coffee-in-seattle", "content": "Sep 10, 2025 · 3. Caffe Vita Coffee Roasting Co. One of the “three Vs” of Seattle coffee, Vita has poured some of the city’s boldest flavors since its cafe -roastery opened in 1995. From its first location at the bottom of Queen Anne Hill, the brand now operates nine locations in the Pacific Northwest, with cafes in New York and Phoenix."}
+{"idx": 6, "title": "15 Best Cafes & Coffee Shops in Seattle ’s Capitol Hill (2025...", "date": "", "ddg_snippet": "6 days ago · Are you looking for the best Coffee Shops in Seattle ’s Capitol Hill neighborhood? Here my top 15 Seattle cafes to visit in Capitol Hill.", "subpage_snippet": "", "source": "www.emmasedition.com", "link": "https://www.emmasedition.com/2025/09/15-best-cafes-coffee-shops-in-seattles-capitol-hill-2025-guide.html", "content": "6 days ago · Are you looking for the best Coffee Shops in Seattle ’s Capitol Hill neighborhood? Here my top 15 Seattle cafes to visit in Capitol Hill."}
+{"idx": 7, "title": "20 Best Coffee Shops in Seattle , WA - CoffeeSpots", "date": "", "ddg_snippet": "Sip your way to coffee excellence. Find the 20 Best Coffee Shops in Seattle , WA.", "subpage_snippet": "", "source": "coffeespots.com", "link": "https://coffeespots.com/best-coffee-shops-in-seattle-wa/", "content": "Sip your way to coffee excellence. Find the 20 Best Coffee Shops in Seattle , WA."}
+{"idx": 8, "title": "13 Best Coffee Shops in Seattle , Washington", "date": "", "ddg_snippet": "Whether you’re grabbing a morning latte, taking meetings over cold brew, or looking for a quiet place to read, this guide covers the standout coffee shops around downtown Seattle .", "subpage_snippet": "", "source": "coffeestuds.com", "link": "https://coffeestuds.com/coffee-shops-in-seattle-washington/", "content": "Whether you’re grabbing a morning latte, taking meetings over cold brew, or looking for a quiet place to read, this guide covers the standout coffee shops around downtown Seattle ."}
+{"idx": 9, "title": "The Best Coffee Shops in Seattle", "date": "", "ddg_snippet": "Apr 22, 2024 · From Espresso Vivace to Boon Boona Coffee: The second-wave pioneers, multi-roaster cafes , and geographic specialists that make Seattle ’s coffee scene great.", "subpage_snippet": "", "source": "www.seattlemet.com", "link": "https://www.seattlemet.com/eat-and-drink/best-coffee-shops-in-seattle-washington", "content": "Apr 22, 2024 · From Espresso Vivace to Boon Boona Coffee: The second-wave pioneers, multi-roaster cafes , and geographic specialists that make Seattle ’s coffee scene great."}

data/sampled_jsons/AltUp_Baykal_et_al._2023_abstract_year_2023.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "[2301.13310] Alternating Updates for Efficient Transformers", "date": "", "ddg_snippet": "It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables the widening ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2301.13310", "content": "It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables the widening ..."}
+{"idx": 1, "title": "Alternating Updates for Efficient Transformers - NIPS", "date": "", "ddg_snippet": "Authors Cenk Baykal , Dylan Cutler, Nishanth Dikkala, Nikhil Ghosh, Rina Panigrahy, Xin Wang Abstract It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to ...", "subpage_snippet": "", "source": "papers.nips.cc", "link": "https://papers.nips.cc/paper_files/paper/2023/hash/f2059277ac6ce66e7e5543001afa8bb5-Abstract-Conference.html", "content": "Authors Cenk Baykal , Dylan Cutler, Nishanth Dikkala, Nikhil Ghosh, Rina Panigrahy, Xin Wang Abstract It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to ..."}
+{"idx": 2, "title": "Alternating updates for efficient transformers | Proceedings of the ...", "date": "", "ddg_snippet": "We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables the widening of the learned representation, i.e., the token embedding, while only incurring a negligible increase in latency.", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/10.5555/3666122.3669474", "content": "We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables the widening of the learned representation, i.e., the token embedding, while only incurring a negligible increase in latency."}
+{"idx": 3, "title": "Alternating Updates for Efficient Transformers - Semantic Scholar", "date": "", "ddg_snippet": "This work introduces Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden, and demonstrates how AltUp can be synergistically combined with existing approaches, such as Sparse Mixture-of-Experts models, to obtain efficient models with even higher capacity.", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/Alternating-Updates-for-Efficient-Transformers-Baykal-Cutler/c9d46cfcf0211d11356c295ecd9584c84c19c8f8/figure/0", "content": "This work introduces Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden, and demonstrates how AltUp can be synergistically combined with existing approaches, such as Sparse Mixture-of-Experts models, to obtain efficient models with even higher capacity."}
+{"idx": 4, "title": "Alternating Updates for Efficient Transformers - DeepAI", "date": "", "ddg_snippet": "AltUp enables the widening of the learned representation without increasing the computation time by working on a subblock of the representation at each layer. Our experiments on various transformer models and language tasks demonstrate the consistent effectiveness of alternating updates on a diverse set of benchmarks.", "subpage_snippet": "", "source": "deepai.org", "link": "https://deepai.org/publication/alternating-updates-for-efficient-transformers", "content": "AltUp enables the widening of the learned representation without increasing the computation time by working on a subblock of the representation at each layer. Our experiments on various transformer models and language tasks demonstrate the consistent effectiveness of alternating updates on a diverse set of benchmarks."}
+{"idx": 5, "title": "Alternating updates for efficient transformers - Google Research", "date": "", "ddg_snippet": "In \" Alternating Updates for Efficient Transformers \", accepted as a Spotlight at NeurIPS 2023 , we introduce AltUp , a method to take advantage of increased token representation without increasing the computation cost. AltUp is easy to implement, widely applicable to any transformer architecture, and requires minimal hyperparameter tuning.", "subpage_snippet": "", "source": "research.google", "link": "https://research.google/blog/alternating-updates-for-efficient-transformers/", "content": "In \" Alternating Updates for Efficient Transformers \", accepted as a Spotlight at NeurIPS 2023 , we introduce AltUp , a method to take advantage of increased token representation without increasing the computation cost. AltUp is easy to implement, widely applicable to any transformer architecture, and requires minimal hyperparameter tuning."}
+{"idx": 6, "title": "PDF Alternating Updates for Efficient Transforme - papers.nips.cc", "date": "", "ddg_snippet": "Abstract It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables ...", "subpage_snippet": "", "source": "papers.nips.cc", "link": "https://papers.nips.cc/paper/2023/file/f2059277ac6ce66e7e5543001afa8bb5-Paper-Conference.pdf", "content": "Abstract It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables ..."}
+{"idx": 7, "title": "NeurIPS Poster Alternating Updates for Efficient Transformers", "date": "", "ddg_snippet": "Abstract : It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables the ...", "subpage_snippet": "", "source": "neurips.cc", "link": "https://neurips.cc/virtual/2023/poster/72994", "content": "Abstract : It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables the ..."}
+{"idx": 8, "title": "Alternating Updates for Efficient Transformers - OpenReview", "date": "", "ddg_snippet": "The study introduces Alternating Updates, a novel method to increase the capacity of transformer models without significantly raising latency. AltUp broadens the token representation, operating on a subblock of the widened representation at each layer, and employs a predict-and-correct mechanism for updating inactive blocks. AltUp also extends to the sequence dimension and can work ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=1p6teT6F73", "content": "The study introduces Alternating Updates, a novel method to increase the capacity of transformer models without significantly raising latency. AltUp broadens the token representation, operating on a subblock of the widened representation at each layer, and employs a predict-and-correct mechanism for updating inactive blocks. AltUp also extends to the sequence dimension and can work ..."}
+{"idx": 9, "title": "Alternating Updates for Efficient Transformers | Request PDF", "date": "", "ddg_snippet": "Request PDF | Alternating Updates for Efficient Transformers | It is well established that increasing scale in deep transformer networks leads to improved quality and performance. This increase in ...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/367652661_Alternating_Updates_for_Efficient_Transformers", "content": "Request PDF | Alternating Updates for Efficient Transformers | It is well established that increasing scale in deep transformer networks leads to improved quality and performance. This increase in ..."}

data/sampled_jsons/AltUp_Baykal_et_al._2023_arxiv_year_2023.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "[2301.13310] Alternating Updates for Efficient Transformers - arXiv.org", "date": "", "ddg_snippet": "It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables the widening ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2301.13310", "content": "It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables the widening ..."}
+{"idx": 1, "title": "PDF NeurIPS 2023 Presentation", "date": "", "ddg_snippet": "Recycled- AltUp Evaluations O(100) total parameters added Improved performance at the cost of virtually no slowdown", "subpage_snippet": "", "source": "neurips.cc", "link": "https://neurips.cc/media/neurips-2023/Slides/72994.pdf", "content": "Recycled- AltUp Evaluations O(100) total parameters added Improved performance at the cost of virtually no slowdown"}
+{"idx": 2, "title": "arXiv:2301.13310v2 [cs.LG] 3 Oct 2023", "date": "", "ddg_snippet": "Abstract It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2301.13310", "content": "Abstract It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables ..."}
+{"idx": 3, "title": "Alternating updates for efficient transformers | Proceedings of the ...", "date": "", "ddg_snippet": "We present extensions of AltUp , such as its applicability to the sequence dimension, and demonstrate how AltUp can be synergistically combined with existing approaches, such as Sparse Mixture-of-Experts models, to obtain efficient models with even higher capacity.", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/10.5555/3666122.3669474", "content": "We present extensions of AltUp , such as its applicability to the sequence dimension, and demonstrate how AltUp can be synergistically combined with existing approaches, such as Sparse Mixture-of-Experts models, to obtain efficient models with even higher capacity."}
+{"idx": 4, "title": "Alternating Updates for Efficient Transformers - NIPS", "date": "", "ddg_snippet": "Authors Cenk Baykal , Dylan Cutler, Nishanth Dikkala, Nikhil Ghosh, Rina Panigrahy, Xin Wang Abstract It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to ...", "subpage_snippet": "", "source": "papers.nips.cc", "link": "https://papers.nips.cc/paper_files/paper/2023/hash/f2059277ac6ce66e7e5543001afa8bb5-Abstract-Conference.html", "content": "Authors Cenk Baykal , Dylan Cutler, Nishanth Dikkala, Nikhil Ghosh, Rina Panigrahy, Xin Wang Abstract It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to ..."}
+{"idx": 5, "title": "Alternating Updates for Efficient Transformers - OpenReview", "date": "", "ddg_snippet": "AltUp broadens the token representation, operating on a subblock of the widened representation at each layer, and employs a predict-and-correct mechanism for updating inactive blocks. AltUp also extends to the sequence dimension and can work synergistically with existing techniques like Sparse Mixture-of-Experts models.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=1p6teT6F73", "content": "AltUp broadens the token representation, operating on a subblock of the widened representation at each layer, and employs a predict-and-correct mechanism for updating inactive blocks. AltUp also extends to the sequence dimension and can work synergistically with existing techniques like Sparse Mixture-of-Experts models."}
+{"idx": 6, "title": "Alternating Updates for Efficient Transformers | Request PDF", "date": "", "ddg_snippet": "Finally, we present extensions of AltUp to the sequence dimension, and demonstrate how AltUp can be synergistically combined with existing approaches, such as Sparse Mixture-of-Experts models, to ...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/367652661_Alternating_Updates_for_Efficient_Transformers", "content": "Finally, we present extensions of AltUp to the sequence dimension, and demonstrate how AltUp can be synergistically combined with existing approaches, such as Sparse Mixture-of-Experts models, to ..."}
+{"idx": 7, "title": "Alternating Updates for Efficient Transformers - Semantic Scholar", "date": "", "ddg_snippet": "This work introduces Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden, and demonstrates how AltUp can be synergistically combined with existing approaches, such as Sparse Mixture-of-Experts models, to obtain efficient models with even higher capacity.", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/Alternating-Updates-for-Efficient-Transformers-Baykal-Cutler/c9d46cfcf0211d11356c295ecd9584c84c19c8f8/figure/0", "content": "This work introduces Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden, and demonstrates how AltUp can be synergistically combined with existing approaches, such as Sparse Mixture-of-Experts models, to obtain efficient models with even higher capacity."}
+{"idx": 8, "title": "Paper page - Alternating Updates for Efficient Transformers", "date": "", "ddg_snippet": "We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables the widening of the learned representation, i.e., the token embedding, while only incurring a negligible increase in latency.", "subpage_snippet": "", "source": "huggingface.co", "link": "https://huggingface.co/papers/2301.13310", "content": "We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables the widening of the learned representation, i.e., the token embedding, while only incurring a negligible increase in latency."}
+{"idx": 9, "title": "PDF Alternating Updates for Efficient Transforme - papers.nips.cc", "date": "", "ddg_snippet": "Abstract It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables ...", "subpage_snippet": "", "source": "papers.nips.cc", "link": "https://papers.nips.cc/paper/2023/file/f2059277ac6ce66e7e5543001afa8bb5-Paper-Conference.pdf", "content": "Abstract It has been well established that increasing scale in deep transformer networks leads to improved quality and performance. However, this increase in scale often comes with prohibitive increases in compute cost and inference latency. We introduce Alternating Updates ( AltUp ), a simple-to-implement method to increase a model's capacity without the computational burden. AltUp enables ..."}

data/sampled_jsons/An_Empirical_Study_of_License_Conflict_in_Free_and_Open_Source_Software_Cui_Wu_Semantic_Scholar_year_2023.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Xiang Ling - Google Scholar", "date": "", "ddg_snippet": "... Cited by\" count includes citations to the following articles in Scholar ... An empirical study of license conflict in free and open source software", "subpage_snippet": "", "source": "scholar.google.com.hk", "link": "https://scholar.google.com.hk/citations?user=5gaFkzAAAAAJ&hl=en", "content": "... Cited by\" count includes citations to the following articles in Scholar ... An empirical study of license conflict in free and open source software"}
+{"idx": 1, "title": "Radiomics: Status quo and future challenges", "date": "", "ddg_snippet": "In addition, judgment and diagnoses made by experts are usually based on multiple years of experience and subjective impression which lead to ...", "subpage_snippet": "", "source": "www.wjgnet.com", "link": "https://www.wjgnet.com/2644-3260/full/v3/i4/87.htm", "content": "In addition, judgment and diagnoses made by experts are usually based on multiple years of experience and subjective impression which lead to ..."}
+{"idx": 2, "title": "From Surface to Semantics: Semantic Structure Parsing for", "date": "", "ddg_snippet": "... integrates a complete document preprocessing pipeline and semantic relationship analysis of PDF elements, enabling both semantic structure parsing and ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2508.10311v1", "content": "... integrates a complete document preprocessing pipeline and semantic relationship analysis of PDF elements, enabling both semantic structure parsing and ..."}
+{"idx": 3, "title": "Uncovering the New Accessibility Crisis in Scholarly PDFs", "date": "", "ddg_snippet": "... of this issue, we perform a large-scale analysis of 20K open - and closed-access scholarly PDFs published between 2014–2023 sampled across broad ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2410.03022v1", "content": "... of this issue, we perform a large-scale analysis of 20K open - and closed-access scholarly PDFs published between 2014–2023 sampled across broad ..."}
+{"idx": 4, "title": "CMC | Free Full-Text | RESTlogic: Detecting Logic", "date": "", "ddg_snippet": "... of our method, we implemented our work on real-world open - source REST services, including OpenStack [ 18 20 ], one of the most popular cloud computing ...", "subpage_snippet": "", "source": "www.techscience.com", "link": "https://www.techscience.com/cmc/v78n2/55563/html", "content": "... of our method, we implemented our work on real-world open - source REST services, including OpenStack [ 18 20 ], one of the most popular cloud computing ..."}
+{"idx": 5, "title": "More human than human? Differences in lexis and collocation", "date": "", "ddg_snippet": "Due to its extensive training data, ChatGPT can provide instant feedback on grammar, lexis and coherence, easily extract key concepts, and even offer ...", "subpage_snippet": "", "source": "www.degruyterbrill.com", "link": "https://www.degruyterbrill.com/document/doi/10.1515/iral-2024-0196/html", "content": "Due to its extensive training data, ChatGPT can provide instant feedback on grammar, lexis and coherence, easily extract key concepts, and even offer ..."}
+{"idx": 6, "title": "GitHub - Furyton/awesome-language-model-analysis: This paper", "date": "", "ddg_snippet": "... in this list investigate the learning behavior, generalization ability, and other properties of language models through theoretical analysis, ...", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/Furyton/awesome-language-model-analysis", "content": "... in this list investigate the learning behavior, generalization ability, and other properties of language models through theoretical analysis, ..."}
+{"idx": 7, "title": "The influence of social power on neural responses to emotional", "date": "", "ddg_snippet": "... often used by provoking interference through the semantic incompatibility between emotional faces and emotional words, and has been employed in many ...", "subpage_snippet": "", "source": "peerj.com", "link": "https://peerj.com/articles/11267/", "content": "... often used by provoking interference through the semantic incompatibility between emotional faces and emotional words, and has been employed in many ..."}
+{"idx": 8, "title": "Frontiers | ChatGPT in society: emerging issues", "date": "", "ddg_snippet": "... include security, political, economic, cultural, and educational issues as well as issues concerning social biases, creativity, copyright, and freedom ...", "subpage_snippet": "", "source": "www.frontiersin.org", "link": "https://www.frontiersin.org/journals/artificial-intelligence/articles/10.3389/frai.2023.1130913/full", "content": "... include security, political, economic, cultural, and educational issues as well as issues concerning social biases, creativity, copyright, and freedom ..."}
+{"idx": 9, "title": "Yang Liu", "date": "", "ddg_snippet": "In our dataset 90.1% of authors are ... Software Development Life Cycle Perspective: A Survey of Benchmarks for Code Large Language Models and Agents.", "subpage_snippet": "", "source": "www.csauthors.net", "link": "https://www.csauthors.net/yang-liu-003/", "content": "In our dataset 90.1% of authors are ... Software Development Life Cycle Perspective: A Survey of Benchmarks for Code Large Language Models and Agents."}

data/sampled_jsons/An_empirical_study_of_license_conflict_in_free_and_open_source_software_Cui_et_al._2023_year_2023.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "A first look at License Variants in the PyPI Ecosystem", "date": "", "ddg_snippet": "... empirical study into license variants in software packaging ecosystem but also equips developers and organizations with practical tools for navigating ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2507.14594v1", "content": "... empirical study into license variants in software packaging ecosystem but also equips developers and organizations with practical tools for navigating ..."}
+{"idx": 1, "title": "How Robust are LLM-Generated Library Imports? An Empirical", "date": "", "ddg_snippet": "In this paper, we conduct an empirical study of six state- of -the-art LLMs, both proprietary and open - source , by prompting them to solve real-world ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2507.10818v1", "content": "In this paper, we conduct an empirical study of six state- of -the-art LLMs, both proprietary and open - source , by prompting them to solve real-world ..."}
+{"idx": 2, "title": "On Evaluating the Efficiency of Source Code Generated by LLMs |", "date": "", "ddg_snippet": "The present systematic survey comprehensively analyses studies published between 2021 and 2024, focusing on utilizing LLMs in the code generation ...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/381388109_On_Evaluating_the_Efficiency_of_Source_Code_Generated_by_LLMs", "content": "The present systematic survey comprehensively analyses studies published between 2021 and 2024, focusing on utilizing LLMs in the code generation ..."}
+{"idx": 3, "title": "(PDF) Parametric Study of the Modal Behavior of Concrete", "date": "", "ddg_snippet": "The results indicated that modal frequencies in the condition of with and without Pre-stress are different in all cases.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/338161931_Parametric_Study_of_the_Modal_Behavior_of_Concrete_Gravity_Dam_by_Using_Finite_Element_Method", "content": "The results indicated that modal frequencies in the condition of with and without Pre-stress are different in all cases."}
+{"idx": 4, "title": "The Effectiveness of Software Designed to Detect AI-Generated", "date": "", "ddg_snippet": "Quite a few websites and blogs claim to evaluate the accuracy of various AI text detectors ( e .g., Abdullahi, 2023 ; Andrews, 2023 ; Aw, 2023 ...", "subpage_snippet": "", "source": "www.degruyter.com", "link": "https://www.degruyter.com/document/doi/10.1515/opis-2022-0158/html", "content": "Quite a few websites and blogs claim to evaluate the accuracy of various AI text detectors ( e .g., Abdullahi, 2023 ; Andrews, 2023 ; Aw, 2023 ..."}
+{"idx": 5, "title": "Paradoxical Leadership and Employee Proactive... | F1000Research", "date": "", "ddg_snippet": "... an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and ...", "subpage_snippet": "", "source": "f1000research.com", "link": "https://f1000research.com/articles/13-622", "content": "... an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and ..."}
+{"idx": 6, "title": "Noise-Robustness Through Noise: Asymmetric LoRA Adaption with", "date": "", "ddg_snippet": "... robustness seems like a pipe dream, as both clean and noisy samples influence all model parameters, preventing optimal utilization of noise patterns.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2505.23868v4", "content": "... robustness seems like a pipe dream, as both clean and noisy samples influence all model parameters, preventing optimal utilization of noise patterns."}
+{"idx": 7, "title": "Nicer Than Humans: How do Large Language Models Behave in the", "date": "", "ddg_snippet": "... an implicit assumption that LLMs can understand the complex rules of the game and the history of past actions described in the prompt (Akata et al ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2406.13605v2", "content": "... an implicit assumption that LLMs can understand the complex rules of the game and the history of past actions described in the prompt (Akata et al ..."}
+{"idx": 8, "title": "Natural language processing for analyzing online customer", "date": "", "ddg_snippet": "It also gives readers an in -depth understanding of the methodologies, tools, and datasets utilized and the open research challenges in this growing ...", "subpage_snippet": "", "source": "peerj.com", "link": "https://peerj.com/articles/cs-2203/", "content": "It also gives readers an in -depth understanding of the methodologies, tools, and datasets utilized and the open research challenges in this growing ..."}
+{"idx": 9, "title": "Degradation of beechwood xylan using food-grade bacteria-like", "date": "", "ddg_snippet": "... of xylan hemicellulose into xylose monosaccharides is a cost-effective and sustainable alternative source of biofuels, chemicals, and many bio-based ...", "subpage_snippet": "", "source": "bioresourcesbioprocessing.springeropen.com", "link": "https://bioresourcesbioprocessing.springeropen.com/articles/10.1186/s40643-025-00898-1", "content": "... of xylan hemicellulose into xylose monosaccharides is a cost-effective and sustainable alternative source of biofuels, chemicals, and many bio-based ..."}

data/sampled_jsons/Appendix_A.3.2_hardware_configuration_GPU_sitearxiv.org_OR_siteopenreview.net.jsonl

@@ -0,0 +1,9 @@
+{"idx": 0, "title": "Isaac Gym: High Performance GPU Based Physics Simulation For ...", "date": "", "ddg_snippet": "Oct 11, 2021 · Abstract:Isaac Gym offers a high-performance learning platform to train policies for a wide variety of robotics tasks entirely on GPU . Both physics simulation and neural network policy training reside on GPU and communicate by directly passing data from physics buffers to PyTorch tensors without ever going through CPU bottlenecks.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=fgFBtYgJQX_", "content": "Oct 11, 2021 · Abstract:Isaac Gym offers a high-performance learning platform to train policies for a wide variety of robotics tasks entirely on GPU . Both physics simulation and neural network policy training reside on GPU and communicate by directly passing data from physics buffers to PyTorch tensors without ever going through CPU bottlenecks."}
+{"idx": 1, "title": "On Scaling Up 3D Gaussian Splatting Training | OpenReview", "date": "", "ddg_snippet": "Jan 22, 2025 · 3D Gaussian Splatting (3DGS) is increasingly popular for 3D reconstruction due to its superior visual quality and rendering speed. However, 3DGS training currently occurs on a single GPU , limiting its ability to handle high-resolution and large-scale 3D reconstruction tasks due to memory constraints. We introduce Grendel, a distributed system designed to partition 3DGS parameters and ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=pQqeQpMkE7", "content": "Jan 22, 2025 · 3D Gaussian Splatting (3DGS) is increasingly popular for 3D reconstruction due to its superior visual quality and rendering speed. However, 3DGS training currently occurs on a single GPU , limiting its ability to handle high-resolution and large-scale 3D reconstruction tasks due to memory constraints. We introduce Grendel, a distributed system designed to partition 3DGS parameters and ..."}
+{"idx": 2, "title": "AAAI 2026 Conference | OpenReview", "date": "", "ddg_snippet": "Jan 20, 2025 · Welcome to the OpenReview homepage for AAAI 2026 Conference", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/group?id=AAAI.org/2026/Conference", "content": "Jan 20, 2025 · Welcome to the OpenReview homepage for AAAI 2026 Conference"}
+{"idx": 3, "title": "SpecOffload: Unlocking Latent GPU Capacity for LLM ...", "date": "", "ddg_snippet": "15 May 2025 — During the online phase, the hardware configuration and batched inputs (➂) are provided to the ParaSpec Planner (§ 4.3), which, based on ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2505.10259v1", "content": "15 May 2025 — During the online phase, the hardware configuration and batched inputs (➂) are provided to the ParaSpec Planner (§ 4.3), which, based on ..."}
+{"idx": 4, "title": "SpecOffload: Unlocking Latent GPU Capacity for LLM ...", "date": "", "ddg_snippet": "by X Zhuge · 2025 · Cited by 1 — tion of GPU cores and marginal utility of GPU ... ParaSpec Planner aims to maximize model inference throughput on a given hardware configuration .", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2505.10259", "content": "by X Zhuge · 2025 · Cited by 1 — tion of GPU cores and marginal utility of GPU ... ParaSpec Planner aims to maximize model inference throughput on a given hardware configuration ."}
+{"idx": 5, "title": "Task-Gated Multi-Expert Collaboration Network for Degraded...", "date": "", "ddg_snippet": "May 1, 2025 · Lay Summary: This paper proposes a unified framework for degraded multi-modal image restoration and fusion, which bridges different tasks together through a two-stage training strategy to learn inter-task information while avoiding mutual interference, enabling all-in-one processing. This paper proposes the task-aware gating and multi-expert collaboration module. The degradation-aware gating ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=OcFsPBXREI", "content": "May 1, 2025 · Lay Summary: This paper proposes a unified framework for degraded multi-modal image restoration and fusion, which bridges different tasks together through a two-stage training strategy to learn inter-task information while avoiding mutual interference, enabling all-in-one processing. This paper proposes the task-aware gating and multi-expert collaboration module. The degradation-aware gating ..."}
+{"idx": 6, "title": "Scaling Infrastructure to Support Multi-Trillion Parameter ...", "date": "", "ddg_snippet": "Training a hundred-trillion parameter LLM is feasible but requires a secondary memory pool up to 1 TiB per GPU with a bandwidth of 100 GB/s bidirectionally. Strong scaling for a 1T model stalls around 12,288 GPUs, as matrix multiply becomes small, ineficient, and unable to overlap with communication.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=rqn2v1Ltgn0", "content": "Training a hundred-trillion parameter LLM is feasible but requires a secondary memory pool up to 1 TiB per GPU with a bandwidth of 100 GB/s bidirectionally. Strong scaling for a 1T model stalls around 12,288 GPUs, as matrix multiply becomes small, ineficient, and unable to overlap with communication."}
+{"idx": 7, "title": "GShard: Scaling Giant Models with Conditional Computation and...", "date": "", "ddg_snippet": "Jan 12, 2021 · Neural network scaling has been critical for improving the model quality in many real-world machine learning applications with vast amounts of training data and compute. Although this trend of...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=qrwe7XHTmYb", "content": "Jan 12, 2021 · Neural network scaling has been critical for improving the model quality in many real-world machine learning applications with vast amounts of training data and compute. Although this trend of..."}
+{"idx": 8, "title": "AutoGFM: Automated Graph Foundation Model with Adaptive...", "date": "", "ddg_snippet": "May 1, 2025 · Abstract: Graph foundation models (GFMs) aim to share graph knowledge across diverse domains and tasks to boost graph machine learning. However, existing GFMs rely on hand-designed and fixed graph neural network (GNN) architectures, failing to utilize optimal architectures *w.r.t.* specific domains and tasks, inevitably leading to suboptimal performance in diverse graph domains and tasks. In ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=fCPB0qRJT2", "content": "May 1, 2025 · Abstract: Graph foundation models (GFMs) aim to share graph knowledge across diverse domains and tasks to boost graph machine learning. However, existing GFMs rely on hand-designed and fixed graph neural network (GNN) architectures, failing to utilize optimal architectures *w.r.t.* specific domains and tasks, inevitably leading to suboptimal performance in diverse graph domains and tasks. In ..."}

data/sampled_jsons/Appendix_B.2_Feature_Selection_Solution_for_SDXL_query_key_activations_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Comparing Graph Transformers via Positional Encodings", "date": "", "ddg_snippet": "2 σ is an activation function. Here Q, K, V refer to “ query ”, “ key ” and “value”, respec-tively, in the terminology of the attention literature (Vaswani et al., 2017), and dh and dr are the dimension of the hidden layer and the dimension of the residual layer, respectively.", "subpage_snippet": "", "source": "par.nsf.gov", "link": "https://par.nsf.gov/servlets/purl/10582794", "content": "2 σ is an activation function. Here Q, K, V refer to “ query ”, “ key ” and “value”, respec-tively, in the terminology of the attention literature (Vaswani et al., 2017), and dh and dr are the dimension of the hidden layer and the dimension of the residual layer, respectively."}
+{"idx": 1, "title": "MUSE: MCTS-Driven Red Teaming Framework for Enhanced Multi ...", "date": "", "ddg_snippet": "In this work, we extend DPO for multi-turn dia-logue safety by introducing fine-grained preference optimization, thereby enabling earlier and more targeted intervention at key decision points and reducing risks in extended conversations.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2509.14651", "content": "In this work, we extend DPO for multi-turn dia-logue safety by introducing fine-grained preference optimization, thereby enabling earlier and more targeted intervention at key decision points and reducing risks in extended conversations."}
+{"idx": 2, "title": "Adaptive weighted multi-view subspace clustering method for ...", "date": "", "ddg_snippet": "Sep 13, 2023 · First, we use two neural networks to map multi-source data into a common latent representation and multiple specific latent representations, which serve as the query vector and input vectors of the attention mechanism, respectively. Then, the weight of each type of data is calculated based on the attention mechanism.", "subpage_snippet": "", "source": "www.tandfonline.com", "link": "https://www.tandfonline.com/doi/full/10.1080/10095020.2024.2356243", "content": "Sep 13, 2023 · First, we use two neural networks to map multi-source data into a common latent representation and multiple specific latent representations, which serve as the query vector and input vectors of the attention mechanism, respectively. Then, the weight of each type of data is calculated based on the attention mechanism."}
+{"idx": 3, "title": "Not All Diffusion Model Activations Have Been Evaluated as ...", "date": "", "ddg_snippet": "Our method provides effective feature selection solutions for popular diffusion models like SDv1.5 and SDXL , validating their superiority across multiple ...", "subpage_snippet": "", "source": "liner.com", "link": "https://liner.com/review/not-all-diffusion-model-activations-have-been-evaluated-as-discriminative", "content": "Our method provides effective feature selection solutions for popular diffusion models like SDv1.5 and SDXL , validating their superiority across multiple ..."}
+{"idx": 4, "title": "Not All Diffusion Model Activations Have Been Evaluated ...", "date": "", "ddg_snippet": "4 Oct 2024 — B . 2 Feature Selection Solution for SDXL . Report issue for preceding element. Four activations are selected from SDXL , trying to get similar ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2410.03558v1", "content": "4 Oct 2024 — B . 2 Feature Selection Solution for SDXL . Report issue for preceding element. Four activations are selected from SDXL , trying to get similar ..."}
+{"idx": 5, "title": "Not All Diffusion Model Activations Have Been Evaluated as...", "date": "", "ddg_snippet": "They develop specific feature selection solutions for popular diffusion models SDv1.5 and SDXL . Experiments demonstrate that this method outperforms state-of- ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=7uqVfZW6Mo&referrer=[the+profile+of+Qianqian+Xu](/profile?id=~Qianqian_Xu2)", "content": "They develop specific feature selection solutions for popular diffusion models SDv1.5 and SDXL . Experiments demonstrate that this method outperforms state-of- ..."}
+{"idx": 6, "title": "Suppress Content Shift: Better Diffusion Features via Off- ...", "date": "", "ddg_snippet": "The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature . We discover that diffusion ...", "subpage_snippet": "", "source": "neurips.cc", "link": "https://neurips.cc/virtual/2024/poster/95209", "content": "The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature . We discover that diffusion ..."}
+{"idx": 7, "title": "UNPACKING SDXL TURBO: INTERPRETING TEXT-TO", "date": "", "ddg_snippet": "Spatial activations . We visualize the feature map Sρ 2 Rh⇥w containing the activations of a feature . ⇢ across the spatial locations by upscaling it to the ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf/b01108a15348126fac53227053ed8b12ac3cc7fc.pdf", "content": "Spatial activations . We visualize the feature map Sρ 2 Rh⇥w containing the activations of a feature . ⇢ across the spatial locations by upscaling it to the ..."}
+{"idx": 8, "title": "Maize Yield Prediction via Multi-Branch Feature Extraction ...", "date": "", "ddg_snippet": "5 days ago · This study conducted field experiments in 2024 in Meidaizhao Town, Tumed Right Banner, Baotou City, Inner Mongolia Autonomous Region, adopting a plant-level sampling design with 10 maize plots selected as sampling areas (20 plants per plot). At four critical growth stages—jointing, heading, filling, and maturity—multimodal data, including that covering leaf spectra, root-zone soil spectra ...", "subpage_snippet": "", "source": "www.mdpi.com", "link": "https://www.mdpi.com/2073-4395/15/9/2199", "content": "5 days ago · This study conducted field experiments in 2024 in Meidaizhao Town, Tumed Right Banner, Baotou City, Inner Mongolia Autonomous Region, adopting a plant-level sampling design with 10 maize plots selected as sampling areas (20 plants per plot). At four critical growth stages—jointing, heading, filling, and maturity—multimodal data, including that covering leaf spectra, root-zone soil spectra ..."}
+{"idx": 9, "title": "Local Prompt Adaptation for Style-Consistent Multi-Object ...", "date": "", "ddg_snippet": "27 Jul 2025 — We evaluate our method on a custom benchmark of 50 style-rich prompts across five categories and compare against strong baselines including ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2507.20094v1", "content": "27 Jul 2025 — We evaluate our method on a custom benchmark of 50 style-rich prompts across five categories and compare against strong baselines including ..."}

data/sampled_jsons/Archetypal_SAE_Adaptive_and_Stable_Dictionary_Learning_Concept_Extraction_Large_Vision_Models_Figure.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Archetypal SAEs : Adaptive and Stable Dictionary Learning for...", "date": "", "ddg_snippet": "Figure 2. SAEs are a promising direction for scalable concept extraction in vision . Comparison of reconstruction error (ℓ2 Loss) and sparsity across four large -scale vision models : ConvNext, DINO, SigLIP, and ViT.", "subpage_snippet": "", "source": "kempnerinstitute.harvard.edu", "link": "https://kempnerinstitute.harvard.edu/research/deeper-learning/archetypal-saes-adaptive-and-stable-dictionary-learning-for-concept-extraction-in-large-vision-models/", "content": "Figure 2. SAEs are a promising direction for scalable concept extraction in vision . Comparison of reconstruction error (ℓ2 Loss) and sparsity across four large -scale vision models : ConvNext, DINO, SigLIP, and ViT."}
+{"idx": 1, "title": "Archetypal SAE : Adaptive and Stable Dictionary Learning for...", "date": "", "ddg_snippet": "Figure 1: A) Archetypal - SAE . Archetypal - SAEs constrain dictionary atoms (decoder directions) to the data’s convex hull, improving stability . Figure 2: SAEs are a promising direction for scalable concept extraction in vision . Comparison of reconstruction error.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2502.12892v1", "content": "Figure 1: A) Archetypal - SAE . Archetypal - SAEs constrain dictionary atoms (decoder directions) to the data’s convex hull, improving stability . Figure 2: SAEs are a promising direction for scalable concept extraction in vision . Comparison of reconstruction error."}
+{"idx": 2, "title": "(PDF) Archetypal SAE : Adaptive and Stable Dictionary Learning for...", "date": "", "ddg_snippet": "Abstract and Figures . Sparse Autoencoders ( SAEs ) have emerged as a powerful framework for machine learning interpretability, enabling the unsupervised decomposition of model representations into a dictionary of abstract, human-interpretable concepts .", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/389129606_Archetypal_SAE_Adaptive_and_Stable_Dictionary_Learning_for_Concept_Extraction_in_Large_Vision_Models", "content": "Abstract and Figures . Sparse Autoencoders ( SAEs ) have emerged as a powerful framework for machine learning interpretability, enabling the unsupervised decomposition of model representations into a dictionary of abstract, human-interpretable concepts ."}
+{"idx": 3, "title": "Archetypal SAEs : Adaptive and Stable Dictionary Learning for...", "date": "", "ddg_snippet": "A) Compared to a Regular- SAE , Archetypal - SAEs constrain dictionary atoms (decoder directions) to the data’s convex hull, improving stability . Concept Extraction as Dictionary Learning .", "subpage_snippet": "", "source": "medium.com", "link": "https://medium.com/@kempnerinstitute/archetypal-saes-adaptive-and-stable-dictionary-learning-for-concept-extraction-in-large-vision-acf95010c691", "content": "A) Compared to a Regular- SAE , Archetypal - SAEs constrain dictionary atoms (decoder directions) to the data’s convex hull, improving stability . Concept Extraction as Dictionary Learning ."}
+{"idx": 4, "title": "KempnerInstitute/overcomplete: Overcomplete is a Vision -based...", "date": "", "ddg_snippet": "Stable Dictionary with Archetypal - SAE : Coming soon. Advanced metrics to study the solution of SAE : The visualization module: NMF, ConvexNMF and Semi-NMF", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/KempnerInstitute/overcomplete", "content": "Stable Dictionary with Archetypal - SAE : Coming soon. Advanced metrics to study the solution of SAE : The visualization module: NMF, ConvexNMF and Semi-NMF"}
+{"idx": 5, "title": "[Literature Review] Archetypal SAE : Adaptive and Stable Dictionary ...", "date": "", "ddg_snippet": "Archetypal SAE . Sparse Autoencoders. Concept Extraction . Adaptive Dictionary Learning . Stability . Interpretability.", "subpage_snippet": "", "source": "www.themoonlight.io", "link": "https://www.themoonlight.io/en/review/archetypal-sae-adaptive-and-stable-dictionary-learning-for-concept-extraction-in-large-vision-models", "content": "Archetypal SAE . Sparse Autoencoders. Concept Extraction . Adaptive Dictionary Learning . Stability . Interpretability."}
+{"idx": 6, "title": "Archetypal SAE : Adaptive and Stable Dictionary Learning for...", "date": "", "ddg_snippet": "Note on Non- Parametric Regression.Binxu Wang. Research Fellow. ← An analytical theory of power law spectral bias in the learning dynamics of diffusion models Mar 1, 2025.", "subpage_snippet": "", "source": "animadversio.github.io", "link": "https://animadversio.github.io/publication/fel-2025-archetypal/", "content": "Note on Non- Parametric Regression.Binxu Wang. Research Fellow. ← An analytical theory of power law spectral bias in the learning dynamics of diffusion models Mar 1, 2025."}
+{"idx": 7, "title": "An Introduction to SAEs and their Variants for Mech Interp — LessWrong", "date": "", "ddg_snippet": "Introduced in Feb 2025, Archetypal SAE : Adaptive and Stable Dictionary Learning for Concept Extraction in Large Vision Models . dictionary _ learning - this library builds SAEs on nnsight models . It supports a bit wider feature set, but isn't as ergonomic to use.", "subpage_snippet": "", "source": "www.lesswrong.com", "link": "https://www.lesswrong.com/posts/vvvJNh8gNE2ScEtQ3/an-introduction-to-saes-and-their-variants-for-mech-interp", "content": "Introduced in Feb 2025, Archetypal SAE : Adaptive and Stable Dictionary Learning for Concept Extraction in Large Vision Models . dictionary _ learning - this library builds SAEs on nnsight models . It supports a bit wider feature set, but isn't as ergonomic to use."}
+{"idx": 8, "title": "Archetypal SAE : Adaptive and Secure Dictionary ... - I Tech Epic", "date": "", "ddg_snippet": "A- SAE constrains dictionary atoms to the convex hull of the coaching knowledge and enhances stability whereas preserving expressive energy. Adaptive . Archetypal . Concept . Dictionary . Extraction .", "subpage_snippet": "", "source": "itechepic.com", "link": "https://itechepic.com/archetypal-sae-adaptive-and-secure-dictionary-studying-for-idea-extraction-in-massive-imaginative-and-prescient-fashions/", "content": "A- SAE constrains dictionary atoms to the convex hull of the coaching knowledge and enhances stability whereas preserving expressive energy. Adaptive . Archetypal . Concept . Dictionary . Extraction ."}
+{"idx": 9, "title": "NTT Researchers Advance AI and Machine Learning Accuracy...", "date": "", "ddg_snippet": "Archetypal SAE : Adaptive and Stable Dictionary Learning for Concept Extraction in Large Vision Models .", "subpage_snippet": "", "source": "www.businesswire.com", "link": "https://www.businesswire.com/news/home/20250722162521/en/NTT-Researchers-Advance-AI-and-Machine-Learning-Accuracy-Security-and-Cost-Effectiveness-at-ICML-2025", "content": "Archetypal SAE : Adaptive and Stable Dictionary Learning for Concept Extraction in Large Vision Models ."}

data/sampled_jsons/Attention_Is_All_You_Need_Vaswani_et_al_2017_paper_abstract_arxiv.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/Attention_Is_All_You_Need_arxiv_abstract_year_2017.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Attention Is All You Need", "date": "", "ddg_snippet": "\" Attention Is All You Need \" is a 2017 landmark research paper in machine learning authored by eight scientists working at Google. The paper introduced a new ...", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/Attention_Is_All_You_Need", "content": "\" Attention Is All You Need \" is a 2017 landmark research paper in machine learning authored by eight scientists working at Google. The paper introduced a new ..."}
+{"idx": 1, "title": "[1706.03762] Attention Is All You Need", "date": "", "ddg_snippet": "12 Jun 2017 — 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": "12 Jun 2017 — We propose a new simple network architecture, the Transformer, based solely on attention mechanisms, dispensing with recurrence and convolutions entirely."}
+{"idx": 2, "title": "Attention Is All You Need", "date": "", "ddg_snippet": "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/html/1706.03762v7", "content": "We propose a new simple network architecture, the Transformer, based solely on attention mechanisms, dispensing with recurrence and convolutions entirely."}
+{"idx": 3, "title": "Attention is All you Need", "date": "", "ddg_snippet": "by A Vaswani · 2017 · Cited by 195236 — We propose a novel, simple network architecture based solely onan attention mechanism, dispensing with recurrence and convolutions entirely.", "subpage_snippet": "", "source": "papers.nips.cc", "link": "https://papers.nips.cc/paper/7181-attention-is-all-you-need", "content": "by A Vaswani · 2017 · Cited by 195236 — We propose a novel, simple network architecture based solely onan attention mechanism, dispensing with recurrence and convolutions entirely."}
+{"idx": 4, "title": "Attention is all you need | Proceedings of the 31st ...", "date": "", "ddg_snippet": "by A Vaswani · 2017 · Cited by 195236 — We propose a new simple network architecture, the Transformer, based solely on attention mechanisms, dispensing with recurrence and convolutions entirely.", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/10.5555/3295222.3295349", "content": "by A Vaswani · 2017 · Cited by 195236 — We propose a new simple network architecture, the Transformer, based solely on attention mechanisms, dispensing with recurrence and convolutions entirely."}
+{"idx": 5, "title": "[2407.15516] Attention Is All You Need But You Don't ...", "date": "", "ddg_snippet": "by G Tyukin · 2024 · Cited by 4 — In this work, we investigate the effect of dropping MLP and attention layers at inference time on the performance of Llama-v2 models.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2407.15516", "content": "by G Tyukin · 2024 · Cited by 4 — In this work, we investigate the effect of dropping MLP and attention layers at inference time on the performance of Llama-v2 models."}
+{"idx": 6, "title": "System 2 Attention (is something you might need too)", "date": "", "ddg_snippet": "by J Weston · 2023 · Cited by 85 — We introduce System 2 Attention (S2A), which leverages the ability of LLMs to reason in natural language and follow instructions in order to decide what to ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2311.11829", "content": "by J Weston · 2023 · Cited by 85 — We introduce System 2 Attention (S2A), which leverages the ability of LLMs to reason in natural language and follow instructions in order to decide what to ..."}
+{"idx": 7, "title": "[2501.05730] Element-wise Attention Is All You Need", "date": "", "ddg_snippet": "by G Feng · 2025 — We propose a novel element-wise attention mechanism, which uses the element-wise squared Euclidean distance , instead of the dot product operation, to compute ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2501.05730", "content": "by G Feng · 2025 — We propose a novel element-wise attention mechanism, which uses the element-wise squared Euclidean distance , instead of the dot product operation, to compute ..."}
+{"idx": 8, "title": "Attention Is All You Need - arXiv /", "date": "", "ddg_snippet": "Attention Is All You NeedAshish Vaswani Google Shazeer Google Parmar Google Uszkoreit Google Jones Google N. ... of Attention Is All You Need - arXiv", "subpage_snippet": "", "source": "pdf4pro.com", "link": "https://pdf4pro.com/view/attention-is-all-you-need-arxiv-5bc4df.html", "content": "Attention Is All You NeedAshish Vaswani Google Shazeer Google Parmar Google Uszkoreit Google Jones Google N. ... of Attention Is All You Need - arXiv"}
+{"idx": 9, "title": "[2103.03404] Attention is Not All You Need: Pure Attention", "date": "", "ddg_snippet": "View a PDF of the paper titled Attention is Not All You Need : Pure Attention Loses Rank Doubly Exponentially with Depth, by Yihe Dong and 2 other ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2103.03404", "content": "View a PDF of the paper titled Attention is Not All You Need : Pure Attention Loses Rank Doubly Exponentially with Depth, by Yihe Dong and 2 other ..."}

data/sampled_jsons/BIT-VO_Murai_in-pixel_processing_visual_odometry.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "(PDF) Weighted Node Mapping and Localisation on a Pixel", "date": "", "ddg_snippet": "This paper implements and demonstrates visual route mapping and localisation upon a Pixel Processor Array (PPA). ... Processing Elements (PEs), each ...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/350187131_Weighted_Node_Mapping_and_Localisation_on_a_Pixel_Processor_Array", "content": "This paper implements and demonstrates visual route mapping and localisation upon a Pixel Processor Array (PPA). ... Processing Elements (PEs), each ..."}
+{"idx": 1, "title": "BIT - VO", "date": "", "ddg_snippet": "BIT - VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane. IROS 2020.", "subpage_snippet": "", "source": "rmurai.co.uk", "link": "https://rmurai.co.uk/projects/BIT-VO/", "content": "BIT - VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane. IROS 2020."}
+{"idx": 2, "title": "Visual Inertial Odometry using Focal Plane Binary Features ( BIT -VIO)", "date": "", "ddg_snippet": "Visual Odometry for Pixel Processor Arrays. BIT - VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/382976639_Visual_Inertial_Odometry_using_Focal_Plane_Binary_Features_BIT-VIO", "content": "Visual Odometry for Pixel Processor Arrays. BIT - VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane."}
+{"idx": 3, "title": "BIT - VO : Visual Odometry at 300 FPS using Binary Features from the...", "date": "", "ddg_snippet": "Here, we present BIT - VO , which is, to the best of our knowledge, the first 6 Degrees of Freedom visual odometry algorithm which utilises the FPSP. Our entire system operates at 300 FPS in a natural scene, using binary edges and corner features detected by the SCAMP-5.", "subpage_snippet": "", "source": "synthical.com", "link": "https://synthical.com/article/BIT-VO:-Visual-Odometry-at-300-FPS-using-Binary-Features-from-the-Focal-Plane-91006d3d-8367-44b0-abe0-9195b19fd1ce", "content": "Here, we present BIT - VO , which is, to the best of our knowledge, the first 6 Degrees of Freedom visual odometry algorithm which utilises the FPSP. Our entire system operates at 300 FPS in a natural scene, using binary edges and corner features detected by the SCAMP-5."}
+{"idx": 4, "title": "High-frame rate homography and visual odometry by tracking binary...", "date": "", "ddg_snippet": "An efficient BInary feaTure Visual Odometry , BIT - VO , the first 6-DoF visual odometry which utilises the FPSP. Visual odometry using pixel processor arrays for unmanned aerial systems in GPS denied environments.", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/article/10.1007/s10514-023-10122-8", "content": "An efficient BInary feaTure Visual Odometry , BIT - VO , the first 6-DoF visual odometry which utilises the FPSP. Visual odometry using pixel processor arrays for unmanned aerial systems in GPS denied environments."}
+{"idx": 5, "title": "Riku Murai - Google Scholar", "date": "", "ddg_snippet": "BIT - VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane.2021. Visual Odometry Using a Focal-plane Sensor-processor. R Murai , P Kelly, S Saeedi, A Davison. 2019.", "subpage_snippet": "", "source": "scholar.google.co.in", "link": "https://scholar.google.co.in/citations?user=JCex0BwAAAAJ&hl=en", "content": "BIT - VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane.2021. Visual Odometry Using a Focal-plane Sensor-processor. R Murai , P Kelly, S Saeedi, A Davison. 2019."}
+{"idx": 6, "title": "Demo : Point-Feature Tracking for Pixel Processor Arrays", "date": "", "ddg_snippet": "Visual odometry for pixel processor arrays. In Proceedings of the IEEE International Conference on Computer Vision, pages 4604–4612, 2017. BIT - VO : Vi - sual odometry at 300 fps using binary features from the focal plane.", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025W/EventVision/papers/Bose_Demo__Point-Feature_Tracking_for_Pixel_Processor_Arrays_CVPRW_2025_paper.pdf", "content": "Visual odometry for pixel processor arrays. In Proceedings of the IEEE International Conference on Computer Vision, pages 4604–4612, 2017. BIT - VO : Vi - sual odometry at 300 fps using binary features from the focal plane."}
+{"idx": 7, "title": "PixRO: Pixel -Distributed Rotational Odometry with Gaussian Belief...", "date": "", "ddg_snippet": "Visual Odometry for Pixel Pro-cessor Arrays. In 2017 IEEE International Conference on Computer Vision (ICCV), pages 4614–4622, Venice, 2017. BIT - VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2406.09726", "content": "Visual Odometry for Pixel Pro-cessor Arrays. In 2017 IEEE International Conference on Computer Vision (ICCV), pages 4614–4622, Venice, 2017. BIT - VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane."}
+{"idx": 8, "title": "What is visual odometry ? Competitors, Complementary... | Sumble", "date": "", "ddg_snippet": "Visual odometry ( VO ) is the process of determining the position and orientation of a robot or other mobile platform by analyzing the sequence of images captured by one or more cameras.", "subpage_snippet": "", "source": "sumble.com", "link": "https://sumble.com/tech/visual-odometry", "content": "Visual odometry ( VO ) is the process of determining the position and orientation of a robot or other mobile platform by analyzing the sequence of images captured by one or more cameras."}
+{"idx": 9, "title": "Drone Autonomous Navigation by Hardware Image Processing", "date": "", "ddg_snippet": "2 autonomous navigation by image processing . In this section, two approaches applied for UAV autonomous navigation, visual odometry ( VO ) and computer vision (CV), are briey presented.", "subpage_snippet": "", "source": "cimec.org.ar", "link": "https://cimec.org.ar/ojs/index.php/mc/article/download/6040/6033", "content": "2 autonomous navigation by image processing . In this section, two approaches applied for UAV autonomous navigation, visual odometry ( VO ) and computer vision (CV), are briey presented."}

data/sampled_jsons/BIT-VO_Visual_Odometry_at_300_FPS_using_Binary_Features_from_the_Focal_Plane.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "BIT-VO: Visual Odometry at 300 FPS using Binary Features from the Focal ...", "date": "", "ddg_snippet": "Here, we present BIT-VO , which is, to the best of our knowledge, the first 6 Degrees of Freedom visual odometry algorithm which utilises the FPSP. Our entire system operates at 300 FPS in a natural scene, using binary edges and corner features detected by the SCAMP-5.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2004.11186", "content": "Here, we present BIT-VO , which is, to the best of our knowledge, the first 6 Degrees of Freedom visual odometry algorithm which utilises the FPSP. Our entire system operates at 300 FPS in a natural scene, using binary edges and corner features detected by the SCAMP-5."}
+{"idx": 1, "title": "BIT-VO", "date": "", "ddg_snippet": "inproceedings{Murai:etal:IROS:2020, title={ BIT - VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane }, author={Murai, Riku and ...", "subpage_snippet": "", "source": "rmurai.co.uk", "link": "https://rmurai.co.uk/projects/BIT-VO/", "content": "inproceedings{Murai:etal:IROS:2020, title={ BIT - VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane }, author={Murai, Riku and ..."}
+{"idx": 2, "title": "BIT-VO: Visual Odometry at 300 FPS using Binary Features from the Focal ...", "date": "", "ddg_snippet": "Focal-plane Sensor-processor (FPSP) is a next-generation camera technology which enables every pixel on the sensor chip to perform computation in parallel, on the focal plane where the light intensity is captured. SCAMP-5 is a general-purpose FPSP used in this work and it carries out computations in the analog domain before analog to digital conversion. By extracting features from the image on ...", "subpage_snippet": "", "source": "ieeexplore.ieee.org", "link": "https://ieeexplore.ieee.org/abstract/document/9341151", "content": "Focal-plane Sensor-processor (FPSP) is a next-generation camera technology which enables every pixel on the sensor chip to perform computation in parallel, on the focal plane where the light intensity is captured. SCAMP-5 is a general-purpose FPSP used in this work and it carries out computations in the analog domain before analog to digital conversion. By extracting features from the image on ..."}
+{"idx": 3, "title": "[Spatial AI Study] BIT-VO: Visual Odometry at 300 FPS using Binary ...", "date": "", "ddg_snippet": "Presenter: Heokjin YunDate: 2024.10.22Paper: Murai et al 2021 - BIT-VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane (https://arxiv.o...", "subpage_snippet": "", "source": "www.youtube.com", "link": "https://www.youtube.com/watch?v=p7WAS2VRe9Q", "content": "Presenter: Heokjin YunDate: 2024.10.22Paper: Murai et al 2021 - BIT-VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane (https://arxiv.o..."}
+{"idx": 4, "title": "High-frame rate homography and visual odometry by tracking binary ...", "date": "", "ddg_snippet": "We presented BIT-VO , which is capable of performing VO at 300 FPS by using binary edges and corners computed on the focal plane . Our system is simplistic and minimal, yet it is sufficient to work in challenging conditions, highlighting the advantage of operating at high effective frame rates.", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/article/10.1007/s10514-023-10122-8", "content": "We presented BIT-VO , which is capable of performing VO at 300 FPS by using binary edges and corners computed on the focal plane . Our system is simplistic and minimal, yet it is sufficient to work in challenging conditions, highlighting the advantage of operating at high effective frame rates."}
+{"idx": 5, "title": "BIT-VO: Visual Odometry at 300 FPS using Binary Features from the Focal ...", "date": "", "ddg_snippet": "BITVO is presented, which is the first 6-Degrees of Freedom visual odometry algorithm which utilises the FPSP, and it operates at 300 FPS in a natural environment, using binary edges and corner features detected by the SCAMP-5.", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/BIT-VO:-Visual-Odometry-at-300-FPS-using-Binary-the-Murai-Saeedi/02d51188c578337a2ed81e8a42fee89109a2a25d/figure/6", "content": "BITVO is presented, which is the first 6-Degrees of Freedom visual odometry algorithm which utilises the FPSP, and it operates at 300 FPS in a natural environment, using binary edges and corner features detected by the SCAMP-5."}
+{"idx": 6, "title": "BIT-VO: Visual Odometry at 300 FPS using Binary Features from the Focal ...", "date": "", "ddg_snippet": "BIT-VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane Riku Murai1, Sajad Saeedi2, Paul H. J. Kelly Abstract—Focal- plane Sensor-processor (FPSP) is a next- generation camera technology which enables every pixel on the sensor chip to perform computation in parallel, on the focal plane where the light intensity is captured.", "subpage_snippet": "", "source": "web3.arxiv.org", "link": "https://web3.arxiv.org/pdf/2004.11186", "content": "BIT-VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane Riku Murai1, Sajad Saeedi2, Paul H. J. Kelly Abstract—Focal- plane Sensor-processor (FPSP) is a next- generation camera technology which enables every pixel on the sensor chip to perform computation in parallel, on the focal plane where the light intensity is captured."}
+{"idx": 7, "title": "High-frame rate homography and visual odometry by tracking binary ...", "date": "", "ddg_snippet": "Second, our work is extended to implement BIT -VO—6-DoF visual odometry system which operates under an unknown natural environment at 300 FPS .", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/372527248_High-frame_rate_homography_and_visual_odometry_by_tracking_binary_features_from_the_focal_plane", "content": "Second, our work is extended to implement BIT -VO—6-DoF visual odometry system which operates under an unknown natural environment at 300 FPS ."}
+{"idx": 8, "title": "High-frame rate homography and visual odometry by tracking binary ...", "date": "", "ddg_snippet": "We present a localisation system that utilise the FPSP in two parts. First, a 6-DoF odometry system is introduced, which efficiently estimates its position against a known marker at over 400 FPS . Second, our work is extended to implement BIT -VO—6-DoF visual odometry system which operates under an unknown natural environment at 300 FPS .", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/10.1007/s10514-023-10122-8", "content": "We present a localisation system that utilise the FPSP in two parts. First, a 6-DoF odometry system is introduced, which efficiently estimates its position against a known marker at over 400 FPS . Second, our work is extended to implement BIT -VO—6-DoF visual odometry system which operates under an unknown natural environment at 300 FPS ."}
+{"idx": 9, "title": "BIT-VO: Visual Odometry at 300 FPS using Binary Features from the Focal ...", "date": "", "ddg_snippet": "The estimated data x, y, z is plotted using red, green, blue and the ground truth data x, y, z is plotted using purple, orange, cyan respectively. Note rotations along z-axis wraps as full 360 degrees loops are made. - \" BIT-VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane \"", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/BIT-VO:-Visual-Odometry-at-300-FPS-using-Binary-the-Murai-Saeedi/02d51188c578337a2ed81e8a42fee89109a2a25d/figure/3", "content": "The estimated data x, y, z is plotted using red, green, blue and the ground truth data x, y, z is plotted using purple, orange, cyan respectively. Note rotations along z-axis wraps as full 360 degrees loops are made. - \" BIT-VO : Visual Odometry at 300 FPS using Binary Features from the Focal Plane \""}

data/sampled_jsons/Bansal_FOCS_2010_discrepancy_minimization.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Constructive ℓ₂-Discrepancy Minimization with Additive", "date": "", "ddg_snippet": "... discrepancy minimisation was open for a long time, until Bansal ’s remarkable breakthrough [ 4 ] , which showed Spencer’s bound could be achieved ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2508.21423v1", "content": "... discrepancy minimisation was open for a long time, until Bansal ’s remarkable breakthrough [ 4 ] , which showed Spencer’s bound could be achieved ..."}
+{"idx": 1, "title": "Discrepancy Games and Sensitivity | Gödel's Lost Letter and", "date": "", "ddg_snippet": "Spencer ’ s talk was titled “ Four Discrepancies ” and based on a joint paper with Nikhil Bansal .", "subpage_snippet": "", "source": "rjlipton.com", "link": "https://rjlipton.com/2019/07/25/discrepancy-games-and-sensitivity/", "content": "Spencer ’ s talk was titled “ Four Discrepancies ” and based on a joint paper with Nikhil Bansal ."}
+{"idx": 2, "title": "Bibliography: Theory of Computing: An Open Access Electronic", "date": "", "ddg_snippet": "7] Nikhil Bansal and Shashwat Garg: Algorithmic discrepancy beyond partial coloring. ... and Thomas Rothvoss: Deterministic discrepancy minimization ...", "subpage_snippet": "", "source": "theoryofcomputing.org", "link": "http://theoryofcomputing.org/articles/v015a021/bibliography.html", "content": "7] Nikhil Bansal and Shashwat Garg: Algorithmic discrepancy beyond partial coloring. ... and Thomas Rothvoss: Deterministic discrepancy minimization ..."}
+{"idx": 3, "title": "Bibliography: Theory of Computing: An Open Access Electronic", "date": "", "ddg_snippet": "9] Nikhil Bansal and Shashwat Garg: Algorithmic discrepancy beyond partial coloring. ... Bansal and Viswanath Nagarajan: Approximation-friendly ...", "subpage_snippet": "", "source": "theoryofcomputing.org", "link": "https://theoryofcomputing.org/articles/v020a006/bibliography.html", "content": "9] Nikhil Bansal and Shashwat Garg: Algorithmic discrepancy beyond partial coloring. ... Bansal and Viswanath Nagarajan: Approximation-friendly ..."}
+{"idx": 4, "title": "Bibliography: Theory of Computing: An Open Access Electronic", "date": "", "ddg_snippet": "21] Avi Levy, Harishchandra Ramadas, and Thomas Rothvoss: Deterministic discrepancy minimization via the multiplicative weight update method.", "subpage_snippet": "", "source": "theoryofcomputing.org", "link": "https://theoryofcomputing.org/articles/v015a015/bibliography.html", "content": "21] Avi Levy, Harishchandra Ramadas, and Thomas Rothvoss: Deterministic discrepancy minimization via the multiplicative weight update method."}
+{"idx": 5, "title": "Bibliography: Theory of Computing: An Open Access Electronic", "date": "", "ddg_snippet": "21] Avi Levy, Harishchandra Ramadas, and Thomas Rothvoss: Deterministic discrepancy minimization via the multiplicative weight update method.", "subpage_snippet": "", "source": "theoryofcomputing.org", "link": "http://theoryofcomputing.org/articles/v015a015/bibliography.html", "content": "21] Avi Levy, Harishchandra Ramadas, and Thomas Rothvoss: Deterministic discrepancy minimization via the multiplicative weight update method."}
+{"idx": 6, "title": "Bibliography: Theory of Computing: An Open Access Electronic", "date": "", "ddg_snippet": "... Bansal : Constructive algorithms for discrepancy ... 13] Shachar Lovett and Raghu Meka: Constructive discrepancy minimization by walking on the edges.", "subpage_snippet": "", "source": "theoryofcomputing.org", "link": "https://theoryofcomputing.org/articles/v015a010/bibliography.html", "content": "... Bansal : Constructive algorithms for discrepancy ... 13] Shachar Lovett and Raghu Meka: Constructive discrepancy minimization by walking on the edges."}
+{"idx": 7, "title": "Anupam Gupta - Publications", "date": "", "ddg_snippet": "The number of minimum k-cuts: improving the Karger-{Stein} bound ... Non-Preemptive Flow-Time Minimization via Rejections", "subpage_snippet": "", "source": "www.cs.cmu.edu", "link": "https://www.cs.cmu.edu/~anupamg/newpubspage/my-papers.html", "content": "The number of minimum k-cuts: improving the Karger-{Stein} bound ... Non-Preemptive Flow-Time Minimization via Rejections"}
+{"idx": 8, "title": "Raghu Meka - researchr alias", "date": "", "ddg_snippet": "Online Discrepancy Minimization for Stochastic Arrivals Nikhil Bansal 0001 , Haotian Jiang , Raghu Meka , Sahil Singla 0001 , Makrand Sinha .", "subpage_snippet": "", "source": "researchr.org", "link": "https://researchr.org/alias/raghu-meka", "content": "Online Discrepancy Minimization for Stochastic Arrivals Nikhil Bansal 0001 , Haotian Jiang , Raghu Meka , Sahil Singla 0001 , Makrand Sinha ."}
+{"idx": 9, "title": "Homepage of Mohit Singh", "date": "", "ddg_snippet": "Efficient Algorithms for Discrepancy Minimization in Convex Sets , Ronen Eldan and Mohit Singh, Random Structures and Algorithms, 2018.", "subpage_snippet": "", "source": "www2.isye.gatech.edu", "link": "https://www2.isye.gatech.edu/~msingh94/publications.html", "content": "Efficient Algorithms for Discrepancy Minimization in Convex Sets , Ronen Eldan and Mohit Singh, Random Structures and Algorithms, 2018."}

data/sampled_jsons/Beckers_2023_'Disjunctive_counterfactuals_using_causal_models_a_critical_examination'_year_2023.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Intervention and Conditioning in Causal Bayesian", "date": "", "ddg_snippet": "Beckers , S. ( 2023 ). Disjunctive counterfactuals using causal models : a critical examination .", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=DC28Fpk76s", "content": "Beckers , S. ( 2023 ). Disjunctive counterfactuals using causal models : a critical examination ."}
+{"idx": 1, "title": "(PDF) Intervention and Conditioning in Causal Bayesian Networks", "date": "", "ddg_snippet": "Disjunctive counterfactuals using causal models : a critical examination .Probabilities of causation are proven to be critical in modern decision-making. This paper deals with the problem of estimating the probabilities of causation when treatment and effect are not binary.", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/380847642_Intervention_and_Conditioning_in_Causal_Bayesian_Networks", "content": "Disjunctive counterfactuals using causal models : a critical examination .Probabilities of causation are proven to be critical in modern decision-making. This paper deals with the problem of estimating the probabilities of causation when treatment and effect are not binary."}
+{"idx": 2, "title": "Counterfactual Identifiability of Bijective Causal Models", "date": "", "ddg_snippet": "We study counterfactual identifiability in causal models with bijective generation mechanisms (BGM), a class that generalizes several widely- used causal models in the literature.", "subpage_snippet": "", "source": "proceedings.mlr.press", "link": "https://proceedings.mlr.press/v202/nasr-esfahany23a/nasr-esfahany23a.pdf", "content": "We study counterfactual identifiability in causal models with bijective generation mechanisms (BGM), a class that generalizes several widely- used causal models in the literature."}
+{"idx": 3, "title": "Connections between causal models and matrix completion via...", "date": "", "ddg_snippet": "In this thesis, we formalize these counterfactual statements using causal graphical models . In particular, we provide a new theoretical framework that connects causal graphs with factor models .", "subpage_snippet": "", "source": "upcommons.upc.edu", "link": "https://upcommons.upc.edu/handle/2117/394531", "content": "In this thesis, we formalize these counterfactual statements using causal graphical models . In particular, we provide a new theoretical framework that connects causal graphs with factor models ."}
+{"idx": 4, "title": "Disjunctive Counterfactuals in Alternative and", "date": "", "ddg_snippet": "Therefore using alternative semantics makes it possible for the consequent of a disjunctive counterfactual to operate on both constituent parts of the antecedent. Consequently an appropriate analysis of counterfactuals has to be chosen, which makes use of this possibility.", "subpage_snippet": "", "source": "projects.illc.uva.nl", "link": "https://projects.illc.uva.nl/inquisitivesemantics/assets/files/papers/Hiller2014_MoLproject-DisjunctiveCounterfactuals.pdf", "content": "Therefore using alternative semantics makes it possible for the consequent of a disjunctive counterfactual to operate on both constituent parts of the antecedent. Consequently an appropriate analysis of counterfactuals has to be chosen, which makes use of this possibility."}
+{"idx": 5, "title": "CLEAR : Can Language Models Really Understand Causal Graphs?", "date": "", "ddg_snippet": "To model and reason about causality , causal graphs offer a concise yet effective solution. Given the impressive ad-vancements in language models , a crucial ques-tion arises: can they really understand causal graphs?", "subpage_snippet": "", "source": "aclanthology.org", "link": "https://aclanthology.org/2024.findings-emnlp.363.pdf", "content": "To model and reason about causality , causal graphs offer a concise yet effective solution. Given the impressive ad-vancements in language models , a crucial ques-tion arises: can they really understand causal graphs?"}
+{"idx": 6, "title": "A Causal Analysis of Harm | Minds and Machines", "date": "", "ddg_snippet": "2 Causal Models and Actual Causality .A standard use of causal models is to define actual causation : that is, what it means for some particular event that occurred to cause another particular event.", "subpage_snippet": "", "source": "link.springer.com", "link": "https://link.springer.com/article/10.1007/s11023-024-09689-7", "content": "2 Causal Models and Actual Causality .A standard use of causal models is to define actual causation : that is, what it means for some particular event that occurred to cause another particular event."}
+{"idx": 7, "title": "Interpretability at Scale: Identifying Causal Mechanisms in Alpaca", "date": "", "ddg_snippet": "Causal Proxy Models for Concept-Based Model Explanations.Faithful Explanations of Black-box NLP Models Using LLM-generated Counterfactuals . Y. Gat, Nitay Calderon, Amir Feder, Alexander Chapanin, Amit Sharma, Roi Reichart.", "subpage_snippet": "", "source": "www.connectedpapers.com", "link": "https://www.connectedpapers.com/main/3f7fa58806614a1f38ae760c25c1305e3a87d4ce/Interpretability-at-Scale:-Identifying-Causal-Mechanisms-in-Alpaca/graph", "content": "Causal Proxy Models for Concept-Based Model Explanations.Faithful Explanations of Black-box NLP Models Using LLM-generated Counterfactuals . Y. Gat, Nitay Calderon, Amir Feder, Alexander Chapanin, Amit Sharma, Roi Reichart."}
+{"idx": 8, "title": "Analysis of Sales Shift in Retail with Causal ... | Technical Terrence", "date": "", "ddg_snippet": "1: A simplified example of Causal Impact in action. The top graph shows two time series: the orange line represents actual observed data, while the blue line is the model ’s prediction, created using covariates and endogenous components.", "subpage_snippet": "", "source": "technicalterrence.com", "link": "https://technicalterrence.com/tech/ai/analysis-of-sales-shift-in-retail-with-causal-impact-a-case-study-at-carrefour/", "content": "1: A simplified example of Causal Impact in action. The top graph shows two time series: the orange line represents actual observed data, while the blue line is the model ’s prediction, created using covariates and endogenous components."}
+{"idx": 9, "title": "Counterfactual Data Augmentation", "date": "", "ddg_snippet": "Using causal interventions we can manipulate specific attributes and synthesize new counterfactual images based on existing data.", "subpage_snippet": "", "source": "www.imperial.ac.uk", "link": "https://www.imperial.ac.uk/media/imperial-college/faculty-of-engineering/computing/public/distinguished-projects/2223-ug-projects/Counterfactual-data-augmentation-for-deep-learning-predictive-models.pdf", "content": "Using causal interventions we can manipulate specific attributes and synthesize new counterfactual images based on existing data."}

data/sampled_jsons/Beckers_2023_sitearxiv.org_OR_siteneurips.cc_Pearl_incorrect.jsonl

@@ -0,0 +1,8 @@
+{"idx": 0, "title": "arXiv:2412.09843v1 [cs.LG] 13 Dec 2024", "date": "", "ddg_snippet": "Abstract In this study, we address causal inference when only observa-tional data and a valid causal ordering from the causal graph are available. We introduce a set of flow models that can recover component-wise, invertible transformation of exoge-nous variables. Our flow-based methods offer flexible model design while maintaining causal consistency regardless of the number of discretization ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2412.09843", "content": "Abstract In this study, we address causal inference when only observa-tional data and a valid causal ordering from the causal graph are available. We introduce a set of flow models that can recover component-wise, invertible transformation of exoge-nous variables. Our flow-based methods offer flexible model design while maintaining causal consistency regardless of the number of discretization ..."}
+{"idx": 1, "title": "Interventionand Conditioning in Causal Bayesian Networks", "date": "", "ddg_snippet": "Abstract Causal models are crucial for understanding complex systems and identifying causal relationships among variables. Even though causal models are extremely popular, conditional probability calculation of formulas involving interventions pose significant challenges. In case of Causal Bayesian Networks (CBNs), Pearl assumes autonomy of mechanisms that determine interventions to calculate ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2405.14728", "content": "Abstract Causal models are crucial for understanding complex systems and identifying causal relationships among variables. Even though causal models are extremely popular, conditional probability calculation of formulas involving interventions pose significant challenges. In case of Causal Bayesian Networks (CBNs), Pearl assumes autonomy of mechanisms that determine interventions to calculate ..."}
+{"idx": 2, "title": "Characterization and Learning of Causal Graphs with Small ...", "date": "", "ddg_snippet": "Abstract Constraint-based causal discovery algorithms learn part of the causal graph struc-ture by systematically testing conditional independences observed in the data. These algorithms, such as the PC algorithm and its variants, rely on graphical characterizations of the so-called equivalence class of causal graphs proposed by Pearl . However, constraint-based causal discovery algorithms ...", "subpage_snippet": "", "source": "proceedings.neurips.cc", "link": "https://proceedings.neurips.cc/paper_files/paper/2023/file/eaef3b49866b942041a34bb8da397eb7-Paper-Conference.pdf", "content": "Abstract Constraint-based causal discovery algorithms learn part of the causal graph struc-ture by systematically testing conditional independences observed in the data. These algorithms, such as the PC algorithm and its variants, rely on graphical characterizations of the so-called equivalence class of causal graphs proposed by Pearl . However, constraint-based causal discovery algorithms ..."}
+{"idx": 3, "title": "Physics of droplet regulation in biological cells", "date": "", "ddg_snippet": "Sep 15, 2025 · Abstract Droplet formation has emerged as an essential concept for the spatiotemporal organisation of biomolecules in cells. However, classical descriptions of droplet dynamics based on passive liquid-liquid phase separation cannot capture the complex situation inside cells. This review discusses three distinct aspects that are crucial in cells: (i) biomolecules are diverse and individually ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2501.13639v3", "content": "Sep 15, 2025 · Abstract Droplet formation has emerged as an essential concept for the spatiotemporal organisation of biomolecules in cells. However, classical descriptions of droplet dynamics based on passive liquid-liquid phase separation cannot capture the complex situation inside cells. This review discusses three distinct aspects that are crucial in cells: (i) biomolecules are diverse and individually ..."}
+{"idx": 4, "title": "Intervention and Conditioning in Causal Bayesian Networks", "date": "", "ddg_snippet": "by S Galhotra · 2024 · Cited by 3 — Indeed, recent work of Beckers (2023 ) has shown that an approach given by Pearl (2000) to calculate these probabilities in a CBN is incorrect . 2 Pearl also ...", "subpage_snippet": "", "source": "proceedings.neurips.cc", "link": "https://proceedings.neurips.cc/paper_files/paper/2024/file/a2118322165fffb648d1e341ff5a5b05-Paper-Conference.pdf", "content": "by S Galhotra · 2024 · Cited by 3 — Indeed, recent work of Beckers (2023 ) has shown that an approach given by Pearl (2000) to calculate these probabilities in a CBN is incorrect . 2 Pearl also ..."}
+{"idx": 5, "title": "Learning Structural Causal Models from Ordering: Identifiable ...", "date": "", "ddg_snippet": "Abstract In this study, we address causal inference when only observational data and a valid causal ordering from the causal graph are available. We introduce a set of flow models that can recover component-wise, invertible transformation of exogenous variables. Our flow-based methods offer flexible model design while maintaining causal consistency regardless of the number of discretization ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2412.09843v1", "content": "Abstract In this study, we address causal inference when only observational data and a valid causal ordering from the causal graph are available. We introduce a set of flow models that can recover component-wise, invertible transformation of exogenous variables. Our flow-based methods offer flexible model design while maintaining causal consistency regardless of the number of discretization ..."}
+{"idx": 6, "title": "[2412.09843] Learning Structural Causal Models from Ordering ...", "date": "", "ddg_snippet": "Abstract In this study, we address causal inference when only observational data and a valid causal ordering from the causal graph are available. We introduce a set of flow models that can recover component-wise, invertible transformation of exogenous variables. Our flow-based methods offer flexible model design while maintaining causal consistency regardless of the number of discretization ...", "subpage_snippet": "", "source": "ar5iv.labs.arxiv.org", "link": "https://ar5iv.labs.arxiv.org/html/2412.09843", "content": "Abstract In this study, we address causal inference when only observational data and a valid causal ordering from the causal graph are available. We introduce a set of flow models that can recover component-wise, invertible transformation of exogenous variables. Our flow-based methods offer flexible model design while maintaining causal consistency regardless of the number of discretization ..."}
+{"idx": 7, "title": "Causal Inference on Time Series using Restricted Structural ...", "date": "", "ddg_snippet": "Abstract Causal inference uses observational data to infer the causal structure of the data generating system. We study a class of restricted Structural Equation Models for time series that we call Time Series Models with Independent Noise (TiMINo). These models require independent residual time series, whereas traditional meth-ods like Granger causality exploit the variance of residuals. This ...", "subpage_snippet": "", "source": "papers.neurips.cc", "link": "https://papers.neurips.cc/paper/5063-causal-inference-on-time-series-using-restricted-structural-equation-models.pdf", "content": "Abstract Causal inference uses observational data to infer the causal structure of the data generating system. We study a class of restricted Structural Equation Models for time series that we call Time Series Models with Independent Noise (TiMINo). These models require independent residual time series, whereas traditional meth-ods like Granger causality exploit the variance of residuals. This ..."}

data/sampled_jsons/Beyond_Self-Repellent_Kernels_History-Driven_Target_Efficient_Nonlinear_MCMC_General_Graphs.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "History-Driven Target Towards Efficient Nonlinear MCMC ...", "date": "", "ddg_snippet": "by J Hu · 2025 — We propose a history - driven target (HDT) framework in Markov Chain Monte Carlo ( MCMC ) to improve any random walk algorithm on discrete state spaces.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2505.18300", "content": "by J Hu · 2025 — We propose a history - driven target (HDT) framework in Markov Chain Monte Carlo ( MCMC ) to improve any random walk algorithm on discrete state spaces."}
+{"idx": 1, "title": "History-Driven Target Towards Efficient Nonlinear MCMC ...", "date": "", "ddg_snippet": "We propose a history - driven target (HDT) framework in Markov Chain Monte Carlo ( MCMC ) to improve any random walk algorithm on discrete state spaces, ...", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/virtual/2025/poster/46659", "content": "We propose a history - driven target (HDT) framework in Markov Chain Monte Carlo ( MCMC ) to improve any random walk algorithm on discrete state spaces, ..."}
+{"idx": 2, "title": "History-Driven Target Towards Efficient Nonlinear MCMC ...", "date": "", "ddg_snippet": "In this paper, we propose a history - driven target (HDT) framework for MCMC sampling on general graphs . By embedding self -repellency in the target rather than ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2505.18300v1", "content": "In this paper, we propose a history - driven target (HDT) framework for MCMC sampling on general graphs . By embedding self -repellency in the target rather than ..."}
+{"idx": 3, "title": "Our paper on efficient MCMC on graphs accepted at ICML 2025", "date": "", "ddg_snippet": "Excited to announce that our paper, “Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Non-linear MCMC on General Graphs ,” has been ...", "subpage_snippet": "", "source": "www.linkedin.com", "link": "https://www.linkedin.com/posts/jie-hu-ncsu_icml2025-mcmc-activity-7337284173516210176-FGlQ", "content": "Excited to announce that our paper, “Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Non-linear MCMC on General Graphs ,” has been ..."}
+{"idx": 4, "title": "Beyond Self-Repellent Kernels: History-Driven Target ...", "date": "", "ddg_snippet": "9 Jun 2025 — Overview. Introduces novel approach for efficient graph sampling using history-driven MCMC ; Improves upon self-repelling random walks by ...", "subpage_snippet": "", "source": "www.aimodels.fyi", "link": "https://www.aimodels.fyi/papers/arxiv/beyond-self-repellent-kernels-history-driven-target", "content": "9 Jun 2025 — Overview. Introduces novel approach for efficient graph sampling using history-driven MCMC ; Improves upon self-repelling random walks by ..."}
+{"idx": 5, "title": "Beyond Self-Repellent Kernels: History-Driven Target ...", "date": "", "ddg_snippet": "This research paper introduces a new method called the History-Driven Target (HDT) framework for improving sampling techniques used in random walks on ...", "subpage_snippet": "", "source": "bytez.com", "link": "https://bytez.com/docs/icml/46659/audio", "content": "This research paper introduces a new method called the History-Driven Target (HDT) framework for improving sampling techniques used in random walks on ..."}
+{"idx": 6, "title": "Beyond Self-Repellent Kernels: History-Driven Target Towards ...", "date": "", "ddg_snippet": "View recent discussion. Abstract: We propose a history - driven target (HDT) framework in Markov Chain Monte Carlo ( MCMC ) to improve any random walk algorithm ...", "subpage_snippet": "", "source": "www.alphaxiv.org", "link": "https://www.alphaxiv.org/abs/2505.18300", "content": "View recent discussion. Abstract: We propose a history - driven target (HDT) framework in Markov Chain Monte Carlo ( MCMC ) to improve any random walk algorithm ..."}
+{"idx": 7, "title": "Beyond Self-Repellent Kernels: History-Driven Target Towards ...", "date": "", "ddg_snippet": "error. 500. Oops, something went wrong!", "subpage_snippet": "", "source": "chatpaper.com", "link": "https://chatpaper.com/zh-CN/chatpaper/paper/141994", "content": "error. 500. Oops, something went wrong!"}
+{"idx": 8, "title": "ICML 2025 Beyond Self-Repellent Kernels", "date": "", "ddg_snippet": "The ICML Logo above may be used on presentations. Right-click and choose download. It is a vector graphic and may be used at any scale. Useful links. About ...", "subpage_snippet": "", "source": "dev.icml.cc", "link": "https://dev.icml.cc/virtual/2025/oral/47270", "content": "The ICML Logo above may be used on presentations. Right-click and choose download. It is a vector graphic and may be used at any scale. Useful links. About ..."}
+{"idx": 9, "title": "Downloads", "date": "", "ddg_snippet": "ADDP: Learning General Representations for Image Recognition and Generation with Alternating Denoising Diffusion Process", "subpage_snippet": "", "source": "iclr.cc", "link": "https://iclr.cc/Downloads/2024", "content": "ADDP: Learning General Representations for Image Recognition and Generation with Alternating Denoising Diffusion Process"}

data/sampled_jsons/Boltzmann-Aligned_Inverse_Folding_Model_BA-Cycle_method_Section_3.2_delta_delta_G_calculation_differ_year_2023.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Boltzmann-Aligned Inverse Folding Model as a Predictor of ... - GitHub", "date": "", "ddg_snippet": "The official implementation of our ICLR 2025 Spotlight paper \" Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions\", which establishes a bidirectional connection between log-likelihood in protein inverse folding models and Δ Δ G values.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/aim-uofa/BA-DDG", "content": "The official implementation of our ICLR 2025 Spotlight paper \" Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions\", which establishes a bidirectional connection between log-likelihood in protein inverse folding models and Δ Δ G values."}
+{"idx": 1, "title": "Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational ...", "date": "", "ddg_snippet": "Compared to previous inverse folding -based methods , our method explicitly accounts for the unbound state of protein complex in the Δ Δ 𝐺 \\ Delta\\Delta G roman_Δ roman_Δ italic_G thermodynamic cycle , introducing a physical inductive bias and achieving both supervised and unsupervised state-of-the-art (SoTA) performance.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2410.09543v1", "content": "Compared to previous inverse folding -based methods , our method explicitly accounts for the unbound state of protein complex in the Δ Δ 𝐺 \\ Delta\\Delta G roman_Δ roman_Δ italic_G thermodynamic cycle , introducing a physical inductive bias and achieving both supervised and unsupervised state-of-the-art (SoTA) performance."}
+{"idx": 2, "title": "AIDD论文详解：Boltzmann-Aligned Inverse Folding Model —— ICLR2025", "date": "", "ddg_snippet": "第一部分很好理解，在模型forward并利用式 (10)进行计算后可以得到预测的变化结合自由能 \\widehat { \\ Delta \\ Delta G } 与真实标签值 \\ Delta\\Delta G 计算MSE Loss；第二部分是衡量BA-DDG方法finetune后和原始模型的输出分布的KL散度，通俗点说就是希望finetune后的模型分布与原始 ...", "subpage_snippet": "", "source": "zhuanlan.zhihu.com", "link": "https://zhuanlan.zhihu.com/p/29398730183", "content": "第一部分很好理解，在模型forward并利用式 (10)进行计算后可以得到预测的变化结合自由能 \\widehat { \\ Delta \\ Delta G } 与真实标签值 \\ Delta\\Delta G 计算MSE Loss；第二部分是衡量BA-DDG方法finetune后和原始模型的输出分布的KL散度，通俗点说就是希望finetune后的模型分布与原始 ..."}
+{"idx": 3, "title": "[ICLR 2025 Spotlight] Boltzmann-Aligned Inverse Folding Model as a ...", "date": "", "ddg_snippet": "The official implementation of our ICLR 2025 Spotlight paper \" Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions\", which establishes a bidirectional connection between log-likelihood in protein inverse folding models and $\\ Delta\\Delta G $ values.", "subpage_snippet": "", "source": "github.jpy.wang", "link": "https://github.jpy.wang/aim-uofa/BA-DDG", "content": "The official implementation of our ICLR 2025 Spotlight paper \" Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions\", which establishes a bidirectional connection between log-likelihood in protein inverse folding models and $\\ Delta\\Delta G $ values."}
+{"idx": 4, "title": "Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational ...", "date": "", "ddg_snippet": "Compared to previous methods based on inverse folding , our method explicitly accounts for the unbound state of the protein complex in the $\\ Delta \\ Delta G $ thermodynamic cycle , introducing a physical inductive bias and achieving supervised and unsupervised state-of-the-art (SoTA) performance.Experimental results on SKEMPI v2 indicate that our ...", "subpage_snippet": "", "source": "proceedings.iclr.cc", "link": "https://proceedings.iclr.cc/paper_files/paper/2025/hash/2e10d50dfd2a9d52c06fbcd4ed89a022-Abstract-Conference.html", "content": "Compared to previous methods based on inverse folding , our method explicitly accounts for the unbound state of the protein complex in the $\\ Delta \\ Delta G $ thermodynamic cycle , introducing a physical inductive bias and achieving supervised and unsupervised state-of-the-art (SoTA) performance.Experimental results on SKEMPI v2 indicate that our ..."}
+{"idx": 5, "title": "Portal Weekly #67: MoML 2024, data-driven discovery, boltzmann-aligned ...", "date": "", "ddg_snippet": "Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions Predicting changes in binding free energy (∆∆ G ) is essential for understanding and modifying protein-protein interactions, which are important in drug design.", "subpage_snippet": "", "source": "m2d2.substack.com", "link": "https://m2d2.substack.com/p/portal-weekly-67-moml-2024-data-driven", "content": "Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions Predicting changes in binding free energy (∆∆ G ) is essential for understanding and modifying protein-protein interactions, which are important in drug design."}
+{"idx": 6, "title": "B -a Inverse Folding Model As a Predictor of Mutational Effects on ...", "date": "", "ddg_snippet": "In this work, we propose a technique named Boltzmann Alignment to transfer knowledge from pre-trained inverse folding models to ∆∆ G prediction. We first analyze the thermodynamic definition of ∆∆ G and introduce the Boltzmann distribution to connect energy with protein conformational distri-bution, thereby highlighting the potential of pre-trained probabilistic models . However, the ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2410.09543", "content": "In this work, we propose a technique named Boltzmann Alignment to transfer knowledge from pre-trained inverse folding models to ∆∆ G prediction. We first analyze the thermodynamic definition of ∆∆ G and introduce the Boltzmann distribution to connect energy with protein conformational distri-bution, thereby highlighting the potential of pre-trained probabilistic models . However, the ..."}
+{"idx": 7, "title": "Revisions | OpenReview", "date": "", "ddg_snippet": "Compared to previous methods based on inverse folding , our method explicitly accounts for the unbound state of the protein complex in the $\\ Delta \\ Delta G $ thermodynamic cycle , introducing a physical inductive bias and achieving supervised and unsupervised state-of-the-art (SoTA) performance.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/revisions?id=lzdFImKK8w", "content": "Compared to previous methods based on inverse folding , our method explicitly accounts for the unbound state of the protein complex in the $\\ Delta \\ Delta G $ thermodynamic cycle , introducing a physical inductive bias and achieving supervised and unsupervised state-of-the-art (SoTA) performance."}
+{"idx": 8, "title": "BA-DDG/README.md at master · aim-uofa/BA-DDG · GitHub", "date": "", "ddg_snippet": "The official implementation of our ICLR 2025 Spotlight paper \" Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions\", which establishes a bidirectional connection between log-likelihood in protein inverse folding models and Δ Δ G values.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/aim-uofa/BA-DDG/blob/master/README.md", "content": "The official implementation of our ICLR 2025 Spotlight paper \" Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions\", which establishes a bidirectional connection between log-likelihood in protein inverse folding models and Δ Δ G values."}
+{"idx": 9, "title": "Yang Tan - Homepage", "date": "", "ddg_snippet": "无监督方法 BA-Cycle ：将上述概率估算方法代入最终的 Δ Δ G 公式，便得到了一个无需训练的（无监督）评估方法，作者将其命名为 BA-Cycle 。", "subpage_snippet": "", "source": "tyang816.github.io", "link": "https://tyang816.github.io/bi/Boltzmann-Aligned-Inverse-Folding-Model-as-a-Predictor-of-Mutational-Effects-on-Protein-Protein-Interactions/", "content": "无监督方法 BA-Cycle ：将上述概率估算方法代入最终的 Δ Δ G 公式，便得到了一个无需训练的（无监督）评估方法，作者将其命名为 BA-Cycle 。"}

data/sampled_jsons/Boltzmann-Aligned_Inverse_Folding_Model_Equation_8_∆∆G_formula.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Maxwell– Boltzmann distribution - Wikipedia", "date": "", "ddg_snippet": "In physics, the Maxwell– Boltzmann distribution, or Maxwell distribution, is a particular probability distribution named after James Clerk Maxwell and Ludwig Boltzmann . It was first defined and used for describing particle speeds in idealized gases...", "subpage_snippet": "", "source": "en.wikipedia.org", "link": "https://en.wikipedia.org/wiki/Maxwell–Boltzmann_distribution", "content": "In physics, the Maxwell– Boltzmann distribution, or Maxwell distribution, is a particular probability distribution named after James Clerk Maxwell and Ludwig Boltzmann . It was first defined and used for describing particle speeds in idealized gases..."}
+{"idx": 1, "title": "Boltzmann-Aligned Inverse Folding Model as a Predictor of ...", "date": "", "ddg_snippet": "The official implementation of our ICLR 2025 Spotlight paper \" Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions\", which establishes a bidirectional connection between log-likelihood in protein inverse folding models and Δ Δ G values.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/aim-uofa/BA-DDG", "content": "The official implementation of our ICLR 2025 Spotlight paper \" Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions\", which establishes a bidirectional connection between log-likelihood in protein inverse folding models and Δ Δ G values."}
+{"idx": 2, "title": "B -A INVERSE FOLDING MODEL AS A PREDICTOR OF MUTATIONAL ...", "date": "", "ddg_snippet": "In this work, we propose a technique named Boltzmann Alignment to transfer knowledge from pre-trained inverse folding models to ∆∆G prediction. We first analyze the thermodynamic definition of ∆∆G and introduce the Boltzmann distribution to connect energy with protein conformational distri-bution, thereby highlighting the potential of pre-trained probabilistic models. However, the ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2410.09543", "content": "In this work, we propose a technique named Boltzmann Alignment to transfer knowledge from pre-trained inverse folding models to ∆∆G prediction. We first analyze the thermodynamic definition of ∆∆G and introduce the Boltzmann distribution to connect energy with protein conformational distri-bution, thereby highlighting the potential of pre-trained probabilistic models. However, the ..."}
+{"idx": 3, "title": "B -A INVERSE FOLDING MODEL AS A PREDICTOR OF MUTATIONAL ...", "date": "", "ddg_snippet": "ABSTRACT Predicting the change in binding free energy ( ∆∆G ) is crucial for understanding and modulating protein-protein interactions, which are critical in drug design. Due to the scarcity of experimental ∆∆G data, existing methods focus on pre-training, while neglecting the importance of alignment . In this work, we propose Boltzmann Alignment technique to transfer knowledge from pre ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=lzdFImKK8w", "content": "ABSTRACT Predicting the change in binding free energy ( ∆∆G ) is crucial for understanding and modulating protein-protein interactions, which are critical in drug design. Due to the scarcity of experimental ∆∆G data, existing methods focus on pre-training, while neglecting the importance of alignment . In this work, we propose Boltzmann Alignment technique to transfer knowledge from pre ..."}
+{"idx": 4, "title": "[ICLR 2025 Spotlight] Boltzmann-Aligned Inverse Folding Model ...", "date": "", "ddg_snippet": "The official implementation of our ICLR 2025 Spotlight paper \" Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions\", which establishes a bidirectional connection between log-likelihood in protein inverse folding models and $\\Delta\\Delta G $ values.", "subpage_snippet": "", "source": "github.jpy.wang", "link": "https://github.jpy.wang/aim-uofa/BA-DDG", "content": "The official implementation of our ICLR 2025 Spotlight paper \" Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions\", which establishes a bidirectional connection between log-likelihood in protein inverse folding models and $\\Delta\\Delta G $ values."}
+{"idx": 5, "title": "Boltzmann-Aligned Inverse Folding Model as a Predictor of ...", "date": "", "ddg_snippet": "Compared to previous methods based on inverse folding , our method explicitly accounts for the unbound state of the protein complex in the $\\Delta \\Delta G $ thermodynamic cycle, introducing a physical inductive bias and achieving supervised and unsupervised state-of-the-art (SoTA) performance.Experimental results on SKEMPI v2 indicate that our ...", "subpage_snippet": "", "source": "proceedings.iclr.cc", "link": "https://proceedings.iclr.cc/paper_files/paper/2025/hash/2e10d50dfd2a9d52c06fbcd4ed89a022-Abstract-Conference.html", "content": "Compared to previous methods based on inverse folding , our method explicitly accounts for the unbound state of the protein complex in the $\\Delta \\Delta G $ thermodynamic cycle, introducing a physical inductive bias and achieving supervised and unsupervised state-of-the-art (SoTA) performance.Experimental results on SKEMPI v2 indicate that our ..."}
+{"idx": 6, "title": "Boltzmann-Aligned Inverse Folding Model as a Predictor of ...", "date": "", "ddg_snippet": "Oct 12, 2024 · Download Citation | Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions | Predicting the change in binding free energy ($\\Delta \\Delta G ...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/384930266_Boltzmann-Aligned_Inverse_Folding_Model_as_a_Predictor_of_Mutational_Effects_on_Protein-Protein_Interactions", "content": "Oct 12, 2024 · Download Citation | Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions | Predicting the change in binding free energy ($\\Delta \\Delta G ..."}
+{"idx": 7, "title": "Boltzmann - Aligned Inverse Folding Model as... | OpenReview", "date": "", "ddg_snippet": "However, the protein conformational distribution is intractable. Therefore, we employ Bayes’ theorem to circumvent direct estimation and instead utilize the log-likelihood provided by protein inverse folding models for the estimation of $\\Delta\\Delta G ...", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/forum?id=lzdFImKK8w", "content": "However, the protein conformational distribution is intractable. Therefore, we employ Bayes’ theorem to circumvent direct estimation and instead utilize the log-likelihood provided by protein inverse folding models for the estimation of $\\Delta\\Delta G ..."}
+{"idx": 8, "title": "Inverse Folding ICML 2022", "date": "", "ddg_snippet": "Training with predicted structures improves inverse folding model performance on the following zero-shot prediction tasks", "subpage_snippet": "", "source": "icml.cc", "link": "https://icml.cc/media/icml-2022/Slides/16886.pdf", "content": "Training with predicted structures improves inverse folding model performance on the following zero-shot prediction tasks"}
+{"idx": 9, "title": "Approximation of the Linear Boltzmann Equation by the... | CoLab", "date": "", "ddg_snippet": "In order to describe Brownian motion rigorously, Boltzmann ’s integral equation must be used. The Fokker-Planck type of equation is only an approximation to the Boltzmann equation and its domain of validity is worth examining.", "subpage_snippet": "", "source": "colab.ws", "link": "https://colab.ws/articles/10.1103/physrev.162.186", "content": "In order to describe Brownian motion rigorously, Boltzmann ’s integral equation must be used. The Fokker-Planck type of equation is only an approximation to the Boltzmann equation and its domain of validity is worth examining."}

data/sampled_jsons/Boltzmann-Aligned_Inverse_Folding_Model_discussion_conclusion_limitations.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "[2410.09543] Boltzmann-Aligned Inverse Folding Model as a ...", "date": "", "ddg_snippet": "Oct 12, 2024 · In this work, we propose the Boltzmann Alignment technique to transfer knowledge from pre-trained inverse folding models to ΔΔG prediction. We begin by analyzing the thermodynamic definition of ΔΔG and introducing the Boltzmann distribution to connect energy with protein conformational distribution.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2410.09543", "content": "Oct 12, 2024 · In this work, we propose the Boltzmann Alignment technique to transfer knowledge from pre-trained inverse folding models to ΔΔG prediction. We begin by analyzing the thermodynamic definition of ΔΔG and introducing the Boltzmann distribution to connect energy with protein conformational distribution."}
+{"idx": 1, "title": "Boltzmann-Aligned Inverse Folding Model as a Predictor of ...", "date": "", "ddg_snippet": "The official implementation of our ICLR 2025 Spotlight paper \" Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions\", which establishes a bidirectional connection between log-likelihood in protein inverse folding models and Δ Δ G values.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/aim-uofa/BA-DDG", "content": "The official implementation of our ICLR 2025 Spotlight paper \" Boltzmann-Aligned Inverse Folding Model as a Predictor of Mutational Effects on Protein-Protein Interactions\", which establishes a bidirectional connection between log-likelihood in protein inverse folding models and Δ Δ G values."}
+{"idx": 2, "title": "AIDD论文详解：Boltzmann-Aligned Inverse Folding Model —— ICLR2025", "date": "", "ddg_snippet": "玻尔兹曼对齐（ Boltzmann Alignment） 我知道大家看公式头皮发麻，所以在这里简单介绍一下侧重点： 公式1-4、5-7基本就是简单的代换，重点理解思想（加粗部分）即可，不需要自己推导。", "subpage_snippet": "", "source": "zhuanlan.zhihu.com", "link": "https://zhuanlan.zhihu.com/p/29398730183", "content": "玻尔兹曼对齐（ Boltzmann Alignment） 我知道大家看公式头皮发麻，所以在这里简单介绍一下侧重点： 公式1-4、5-7基本就是简单的代换，重点理解思想（加粗部分）即可，不需要自己推导。"}
+{"idx": 3, "title": "B -A INVERSE FOLDING MODEL AS A PREDICTOR OF MUTATIONAL ...", "date": "", "ddg_snippet": "existing methods focus on pre-training, while neglecting the importance of alignment. In this work, we propose Boltzmann Alignment technique o transfer knowledge from pre-trained inverse folding models to prediction of ∆∆G. We begin by analyzing the thermodynamic definition of ∆∆G and introducing t", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=lzdFImKK8w", "content": "existing methods focus on pre-training, while neglecting the importance of alignment. In this work, we propose Boltzmann Alignment technique o transfer knowledge from pre-trained inverse folding models to prediction of ∆∆G. We begin by analyzing the thermodynamic definition of ∆∆G and introducing t"}
+{"idx": 4, "title": "Advancing protein evolution with inverse folding models ...", "date": "", "ddg_snippet": "Aug 21, 2025 · Results Prediction of HF substitutions using structure-constrained inverse folding models Our goal was to assess the effectiveness of generalized inverse folding models in directing protein evolution and, if effective, to develop a new protein engineering approach that eliminates the need for custom models or multiple iterations.", "subpage_snippet": "", "source": "www.sciencedirect.com", "link": "https://www.sciencedirect.com/science/article/pii/S0092867425006804", "content": "Aug 21, 2025 · Results Prediction of HF substitutions using structure-constrained inverse folding models Our goal was to assess the effectiveness of generalized inverse folding models in directing protein evolution and, if effective, to develop a new protein engineering approach that eliminates the need for custom models or multiple iterations."}
+{"idx": 5, "title": "Boltzmann-Aligned Inverse Folding Model as a Predictor of ...", "date": "", "ddg_snippet": "However, the protein conformational distribution is intractable. Therefore, we employ Bayes’ theorem to circumvent direct estimation and instead utilize the log-likelihood provided by protein inverse folding models for the estimation of $\\Delta\\Delta G$.", "subpage_snippet": "", "source": "proceedings.iclr.cc", "link": "https://proceedings.iclr.cc/paper_files/paper/2025/hash/2e10d50dfd2a9d52c06fbcd4ed89a022-Abstract-Conference.html", "content": "However, the protein conformational distribution is intractable. Therefore, we employ Bayes’ theorem to circumvent direct estimation and instead utilize the log-likelihood provided by protein inverse folding models for the estimation of $\\Delta\\Delta G$."}
+{"idx": 6, "title": "B -A INVERSE FOLDING MODEL AS A PREDICTOR OF MUTATIONAL ...", "date": "", "ddg_snippet": "In this work, we propose a technique named Boltzmann Alignment to transfer knowledge from pre-trained inverse folding models to ∆∆G prediction. We first analyze the thermodynamic definition of ∆∆G and introduce the Boltzmann distribution to connect energy with protein conformational distri-bution, thereby highlighting the potential of pre-trained probabilistic models. However, the ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2410.09543", "content": "In this work, we propose a technique named Boltzmann Alignment to transfer knowledge from pre-trained inverse folding models to ∆∆G prediction. We first analyze the thermodynamic definition of ∆∆G and introduce the Boltzmann distribution to connect energy with protein conformational distri-bution, thereby highlighting the potential of pre-trained probabilistic models. However, the ..."}
+{"idx": 7, "title": "Boltzmann-Aligned Inverse Folding Model as a Predictor of ...", "date": "", "ddg_snippet": "12 Oct 2024 — In this work, we propose the Boltzmann Alignment technique to transfer knowledge from pre-trained inverse folding models to Δ Δ G Δ Δ G \\ ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2410.09543v1", "content": "12 Oct 2024 — In this work, we propose the Boltzmann Alignment technique to transfer knowledge from pre-trained inverse folding models to Δ Δ G Δ Δ G \\ ..."}
+{"idx": 8, "title": "[Literature Review] Boltzmann-Aligned Inverse Folding Model as ...", "date": "", "ddg_snippet": "This page provides the most accurate and concise summary worldwide for the paper titled Boltzmann - Aligned Inverse Folding Model as a Predictor of Mutational ...", "subpage_snippet": "", "source": "www.themoonlight.io", "link": "https://www.themoonlight.io/en/review/boltzmann-aligned-inverse-folding-model-as-a-predictor-of-mutational-effects-on-protein-protein-interactions", "content": "This page provides the most accurate and concise summary worldwide for the paper titled Boltzmann - Aligned Inverse Folding Model as a Predictor of Mutational ..."}
+{"idx": 9, "title": "Protein folding stability estimation with explicit ...", "date": "", "ddg_snippet": "by H Lee · 2025 — These limitations listed above define key directions for the future model development toward enhancing the scope and accuracy of protein ... 22 pages", "subpage_snippet": "", "source": "www.biorxiv.org", "link": "https://www.biorxiv.org/content/10.1101/2025.02.10.637420v2.full.pdf", "content": "by H Lee · 2025 — These limitations listed above define key directions for the future model development toward enhancing the scope and accuracy of protein ... 22 pages"}

data/sampled_jsons/CALF_model_Liu_et_al_2024_time_series_forecasting_language_model_year_2024.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "[2403.07300] CALF: Aligning LLMs for Time Series Forecasting via Cross ...", "date": "", "ddg_snippet": "Deep learning (e.g., Transformer) has been widely and successfully used in multivariate time series forecasting (MTSF). Unlike existing methods that focus on training models from a single modal of time series input, large language models (LLMs) based MTSF methods with cross-modal text and time series input have recently shown great superiority, especially with limited temporal data. However ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2403.07300", "content": "Deep learning (e.g., Transformer) has been widely and successfully used in multivariate time series forecasting (MTSF). Unlike existing methods that focus on training models from a single modal of time series input, large language models (LLMs) based MTSF methods with cross-modal text and time series input have recently shown great superiority, especially with limited temporal data. However ..."}
+{"idx": 1, "title": "CALF: Aligning LLMs for Time Series Forecasting via Cross ... - GitHub", "date": "", "ddg_snippet": "Current LLM-based methods either use linear layers to project time series to the LLM's feature dimension or employ cross-attention and contrastive learning techniques, which address only the input side and overlook alignment in the deeper layers. Our CALF achieves better alignment through multi-level cross-modal fine-tuning.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/Hank0626/CALF", "content": "Current LLM-based methods either use linear layers to project time series to the LLM's feature dimension or employ cross-attention and contrastive learning techniques, which address only the input side and overlook alignment in the deeper layers. Our CALF achieves better alignment through multi-level cross-modal fine-tuning."}
+{"idx": 2, "title": "PDF Are Language Models Actually Useful for Time Series Forecasting?", "date": "", "ddg_snippet": "This hypothesis is unsurprising given language models are now pervasive in machine learning research. However, direct connections between language modeling and time series forecasting remain largely undefined. So to what extent is language modeling really beneficial for traditional time series tasks?", "subpage_snippet": "", "source": "proceedings.neurips.cc", "link": "https://proceedings.neurips.cc/paper_files/paper/2024/file/6ed5bf446f59e2c6646d23058c86424b-Paper-Conference.pdf", "content": "This hypothesis is unsurprising given language models are now pervasive in machine learning research. However, direct connections between language modeling and time series forecasting remain largely undefined. So to what extent is language modeling really beneficial for traditional time series tasks?"}
+{"idx": 3, "title": "Paper page - CALF: Aligning LLMs for Time Series Forecasting via Cross ...", "date": "", "ddg_snippet": "Abstract A novel Cross-Modal LLM Fine-Tuning ( CALF ) framework reduces distribution discrepancy between text and time series data for improved multivariate time series forecasting , achieving state-of-the-art performance with low computational complexity.", "subpage_snippet": "", "source": "huggingface.co", "link": "https://huggingface.co/papers/2403.07300", "content": "Abstract A novel Cross-Modal LLM Fine-Tuning ( CALF ) framework reduces distribution discrepancy between text and time series data for improved multivariate time series forecasting , achieving state-of-the-art performance with low computational complexity."}
+{"idx": 4, "title": "Table 4 from CALF: Aligning LLMs for Time Series Forecasting via Cross ...", "date": "", "ddg_snippet": "This work leverages pre-trained Large Language Models to enhance time-series forecasting and adopts several Parameter-Efficient Fine-Tuning (PEFT) techniques, which have yielded state-of-the-art results in long-term forecasting .", "subpage_snippet": "", "source": "www.semanticscholar.org", "link": "https://www.semanticscholar.org/paper/CALF:-Aligning-LLMs-for-Time-Series-Forecasting-via-Liu-Guo/c5af46d51668c054e00c6419a522862531eaf9cc/figure/6", "content": "This work leverages pre-trained Large Language Models to enhance time-series forecasting and adopts several Parameter-Efficient Fine-Tuning (PEFT) techniques, which have yielded state-of-the-art results in long-term forecasting ."}
+{"idx": 5, "title": "Are Language Models Actually Useful for Time Series Forecasting?", "date": "", "ddg_snippet": "Large language models (LLMs) are being applied to time series forecasting . But are language models actually useful for time series ? In a series of ablation studies on three recent and popular LLM-based time series forecasting methods, we find that removing the LLM component or replacing it with a basic attention layer does not degrade forecasting performance -- in most cases, the results even ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2406.16964", "content": "Large language models (LLMs) are being applied to time series forecasting . But are language models actually useful for time series ? In a series of ablation studies on three recent and popular LLM-based time series forecasting methods, we find that removing the LLM component or replacing it with a basic attention layer does not degrade forecasting performance -- in most cases, the results even ..."}
+{"idx": 6, "title": "CALF: Aligning LLMs for Time Series Forecasting via Cross-modal Fine-Tuning", "date": "", "ddg_snippet": "Introduction Multivariate time series forecasting (MTSF) plays a crucial role in the domain of time series analysis and has further boasted a wide range of real-world applications including weather forecasting (Angryk et al . 2020), energy predic-tion (Demirel et al . 2012), financial modeling (Patton 2013).", "subpage_snippet": "", "source": "ojs.aaai.org", "link": "https://ojs.aaai.org/index.php/AAAI/article/view/34082/36237", "content": "Introduction Multivariate time series forecasting (MTSF) plays a crucial role in the domain of time series analysis and has further boasted a wide range of real-world applications including weather forecasting (Angryk et al . 2020), energy predic-tion (Demirel et al . 2012), financial modeling (Patton 2013)."}
+{"idx": 7, "title": "CALF/README.md at main · Hank0626/CALF · GitHub", "date": "", "ddg_snippet": "Current LLM-based methods either use linear layers to project time series to the LLM's feature dimension or employ cross-attention and contrastive learning techniques, which address only the input side and overlook alignment in the deeper layers. Our CALF achieves better alignment through multi-level cross-modal fine-tuning.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/Hank0626/CALF/blob/main/README.md", "content": "Current LLM-based methods either use linear layers to project time series to the LLM's feature dimension or employ cross-attention and contrastive learning techniques, which address only the input side and overlook alignment in the deeper layers. Our CALF achieves better alignment through multi-level cross-modal fine-tuning."}
+{"idx": 8, "title": "Large language models for time series | Proceedings of the Thirty-Third ...", "date": "", "ddg_snippet": "Large Language Models (LLMs) have seen significant use in domains such as natural language processing and computer vision. Going beyond text, image and graphics, LLMs present a significant potential for analysis of time series data, benefiting domains such as climate, IoT, healthcare, traffic, audio and finance. This survey paper provides an in-depth exploration and a detailed taxonomy of the ...", "subpage_snippet": "", "source": "dl.acm.org", "link": "https://dl.acm.org/doi/10.24963/ijcai.2024/921", "content": "Large Language Models (LLMs) have seen significant use in domains such as natural language processing and computer vision. Going beyond text, image and graphics, LLMs present a significant potential for analysis of time series data, benefiting domains such as climate, IoT, healthcare, traffic, audio and finance. This survey paper provides an in-depth exploration and a detailed taxonomy of the ..."}
+{"idx": 9, "title": "Time-LLM: Time Series Forecasting by Reprogramming Large Language Models", "date": "", "ddg_snippet": "Time series forecasting holds significant importance in many real-world dynamic systems and has been extensively studied. Unlike natural language process (NLP) and computer vision (CV), where a single large model can tackle multiple tasks, models for time series forecasting are often specialized, necessitating distinct designs for different tasks and applications. While pre-trained foundation ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2310.01728", "content": "Time series forecasting holds significant importance in many real-world dynamic systems and has been extensively studied. Unlike natural language process (NLP) and computer vision (CV), where a single large model can tackle multiple tasks, models for time series forecasting are often specialized, necessitating distinct designs for different tasks and applications. While pre-trained foundation ..."}

data/sampled_jsons/CVE-Bench_CVE-2024_CVE-2023_CVE-2022_CVSS_10.0_9.9_9.8_highest_score_Table_year_2025.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "Security Vulnerabilities, CVEs Published In 2024 - CVEdetails.com", "date": "", "ddg_snippet": "Security vulnerabilities, CVEs published in 2024Firecrawl is a web scraper that allows users to extract the content of a webpage for a large language model. Versions prior to 1.1.1 contain a server-side request forgery (SSRF) vulnerability. The scraping engine could be exploited by crafting a malicious site that redirects to a local IP address. This allowed exfiltration of local network ...", "subpage_snippet": "", "source": "www.cvedetails.com", "link": "https://www.cvedetails.com/vulnerability-list/year-2024/vulnerabilities.html", "content": "Security vulnerabilities, CVEs published in 2024Firecrawl is a web scraper that allows users to extract the content of a webpage for a large language model. Versions prior to 1.1.1 contain a server-side request forgery (SSRF) vulnerability. The scraping engine could be exploited by crafting a malicious site that redirects to a local IP address. This allowed exfiltration of local network ..."}
+{"idx": 1, "title": "CVE: Common Vulnerabilities and Exposures", "date": "", "ddg_snippet": "At cve .org, we provide the authoritative reference method for publicly known information-security vulnerabilities and exposures", "subpage_snippet": "", "source": "www.cve.org", "link": "https://www.cve.org/", "content": "At cve .org, we provide the authoritative reference method for publicly known information-security vulnerabilities and exposures"}
+{"idx": 2, "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."}
+{"idx": 3, "title": "2024 CVEs in Review - Vulnerability Blog", "date": "", "ddg_snippet": "When comparing the averages , 2024 saw an average score of 7.1, a drop from 7.7 ( 2023 ), 7.8 ( 2022 ), 7.7 (2021), and 7.8 (2020) and which tells the story in a more drastic way. Last year was the largest drop ever and the 2nd largest change ever (2016 +1.1 score ) when the concept of a CNA was introduced.", "subpage_snippet": "", "source": "vulnerability.blog", "link": "https://vulnerability.blog/2025/01/14/2024-cves-in-review/", "content": "When comparing the averages , 2024 saw an average score of 7.1, a drop from 7.7 ( 2023 ), 7.8 ( 2022 ), 7.7 (2021), and 7.8 (2020) and which tells the story in a more drastic way. Last year was the largest drop ever and the 2nd largest change ever (2016 +1.1 score ) when the concept of a CNA was introduced."}
+{"idx": 4, "title": "2024 CVE Review - \"Critical, High, Medium\" Position Shifting in ...", "date": "", "ddg_snippet": "Compared to 2023 , the average CVSS score decreased from 7.09 to 6.9, while the median fell from 7.2 to 6.5—a 9.7% reduction. This drop aligns with a larger trend of declining CVSS scores observed over the past few years, raising questions about whether software is becoming more secure or if vulnerabilities are being assessed differently.", "subpage_snippet": "", "source": "cybersecuritynews.com", "link": "https://cybersecuritynews.com/2024-cve-review/", "content": "Compared to 2023 , the average CVSS score decreased from 7.09 to 6.9, while the median fell from 7.2 to 6.5—a 9.7% reduction. This drop aligns with a larger trend of declining CVSS scores observed over the past few years, raising questions about whether software is becoming more secure or if vulnerabilities are being assessed differently."}
+{"idx": 5, "title": "Over 40,000 CVEs Published in 2024, Marking a 38% Increase from 2023", "date": "", "ddg_snippet": "The year 2024 marked a significant milestone in cybersecurity, featuring an extraordinary surge in Common Vulnerabilities and Exposures ( CVE ) data. With the release of over 40,000 CVEs , the industry has seen a dramatic increase of more than 38% compared to the 28,818 CVEs published in 2023 . CVEs By The Numbers The statistics from 2024 reveal an average of 108 CVEs published daily. May stood ...", "subpage_snippet": "", "source": "cyberpress.org", "link": "https://cyberpress.org/over-40000-cves-published-in-2024/", "content": "The year 2024 marked a significant milestone in cybersecurity, featuring an extraordinary surge in Common Vulnerabilities and Exposures ( CVE ) data. With the release of over 40,000 CVEs , the industry has seen a dramatic increase of more than 38% compared to the 28,818 CVEs published in 2023 . CVEs By The Numbers The statistics from 2024 reveal an average of 108 CVEs published daily. May stood ..."}
+{"idx": 6, "title": "2024: A Record-Breaking Year in Cybersecurity Vulnerabilities", "date": "", "ddg_snippet": "2024 marks the seventh consecutive year of record-high CVE publications, with 15.32% of all CVEs ever recorded being published this year alone. The average CVSS score of 6.67 highlights the severity of these vulnerabilities, with 231 achieving a perfect 10.0 score .", "subpage_snippet": "", "source": "undercodenews.com", "link": "https://undercodenews.com/2024-a-record-breaking-year-in-cybersecurity-vulnerabilities/", "content": "2024 marks the seventh consecutive year of record-high CVE publications, with 15.32% of all CVEs ever recorded being published this year alone. The average CVSS score of 6.67 highlights the severity of these vulnerabilities, with 231 achieving a perfect 10.0 score ."}
+{"idx": 7, "title": "Vulnerability Summary for the Week of February 12, 2024 - CISA", "date": "", "ddg_snippet": "( CVE ) vulnerability naming standard and are organized according to severity, determined by the Common Vulnerability Scoring System ( CVSS ) standard. The division of high, medium, and low severities correspond to the following scores : High: vulnerabilities with a CVSS base score of 7.0-10.0 Medium: vulnerabilities with a CVSS base score of 4.0 ...", "subpage_snippet": "", "source": "www.cisa.gov", "link": "https://www.cisa.gov/news-events/bulletins/sb24-051", "content": "( CVE ) vulnerability naming standard and are organized according to severity, determined by the Common Vulnerability Scoring System ( CVSS ) standard. The division of high, medium, and low severities correspond to the following scores : High: vulnerabilities with a CVSS base score of 7.0-10.0 Medium: vulnerabilities with a CVSS base score of 4.0 ..."}
+{"idx": 8, "title": "CVE Security Vulnerability Database (Published in 2024)", "date": "", "ddg_snippet": "Identify Unique Vulnerabilities using our Year on Year CVE Database. This Vulnerability Database Contains Insight on Vulnerabilities Published in the Year 2024 .", "subpage_snippet": "", "source": "www.clouddefense.ai", "link": "https://www.clouddefense.ai/cve/2024", "content": "Identify Unique Vulnerabilities using our Year on Year CVE Database. This Vulnerability Database Contains Insight on Vulnerabilities Published in the Year 2024 ."}
+{"idx": 9, "title": "Nvd - Cve-2023-2024", "date": "", "ddg_snippet": "Information Technology Laboratory National Vulnerability DatabaseVulnerabilities", "subpage_snippet": "", "source": "nvd.nist.gov", "link": "https://nvd.nist.gov/vuln/detail/CVE-2023-2024", "content": "Information Technology Laboratory National Vulnerability DatabaseVulnerabilities"}

data/sampled_jsons/CVE-Bench_T-Agent_sqlmap_integration_database_access_improvement.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "GitHub - uiuc-kang-lab/cve-bench: CVE-Bench: A Benchmark for ...", "date": "", "ddg_snippet": "Apr 24, 2025 · 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": "Apr 24, 2025 · 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": 1, "title": "CVE-Bench: A Benchmark for AI Agents’ Ability to Exploit Real ...", "date": "", "ddg_snippet": "Building a benchmark for real-world vulnerabilities involves both specialized expertise to reproduce exploits and a systematic approach to evaluating unpredictable threats. To address this challenge, we introduce CVE-Bench , a real-world cybersecurity benchmark based on critical-severity Common Vulnerabilities and Exposures.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2503.17332v1", "content": "Building a benchmark for real-world vulnerabilities involves both specialized expertise to reproduce exploits and a systematic approach to evaluating unpredictable threats. To address this challenge, we introduce CVE-Bench , a real-world cybersecurity benchmark based on critical-severity Common Vulnerabilities and Exposures."}
+{"idx": 2, "title": "uiuc-kang-lab/cve-bench | DeepWiki", "date": "", "ddg_snippet": "May 12, 2025 · What is CVE-Bench ? 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/1-overview", "content": "May 12, 2025 · What is CVE-Bench ? 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": 3, "title": "CVE-Bench: Benchmarking LLM-based Software Engineering Agent ...", "date": "", "ddg_snippet": "3 days ago · CVE-Bench : Benchmarking LLM-based Software Engineering Agent ’s Ability to Repair Real-World CVE Vulnerabilities. In Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers), pages 4207–4224, Albuquerque, New Mexico.", "subpage_snippet": "", "source": "aclanthology.org", "link": "https://aclanthology.org/2025.naacl-long.212/", "content": "3 days ago · CVE-Bench : Benchmarking LLM-based Software Engineering Agent ’s Ability to Repair Real-World CVE Vulnerabilities. In Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers), pages 4207–4224, Albuquerque, New Mexico."}
+{"idx": 4, "title": "From SQL Queries to Exploits: The Art of Database Pentesting ...", "date": "", "ddg_snippet": "Apr 12, 2025 · Database penetration testing is a critical skill for cybersecurity professionals, and SQLmap is one of the most powerful tools for automating SQL injection attacks.", "subpage_snippet": "", "source": "undercodetesting.com", "link": "https://undercodetesting.com/from-sql-queries-to-exploits-the-art-of-database-pentesting-with-sqlmap/", "content": "Apr 12, 2025 · Database penetration testing is a critical skill for cybersecurity professionals, and SQLmap is one of the most powerful tools for automating SQL injection attacks."}
+{"idx": 5, "title": "SQL Injection Attacks – How To Use SQLMap To Find Database ...", "date": "", "ddg_snippet": "Aug 26, 2024 · SQL injection attacks allow hackers to insert malicious SQL code into application queries in order to access or destroy sensitive data in databases. According to security experts, SQL injection is one of the most common and dangerous application vulnerabilities. In this comprehensive 2600+ word guide, we will understand what SQL injection is, learn how to use the powerful SQLMap tool to find ...", "subpage_snippet": "", "source": "expertbeacon.com", "link": "https://expertbeacon.com/sql-injection-attacks-how-to-use-sqlmap-to-find-database-vulnerabilities/", "content": "Aug 26, 2024 · SQL injection attacks allow hackers to insert malicious SQL code into application queries in order to access or destroy sensitive data in databases. According to security experts, SQL injection is one of the most common and dangerous application vulnerabilities. In this comprehensive 2600+ word guide, we will understand what SQL injection is, learn how to use the powerful SQLMap tool to find ..."}
+{"idx": 6, "title": "Measuring AI Agents’ Ability to Exploit Web Applications", "date": "", "ddg_snippet": "Mar 31, 2025 · This highlights the need for continuous improvement in evaluating, red-teaming, and regulating AI agents . We hope CVE-bench can serve as a valuable tool for the community to assess the risks of ...", "subpage_snippet": "", "source": "medium.com", "link": "https://medium.com/@danieldkang/measuring-ai-agents-ability-to-exploit-web-applications-ba4225aa281f", "content": "Mar 31, 2025 · This highlights the need for continuous improvement in evaluating, red-teaming, and regulating AI agents . We hope CVE-bench can serve as a valuable tool for the community to assess the risks of ..."}
+{"idx": 7, "title": "CVE - Bench : A Benchmark for AI Agents ' Ability to Exploit Real-World...", "date": "", "ddg_snippet": "To exploit a database access vulnerability , the LLM agents need to retrieve the data in a specific table.B.4. Using CVE - Bench via inspect ai CVE - Bench is fully integrated with inspect ai, an open-source framework for LLM evaluations (AI Security Institute).", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/pdf/2503.17332", "content": "To exploit a database access vulnerability , the LLM agents need to retrieve the data in a specific table.B.4. Using CVE - Bench via inspect ai CVE - Bench is fully integrated with inspect ai, an open-source framework for LLM evaluations (AI Security Institute)."}
+{"idx": 8, "title": "Sqlmap - HackTricks", "date": "", "ddg_snippet": "Docker release_ agent cgroups escape.References. SQLMap : Testing SQL Database Vulnerabilities .", "subpage_snippet": "", "source": "book.hacktricks.wiki", "link": "https://book.hacktricks.wiki/en/pentesting-web/sql-injection/sqlmap.html", "content": "Docker release_ agent cgroups escape.References. SQLMap : Testing SQL Database Vulnerabilities ."}
+{"idx": 9, "title": "Инструкция по использованию sqlmap . Ч.1: Основы... - HackWare.ru", "date": "", "ddg_snippet": "Что такое sqlmap , для чего она нужна. Программа sqlmap позволяет проверять сайты на наличие в них уязвимости SQL-инъекция, уязвимости XSS, а также эксплуатировать SQL-инъекцию.", "subpage_snippet": "", "source": "HackWare.ru", "link": "https://HackWare.ru/?p=1928", "content": "Что такое sqlmap , для чего она нужна. Программа sqlmap позволяет проверять сайты на наличие в них уязвимости SQL-инъекция, уязвимости XSS, а также эксплуатировать SQL-инъекцию."}

data/sampled_jsons/Can_We_Leave_Deepfake_Data_Behind_in_Training_Deepfake_Detector_Table_2_C-Avg_AUC_Transition_Loss_ab.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "[2408.17052] Can We Leave Deepfake Data Behind in Training ...", "date": "", "ddg_snippet": "Specifically, blendfake and deepfake can be explicitly delineated as the oriented pivot anchors between \"real-to-fake\" transitions . The accumulation of forgery information should be oriented and progressively increasing during this transition process.", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2408.17052", "content": "Specifically, blendfake and deepfake can be explicitly delineated as the oriented pivot anchors between \"real-to-fake\" transitions . The accumulation of forgery information should be oriented and progressively increasing during this transition process."}
+{"idx": 1, "title": "(PDF) Can We Leave Deepfake Data Behind in Training Deepfake ...", "date": "", "ddg_snippet": "deepfake detector without using any deepfake data seems counter-intuitive. Table 3: Ablations on leveraging oriented anchors progressively ( AUC ). All variants are trained on. FF++ (in-dataset) and evaluated on other datasets (cross-dataset).", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/383648453_Can_We_Leave_Deepfake_Data_Behind_in_Training_Deepfake_Detector", "content": "deepfake detector without using any deepfake data seems counter-intuitive. Table 3: Ablations on leveraging oriented anchors progressively ( AUC ). All variants are trained on. FF++ (in-dataset) and evaluated on other datasets (cross-dataset)."}
+{"idx": 2, "title": "Can We Leave Deepfake Data Behind in Training", "date": "", "ddg_snippet": "Table 2 : Ablations for each network component ( AUC ↑ and EER↓). All variants are trained on FF++ (in-dataset) and evaluated on other datasets (cross-dataset). BF-only represents using only blendfake data as the negative samples.", "subpage_snippet": "", "source": "openreview.net", "link": "https://openreview.net/pdf?id=vh9yEPLeyD", "content": "Table 2 : Ablations for each network component ( AUC ↑ and EER↓). All variants are trained on FF++ (in-dataset) and evaluated on other datasets (cross-dataset). BF-only represents using only blendfake data as the negative samples."}
+{"idx": 3, "title": "Can We Leave Deepfake Data Behind in Training Deepfake ...", "date": "", "ddg_snippet": "This paper explores whether deepfake detection models can be trained without using deepfake data , which can be costly and difficult to obtain. The researchers experiment with different training approaches and evaluate the performance of the resulting deepfake detectors .", "subpage_snippet": "", "source": "www.aimodels.fyi", "link": "https://www.aimodels.fyi/papers/arxiv/can-we-leave-deepfake-data-behind-training", "content": "This paper explores whether deepfake detection models can be trained without using deepfake data , which can be costly and difficult to obtain. The researchers experiment with different training approaches and evaluate the performance of the resulting deepfake detectors ."}
+{"idx": 4, "title": "Can We Leave Deepfake Data Behind in Training Deepfake ...", "date": "", "ddg_snippet": "Therefore, a critical question arises: Can we leave deepfake behind and rely solely on blendfake data to train an effective deepfake detector ?", "subpage_snippet": "", "source": "papers.nips.cc", "link": "https://papers.nips.cc/paper_files/paper/2024/hash/2718a032d15e0b80cd164b240220df89-Abstract-Conference.html", "content": "Therefore, a critical question arises: Can we leave deepfake behind and rely solely on blendfake data to train an effective deepfake detector ?"}
+{"idx": 5, "title": "Can We Leave Deepfake Data Behind in Training Deepfake ...", "date": "", "ddg_snippet": "...which combines deepfake and blendfake data , results in inferior performance to methods using only blendfake data (so-called \"1+1< 2 \"). Therefore, a critical question arises: Can we leave deepfake behind and rely solely on blendfake data to train an effective deepfake detector ?", "subpage_snippet": "", "source": "papers.cool", "link": "https://papers.cool/venue/vh9yEPLeyD@OpenReview", "content": "...which combines deepfake and blendfake data , results in inferior performance to methods using only blendfake data (so-called \"1+1< 2 \"). Therefore, a critical question arises: Can we leave deepfake behind and rely solely on blendfake data to train an effective deepfake detector ?"}
+{"idx": 6, "title": "FreqDebias: Towards Generalizable Deepfake Detection via...", "date": "", "ddg_snippet": "Can we leave deepfake data . behind in training deepfake detector ? In Advances in Neural. Information Processing Systems, 2024. data -level debiasing for deepfake detection . arXiv preprint.", "subpage_snippet": "", "source": "openaccess.thecvf.com", "link": "https://openaccess.thecvf.com/content/CVPR2025/papers/Kashiani_FreqDebias_Towards_Generalizable_Deepfake_Detection_via_Consistency-Driven_Frequency_Debiasing_CVPR_2025_paper.pdf", "content": "Can we leave deepfake data . behind in training deepfake detector ? In Advances in Neural. Information Processing Systems, 2024. data -level debiasing for deepfake detection . arXiv preprint."}
+{"idx": 7, "title": "SCLBD/DeepfakeBench: A comprehensive benchmark of deepfake ...", "date": "", "ddg_snippet": "In the above table , \" Avg .\" donates the average AUC for within-domain and cross-domain evaluation, and the overall results. \"Top3\" represents the count of each method ranks within the top-3 across all testing datasets. The best-performing method for each column is highlighted.", "subpage_snippet": "", "source": "github.com", "link": "https://github.com/SCLBD/DeepfakeBench", "content": "In the above table , \" Avg .\" donates the average AUC for within-domain and cross-domain evaluation, and the overall results. \"Top3\" represents the count of each method ranks within the top-3 across all testing datasets. The best-performing method for each column is highlighted."}
+{"idx": 8, "title": "Can We Leave Deepfake Data Behind in Training Deepfake ...", "date": "", "ddg_snippet": "This table presents the Area Under the Curve ( AUC ) scores for various deepfake detection methods evaluated on multiple datasets.", "subpage_snippet": "", "source": "deep-diver.github.io", "link": "https://deep-diver.github.io/neurips2024/posters/vh9yepleyd/", "content": "This table presents the Area Under the Curve ( AUC ) scores for various deepfake detection methods evaluated on multiple datasets."}
+{"idx": 9, "title": "Deepfake Face Detection and Adversarial Attack Defense Method...", "date": "", "ddg_snippet": "Table 4: The detection AUC results were obtained from training experiments with the gram l 2 loss function and the emd loss function in efficientnet. Table 8: AUC and ACC metrics of deepfake face detection with and without adversarial training on four different datasets.", "subpage_snippet": "", "source": "www.thefreelibrary.com", "link": "https://www.thefreelibrary.com/Deepfake+Face+Detection+and+Adversarial+Attack+Defense+Method+Based...-a0845571235", "content": "Table 4: The detection AUC results were obtained from training experiments with the gram l 2 loss function and the emd loss function in efficientnet. Table 8: AUC and ACC metrics of deepfake face detection with and without adversarial training on four different datasets."}

data/sampled_jsons/Capturing_dynamics_of_time-varying_data_via_topology_Crocker.jsonl

@@ -0,0 +1,10 @@
+{"idx": 0, "title": "[2010.05780] Capturing Dynamics of Time-Varying Data via", "date": "", "ddg_snippet": "View a PDF of the paper titled Capturing Dynamics of Time - Varying Data via Topology , by Lu Xian and 3 other authors", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/abs/2010.05780", "content": "View a PDF of the paper titled Capturing Dynamics of Time - Varying Data via Topology , by Lu Xian and 3 other authors"}
+{"idx": 1, "title": "US20050050098A1 - System and method for aligning data frames in", "date": "", "ddg_snippet": "This invention relates to a method for capturing data from a system of multiple computer networks in order to analyze the networks for performance.", "subpage_snippet": "", "source": "patents.google.com", "link": "https://patents.google.com/patent/US20050050098A1/en", "content": "This invention relates to a method for capturing data from a system of multiple computer networks in order to analyze the networks for performance."}
+{"idx": 2, "title": "Temporal network analysis using zigzag persistence | EPJ Data", "date": "", "ddg_snippet": "... to a system modeled as a network with edges whose weights are functions of time , or they may represent a time series of a complex dynamical system.", "subpage_snippet": "", "source": "epjdatascience.springeropen.com", "link": "https://epjdatascience.springeropen.com/articles/10.1140/epjds/s13688-023-00379-5", "content": "... to a system modeled as a network with edges whose weights are functions of time , or they may represent a time series of a complex dynamical system."}
+{"idx": 3, "title": "Gene activity fully predicts transcriptional bursting dynamics", "date": "", "ddg_snippet": "Eukaryotic transcriptional regulation is an inherently dynamic and stochastic process, orchestrated by a series of molecular events governing ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2304.08770v3", "content": "Eukaryotic transcriptional regulation is an inherently dynamic and stochastic process, orchestrated by a series of molecular events governing ..."}
+{"idx": 4, "title": "Persistent Topological Features in Large Language Models", "date": "", "ddg_snippet": "... prominent tool within TDA is persistent homology, which tracks the birth and death of topological features across different scales, thereby capturing ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2410.11042v3", "content": "... prominent tool within TDA is persistent homology, which tracks the birth and death of topological features across different scales, thereby capturing ..."}
+{"idx": 5, "title": "Research - Lori Ziegelmeier", "date": "", "ddg_snippet": "... tools from computational geometry and topology to a wide variety of data sets ... Capturing Dynamics of Time - Varying Data via Topology ( Preprint )", "subpage_snippet": "", "source": "www.loriziegelmeier.com", "link": "https://www.loriziegelmeier.com/research.html", "content": "... tools from computational geometry and topology to a wide variety of data sets ... Capturing Dynamics of Time - Varying Data via Topology ( Preprint )"}
+{"idx": 6, "title": "US10033700B2 - Dynamic evaluation of access rights - Google", "date": "", "ddg_snippet": "2007-02-12 Assigned to GUARDIAN DATA STORAGE, LLC reassignment GUARDIAN DATA STORAGE, LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS).", "subpage_snippet": "", "source": "patents.google.com", "link": "https://patents.google.com/patent/US10033700B2/en", "content": "2007-02-12 Assigned to GUARDIAN DATA STORAGE, LLC reassignment GUARDIAN DATA STORAGE, LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS)."}
+{"idx": 7, "title": "Henry Adams", "date": "", "ddg_snippet": "Over 2019-2022 I was a member of the Descriptors of Energy Landscapes Using Topological Data Analysis (DELTA) leadership team.", "subpage_snippet": "", "source": "www.math.colostate.edu", "link": "https://www.math.colostate.edu/~adams/research/", "content": "Over 2019-2022 I was a member of the Descriptors of Energy Landscapes Using Topological Data Analysis (DELTA) leadership team."}
+{"idx": 8, "title": "Persistent homology: An introduction and a new text", "date": "", "ddg_snippet": "... these limitations, some researchers advocate for the adoption of Topological Data Analysis (TDA), a statistical approach that discerningly captures ...", "subpage_snippet": "", "source": "www.researchgate.net", "link": "https://www.researchgate.net/publication/262311097_Persistent_homology_An_introduction_and_a_new_text_representation_for_natural_language_processing", "content": "... these limitations, some researchers advocate for the adoption of Topological Data Analysis (TDA), a statistical approach that discerningly captures ..."}
+{"idx": 9, "title": "Quantifying topological features and irregularities in", "date": "", "ddg_snippet": "... often exhibit remarkable robustness, variation and irregularity exist at multiple scales and can carry important information about the underlying ...", "subpage_snippet": "", "source": "arxiv.org", "link": "https://arxiv.org/html/2509.11023v1", "content": "... often exhibit remarkable robustness, variation and irregularity exist at multiple scales and can carry important information about the underlying ..."}