Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

63126189252 · Jun 202019922001200920172026
48 results for statistical summarization

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.

In this paper we introduce a micro-clustering strategy for Functional Boxplots. The aim is to summarize a set of streaming time series splitted in non overlapping windows. It is a two step strategy which performs at first, an on-line summarization by means of functional data structures, named Functional Boxplot micro-c…

2012-12-12abs ↗pdf ↗

Balancing graph summarization and change detection in streaming data.

problem Balancing compression rate in graph summarization and accuracy in change detection.
method Introducing a probabilistic hierarchical latent variable model and optimizing parameters based on the minimum description length principle to balance the trade-off.
result Guaranteed suppression of Type I error probability (false alarms) in change detection.

This study tackles Gaussian process regression with summarized data.

problem Learning and inference with summarized data (summary statistics, counts) in spatial modeling.
method Sample quasi-likelihood approach to Gaussian process regression.
result Approximation performance of the method is influenced by data granularity and covariance function length scale.

Persistence diagrams are two-dimensional plots that summarize the topological features of functions and are an important part of topological data analysis. A problem that has received much attention is how deal with sets of persistence diagrams. How do we summarize them, average them or cluster them? One approach -- th…

2015-10-08abs ↗pdf ↗

Steady progress has been made in abstractive summarization with attention-based sequence-to-sequence learning models. In this paper, we propose a new decoder where the output summary is generated by conditioning on both the input text and the latent topics of the document. The latent topics, identified by a topic model…

2019-08-19abs ↗pdf ↗

This paper presents a review of deep learning (DL) based medical image registration methods. We summarized the latest developments and applications of DL-based registration methods in the medical field. These methods were classified into seven categories according to their methods, functions and popularity. A detailed …

2019-12-27abs ↗pdf ↗

Fitting models for non-Poisson point processes is complicated by the lack of tractable models for much of the data. By using large samples of independent and identically distributed realizations and statistical learning, it is possible to identify absence of fit through finding a classification rule that can efficientl…

2007-12-02abs ↗pdf ↗

In this work, we study abstractive text summarization by exploring different models such as LSTM-encoder-decoder with attention, pointer-generator networks, coverage mechanisms, and transformers. Upon extensive and careful hyperparameter tuning we compare the proposed architectures against each other for the abstractiv…

2019-03-24abs ↗pdf ↗

Patient summarization is essential for clinicians to provide coordinated care and practice effective communication. Automated summarization has the potential to save time, standardize notes, aid clinical decision making, and reduce medical errors. Here we provide an upper bound on extractive summarization of discharge …

2018-10-26abs ↗pdf ↗

The incredible variety of galaxy shapes cannot be summarized by human defined discrete classes of shapes without causing a possibly large loss of information. Dictionary learning and sparse coding allow us to reduce the high dimensional space of shapes into a manageable low dimensional continuous vector space. Statisti…

2014-06-29abs ↗pdf ↗

Infinite mixture models are commonly used for clustering. One can sample from the posterior of mixture assignments by Monte Carlo methods or find its maximum a posteriori solution by optimization. However, in some problems the posterior is diffuse and it is hard to interpret the sampled partitionings. In this paper, we…

2013-10-01abs ↗pdf ↗

New method for summarizing ranking distributions using consensus ranking distributions.

problem Summarizing ranking distributions efficiently and accurately.
method Introducing consensus ranking distributions and a top-down tree-structured statistical algorithm.
result Optimal distortion can be expressed as a function of pairwise probabilities, enabling efficient learning methods.

Faced with massive data, is it possible to trade off (statistical) risk, and (computational) space and time? This challenge lies at the heart of large-scale machine learning. Using k-means clustering as a prototypical unsupervised learning problem, we show how we can strategically summarize the data (control space) in …

2016-05-02abs ↗pdf ↗

The paper examines statistical properties of IL and LVR in automated market makers.

problem Assessing the performance of automated market makers and their profitability.
method Analysis of random walk properties and statistical integral combined with CFMM mechanics.
result IL and LVR have identical expectation values but different distribution functions for Brownian motion.

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.

Automatic summarization of natural language is a current topic in computer science research and industry, studied for decades because of its usefulness across multiple domains. For example, summarization is necessary to create reviews such as this one. Research and applications have achieved some success in extractive …

2018-12-18abs ↗pdf ↗

Method summarizes and predicts time series data for COVID-19 cases and deaths.

