Improved text summarization using belief propagation on weighted bipartite graphs.
problem Text summarization from a graph theory perspective.
method Generalized belief propagation algorithm for weighted bipartite graphs.
result Our algorithm outperforms greedy methods in text summarization tasks.
This study improves text summarization and fake news detection using neural models.
problem Improving text summarization and detecting fake news.
method Exploring and comparing different neural models for text summarization, including LSTM-encoder-decoder, pointer-generator networks, and transformers. Applying these models as a feature extractor for fake news detection.
result The proposed neural models enhance text summarization and improve fake news detection accuracy.
Survey of seq2seq models for neural text summarization.
problem Improving fluency and quality of text summaries.
method Comprehensive review of seq2seq models for abstractive text summarization.
result Benchmarking of two models on recent datasets.
Paper proposes a reinforcement learning framework for text summarization.
problem Transfer learning effectiveness in text summarization is not well explored.
method Reinforcement learning with a self-critic policy gradient approach.
result Achieves good generalization and state-of-the-art results on various datasets.
Develops a hybrid model for text summarization.
problem Summarizing long text sequences concisely.
method Extends sequence encoders with a graph component to handle long-distance relationships in text.
result Hybrid models outperform pure sequence or graph models on summarization tasks.
Proposes RDASS for better Korean text summarization evaluation.
problem ROUGE scores fail to capture semantic meaning in Korean text summarization.
method Introduces RDASS metrics and a method to improve their correlation with human judgment.
result RDASS metrics correlate better with human judgment than ROUGE scores.
BERT helps summarize lecture content efficiently.
problem Efficiently summarize lecture content for students.
method Used BERT for text embeddings and KMeans clustering.
result Improved text summarization for lecture content.
Automates summarizing federal grant audits with machine learning.
problem Manual analysis of large federal grant audits is time-consuming and error-prone.
method Sentence clustering, k-means, proximity to centroids, human input for refinement.
result Automated summaries are comparable to human-generated ones using ROUGE metric.
A new model improves text summarization by integrating topic information.
problem Improving the coherence, diversity, and informativeness of text summarization.
method Integrates topic information into ConvS2S model and uses SCST for optimization.
result The proposed model outperforms state-of-the-art methods in abstractive summarization.
Improved text summarization using neural semantic encoders with hierarchical structure.
problem Capturing long-term dependencies in text summarization.
method Proposed a novel hierarchical Neural Semantic Encoder (NSE) model augmented with lemma and PoS tags.
result Significantly outperformed state-of-the-art models in ROUGE metric.
SCROLLS benchmarks long text NLP tasks, improving existing models.
problem Short NLP benchmarks ignore long texts; SCROLLS addresses this.
method Handpicked long-text datasets for summarization, QA, and inference tasks.
result Improvement potential on SCROLLS tasks, as indicated by initial baselines.
This paper guides practical solutions for neural text generation issues.
problem Undesired behavior in neural text generation models.
method Tuning end-to-end neural network models with encoder and decoder components.
result Resolving issues like truncated, repetitive, bland, and ungrammatical outputs.
Unified framework improves NLP tasks by converting diverse problems into text-to-text format.
problem Improving natural language processing tasks through transfer learning.
method Unified text-to-text transformer framework, comparing various pre-training objectives and architectures.
result Achieved state-of-the-art results on multiple NLP benchmarks.
Text clustering method replaces centroids with summaries for interpretability and scalability.
problem Efficiently clustering text data while maintaining interpretability and scalability.
method k-NLPmeans and k-LLMmeans, which periodically replace numeric centroids with textual summaries.
result Consistently outperforms classical baselines and recent LLM-based clustering methods.
Paper addresses shortcomings in pointer generator networks for summarization.
problem Extractive summaries and factual inaccuracies in generated text.
method Appends traditional linguistic information to teach networks on text structure.
result Feasibility and potential of additional cues for improved generation.
Few summaries enable automatic summarization of product reviews.
problem Lack of large labeled datasets for training supervised models in opinion summarization.
method Conditional Transformer model trained to generate summaries given other reviews, fine-tuned to predict summary properties.
result Few summaries (5-10) are sufficient to generate fluent, informative, and sentiment-preserving summaries.
Attention models boost speaker verification accuracy.
problem Improving text-dependent speaker verification accuracy.
method Exploring attention mechanisms in sequence summarization for speaker recognition.
result Attention-based models improve EER by 14%.
Paper develops a statistical model for summarizing event sequences.
problem Discovering frequent serial episodes from sequential data.
method Minimum Description Length (MDL) principle with modifications.
result Reduces dictionary size by more than four-fold without losing accuracy.
A new model generates summaries by conditioning on input text and latent topics.
problem Improving abstractive summarization quality.
method Conditioning decoder output on both input text and latent topics identified by LDA.
result Strongly improved ROUGE scores on CNN/Daily Mail and WikiHow datasets.
A new method uses PSO to optimize sentence weights for user-oriented document summaries.
problem Handling information overload in documents through efficient summarization.
method Particle Swarm Optimization (PSO) to identify and weight sentence features.
result Improved accuracy in summarization compared to previous methods.
SuTaT creates dialogue summaries for tete-a-tetes without labeled data.
problem Lack of high-quality paired dialogue-summary data.
method Unsupervised model for tete-a-tetes, modeling customer and agent roles separately.
result SuTaT outperforms on automatic and human evaluations.
Improves document summarization by combining word embeddings and n-grams.
problem Exact word matching fails to measure semantic similarity between sentences.
method Uses deep embedding features and tf-idf features to improve sentence similarity measure; builds an improved sentence similarity graph; employs a submodular objective function; develops a Transformer-based compression model.
result Outperforms tf-idf based approach and achieves state-of-the-art performance on DUC04 dataset.
Attention mechanism improves various NLP tasks.
problem Improving performance in natural language processing tasks.
method Assigning importance scores to sequence elements for encoding.
result Significant improvement in various NLP tasks.
Convolutional autoencoding improves long text reconstruction.
problem Text reconstruction quality decreases with text length.
method Sequence-to-sequence, purely convolutional and deconvolutional autoencoding.
result Better at reconstructing and correcting long paragraphs.
Unsupervised summarization generates novel reviews reflecting consensus opinions.
problem Creating summaries that reflect subjective information in multiple documents.
method Generative model with hierarchical variational autoencoder, pointer-generator mechanism.
result Model produces fluent and coherent summaries reflecting common opinions.
Survey on RL for seq2seq models to solve exposure bias and inconsistency.
problem Exposure bias and inconsistency in seq2seq models.
method Combining RL methods with seq2seq models.
result Improved seq2seq performance through RL.
Neural model improves text segmentation accuracy.
problem Manual feature engineering and large memory requirements in text segmentation.
method Attention-based bidirectional LSTM model with CNN sentence embeddings and contextual prediction.
result Improves WinDiff score by ~7% on three benchmark datasets.
Model improves BERT for answering multiple-choice questions in large texts.
problem Improving machine comprehension of large text corpora for question answering.
method Developed a model using BERT with a semantic similarity attention layer to extract key sentences.
result Outperforms leading models in MovieQA challenge with 87.79% test accuracy.
Survey on reproducibility and distortion issues in text clustering and topic modeling.
problem Reproducibility and misleading cluster geometry in unsupervised learning for text categorization.
method Systematic literature review of text clustering and topic modeling from 2011-2022.
result Outliers and initialization issues are significant factors in text clustering and topic modeling.
Model creates human-like text descriptions for time series data.
problem Creating textual summaries for complex time series data that mimic human behavior.
method Utility estimation model based on Bayesian network to rank patterns in time series data.
result Output is a natural language description of time series that matches human summary.
Centroid Transformers reduce memory and computation by summarizing inputs into centroids.
problem Efficiently summarize inputs with reduced memory and computation.
method Generalizes self-attention to map N inputs to M centroids (M ≤ N), reducing complexity.
result Centroid Transformers reduce memory and computation while preserving key information.
MaskGAN improves text generation quality using GANs.
problem Text generation models often produce poor sample quality despite high perplexity.
method Proposes a conditional GAN that fills in missing text based on context.
result Produces more realistic text samples compared to maximum likelihood models.
New algorithm speeds up determinantal point process sampling.
problem Efficiently sampling from determinantal point processes with minimal preprocessing and sampling costs.
method Introducing a Poisson random variable to control subset probabilities, reducing the number of rows to poly(d) for sampling.
result The new algorithm achieves poly(d) sampling time, independent of n, without distorting probabilities.
The goal of this research was to find a way to extend the capabilities of computers through the processing of language in a more human way, and present applications which demonstrate the power of this method. This research presents a novel approach, Rhetorical Analysis, to solving problems in Natural Language Processin…
The paper fine-tunes language models using human preferences for natural language tasks.
problem Applying reinforcement learning to natural language tasks with human-defined rewards.
method Fine-tuning language models using reward learning techniques, leveraging generative pretraining.
result The approach achieves good results in natural language tasks like text continuation and summarization.
Combining various data types predicts S&P 500 stock prices with high accuracy.
problem Predicting S&P 500 stock prices with high accuracy.
method Combined technical, fundamental, and text data with machine learning models like Random Forest and LSTM.
result Achieved 66.18% accuracy in S&P 500 index prediction and 62.09% in individual stock prediction.
Models extract relevant EHR snippets to aid radiologists in diagnosis.
problem Difficulty in identifying relevant patient record information for diagnosis.
method Distantly supervised transformer-based neural model for extractive summarization.
result Models yield better extractive summaries than unsupervised approaches.
Self-training improves neural sequence generation by correcting incorrect predictions.
problem Improving neural sequence generation models using unlabeled data.
method Injecting pseudo-parallel data (model predictions) into the labeled dataset and using dropout as a regularizer.
result Noisy self-training significantly improves performance on machine translation and text summarization benchmarks.
BART pretrains sequence-to-sequence models by corrupting text and reconstructing it.
problem Improving natural language generation, translation, and comprehension.
method BART uses a denoising autoencoder trained on a Transformer architecture with various noising techniques.
result BART achieves state-of-the-art performance on various NLP tasks with minimal training resources.
MARGE learns to reconstruct text by paraphrasing, achieving strong performance across multiple tasks.
problem Training sequence-to-sequence models with limited supervision.
method Unsupervised multi-lingual multi-document paraphrasing objective.
result Strong zero-shot performance on document translation and various tasks in multiple languages.
We investigate ways in which to improve the interpretability of LDA topic models by better analyzing and visualizing their outputs. We focus on examining what we refer to as topic similarity networks: graphs in which nodes represent latent topics in text collections and links represent similarity among topics. We descr…
Mathematical framework for language models processes text and predicts next tokens.
problem Understanding and optimizing the performance of large language models.
method Describes encoding, prediction models, learning from data, and deployment of LLMs.
result Demonstrates remarkable empirical successes and provides a platform for further research.
This work tackles extractive compression by formulating it as tree transduction.
problem Extractive compression as a challenging natural language processing problem.
method Formulated as a parse tree transduction problem, using a deep neural model with Long Short-Term Memory extended to consider parent-child relationships.
result Achieves state-of-the-art performance on sentence compression benchmarks.
We propose a new class of determinantal point processes (DPPs) which can be manipulated for inference and parameter learning in potentially sublinear time in the number of items. This class, based on a specific low-rank factorization of the marginal kernel, is particularly suited to a subclass of continuous DPPs and DP…
Aggregates models from different datasets using shared latent structures.
problem Aggregating models from heterogeneous datasets with shared latent structures.
method Bayesian nonparametrics for identifying correspondences among local model parameterizations.
result Framework successfully aggregates various model types across different applications.
Model creates summaries of patient notes to save time and reduce errors.
problem Improper summarization of patient notes leads to inefficiencies and errors.
method Developed an LSTM model to sequentially label topics in history of present illness notes.
result Achieved an F1 score of 0.876, indicating the model's effectiveness.
Research improves federated text models for next word prediction.
problem Training models on distributed devices efficiently and effectively.
method Employ transfer learning in federated learning for next word prediction.
result Enhancements to current baselines with pretrained embeddings and whole model pretraining.
Transformers encode latent distributions in text, improving performance in out-of-distribution cases.
problem What should embeddings from language models represent?
method Connecting autoregressive prediction to sufficient statistics, identifying three settings.
result Transformers encode latent generating distributions, improving performance.