Search Results for author:
Found 4 papers, 0 papers with code
Benchmarking LLMs on the Semantic Overlap Summarization Task
While recent advancements in Large Language Models (LLMs) have achieved superior performance in numerous summarization tasks, a benchmarking study of the SOS task using LLMs is yet to be performed.
MetaMorphosis: Task-oriented Privacy Cognizant Feature Generation for Multi-task Learning
To achieve this, we propose a channel squeeze-excitation based feature metamorphosis module, Cross-SEC, to achieve distinct attention of all tasks and a de-correlation loss function with differential-privacy to train a deep learning model that produces distinct privacy-aware features as an output for the respective tasks.
Proof complexity of positive branching programs
Our proof method is inspired by a similar result for MLK by Atserias, Galesi and Pudl\'ak, that was recently improved to a bona fide polynomial simulation via works of Je\v{r}\'abek and Buss, Kabanets, Kolokolova and Kouck\'y.
Computational Complexity Logic in Computer Science Logic
A circular version of Gödel's T and its abstraction complexity
Circular and non-wellfounded proofs have become an increasingly popular tool for metalogical treatments of systems with forms of induction and/or recursion.
Logic in Computer Science Logic