problem Summarizing and predicting time series data for multiple related time series.
method Hierarchical algorithm generating shapelets for centroids, nearest neighbor search for labeling, dynamic time warping for non-uniform lengths.
result Predictive model for individual time series based on aggregated statistics.

New methods reveal consensus and dissensus in network partitions.

problem Degenerate community detection methods often yield multiple competing answers.
method Comprehensive set of methods to characterize and summarize complex populations of partitions.
result It is not possible to obtain a consistent answer from point estimates when the distribution is heterogeneous.

Study improves summarization reliability in risky scenarios.

problem Reliability of automatic summarization in high-risk contexts.
method Conditional generation with Bayesian inference and entropy regularization.
result Significant improvement in robustness and reliability of summarization.

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.

Paper compares neural networks and classical statistics for dementia prediction, highlighting interpretability of classical methods.

problem Tackles the challenge of interpreting risk factors for dementia prediction.
method Compares neural networks and classical statistics for dementia prediction.
result Classical statistics provide clearer interpretation of risk factors compared to neural networks.

In the last two decades, automatic extractive text summarization on lectures has demonstrated to be a useful tool for collecting key phrases and sentences that best represent the content. However, many current approaches utilize dated approaches, producing sub-par outputs or requiring several hours of manual tuning to …

2019-06-07abs ↗pdf ↗

New statistical inference method for high-dimensional Hawkes processes.

problem Uncertainty evaluation of network estimates in high-dimensional point process data.
method Develops a new statistical inference procedure using concentration inequalities and martingale central limit theory.
result Characterizes the convergence rate of test statistics for high-dimensional Hawkes processes.

Bayesian method improves star location and flux estimation from coadded images.

problem Statistical analysis of coadded astronomical images is complicated by pixel dependence.
method Bayesian approach that implicitly marginalizes single-exposure pixel intensities.
result Method outperforms single-exposure image training for star parameter estimation.

We review the main "omnibus procedures" for goodness-of-fit testing for copulas: tests based on the empirical copula process, on probability integral transformations, on Kendall's dependence function, etc, and some corresponding reductions of dimension techniques. The problems of finding asymptotic distribution-free te…

2012-11-19abs ↗pdf ↗

In the past few years, neural abstractive text summarization with sequence-to-sequence (seq2seq) models have gained a lot of popularity. Many interesting techniques have been proposed to improve seq2seq models, making them capable of handling different challenges, such as saliency, fluency and human readability, and ge…

2018-12-05abs ↗pdf ↗

We consider the problem of aggregating models learned from sequestered, possibly heterogeneous datasets. Exploiting tools from Bayesian nonparametrics, we develop a general meta-modeling framework that learns shared global latent structures by identifying correspondences among local model parameterizations. Our propose…

2019-11-01abs ↗pdf ↗

AI agents are being developed to support high stakes decision-making processes from driving cars to prescribing drugs, making it increasingly important for human users to understand their behavior. Policy summarization methods aim to convey strengths and weaknesses of such agents by demonstrating their behavior in a su…

2019-05-30abs ↗pdf ↗

This paper connects Wasserstein distances to MMD norms for compressive statistical learning.

problem Comparing and controlling Wasserstein distances between probability distributions.
method Establishing conditions under which Wasserstein distances can be controlled by MMD norms.
result Introducing Wasserstein regularity for compressive statistical learning.

Paper introduces methods to automatically generate SOAP notes from patient-physician conversations.

problem Burden of creating digital SOAP notes by physicians.
method Cluster2Sent algorithm for summarizing patient-physician conversations.
result Cluster2Sent algorithm outperforms existing methods by 8 ROUGE-1 points.

A cluster tree provides a highly-interpretable summary of a density function by representing the hierarchy of its high-density clusters. It is estimated using the empirical tree, which is the cluster tree constructed from a density estimator. This paper addresses the basic question of quantifying our uncertainty by ass…

2016-05-20abs ↗pdf ↗

Summarization of long sequences into a concise statement is a core problem in natural language processing, requiring non-trivial understanding of the input. Based on the promising results of graph neural networks on highly structured data, we develop a framework to extend existing sequence encoders with a graph compone…

2018-11-05abs ↗pdf ↗

The sheer scale of modern datasets has resulted in a dire need for summarization techniques that identify representative elements in a dataset. Fortunately, the vast majority of data summarization tasks satisfy an intuitive diminishing returns condition known as submodularity, which allows us to find nearly-optimal sol…

2018-06-07abs ↗pdf ↗