DCR-Consistency: Divide-Conquer-Reasoning for Consistency Evaluation and Improvement of Large Language Models
-
Updated
May 23, 2024 - Python
DCR-Consistency: Divide-Conquer-Reasoning for Consistency Evaluation and Improvement of Large Language Models
This is the implementation of 1st Part in 3-Part Series of Algorithms Illuminated Book. All Implementations in this repository are written in both Python and Golang. Single IPython Notebook contains all Algorithms given in this Part 1.
This source code (in Python) is a preliminary implementation of my quadratic-time positive integer matrix multiplication.
BERT-based extractive summarizer for long legal document using a divide-and-conquer approach
A Mathematica package by the name 'Polynomial adaptive cellular automata' to get the quasi-normal modes for the particles oscillating in the background of a black hole.
Multiplication and exponentiation using Karatsuba Method
The goal was to maintain a ‘single version of truth’ for associated entities across the entire organization’s data sources. The RecordLinkage package is integrated with a wrapper recursive data-pipeline for de-duplicating of records and generating a master set. Similarity between two textual strings determines if they are a probabilistic match.
Algorithms / Problem solving
Add a description, image, and links to the divide-and-conquer-approach topic page so that developers can more easily learn about it.
To associate your repository with the divide-and-conquer-approach topic, visit your repo's landing page and select "manage topics."