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

99198297396 · Jun 202019922001200920172026
48 results for summary features

Automatically learns summary features from time series data for likelihood-free inference.

problem Necessity of hand-tailored summary features for time series data in likelihood-free inference.
method Data-driven approach to automatically learn summary features.
result Learning summary features from data can outperform hand-crafted values in likelihood-free inference.

Automatic text summarization tools have a great impact on many fields, such as medicine, law, and scientific research in general. As information overload increases, automatic summaries allow handling the growing volume of documents, usually by assigning weights to the extracted phrases based on their significance in th…

2019-06-26abs ↗pdf ↗

Proposes φφ-table for statistical SHAP explanations in regression models.

problem Lack of clear directional summaries, uncertainty, and fidelity in SHAP feature importance.
method SHAP importance selection, fitting a standardized linear surrogate, reporting coefficients, uncertainty, fidelity, and stability.
result Extends SHAP into a statistical global explanation with direction, uncertainty, fidelity, and stability.

Set-Sequence model learns cross-sectional dynamics directly from time series data.

problem Predicting large cross-sections of time series data with latent cross-sectional dynamics.
method A model that learns cross-sectional structure directly, enhancing expressivity and eliminating manual feature engineering.
result Significantly outperforms strong baselines in equity portfolio optimization and loan risk prediction.

FedLog reduces communication in federated learning by sharing data summaries.

problem Significant communication overhead in federated learning with large model parameters.
method Shares minimal sufficient statistics via Bayesian inference and differential privacy.
result High learning accuracy with low communication overhead.

The study analyzes transfer learning in infinite-width neural networks, improving generalization on target tasks.

problem Improving generalization in neural networks when using pretraining on a source task.
method Developed a theory under gradient flow for infinitely wide networks, analyzing fine-tuning and joint pretraining.
result Summary statistics of randomly initialized networks after pretraining are adaptive kernels that depend on both source and target data.

We propose a modification that corrects for split-improvement variable importance measures in Random Forests and other tree-based methods. These methods have been shown to be biased towards increasing the importance of features with more potential splits. We show that by appropriately incorporating split-improvement as…

2019-03-12abs ↗pdf ↗

Study analyzes seasonal hydroclimatic features across climates and continents.

problem Lack of seasonal hydroclimatic feature analysis for Koppen-Geiger climates and continents.
method Global-scale analysis of 13,000 time series using 7 features.
result Notable differences in feature magnitudes across Koppen-Geiger climate classes and continental regions.

New method for analyzing compositional data, addressing biases in summary statistics.

problem Inadequate effect measures for compositional data, especially in high-dimensionality and sparsity.
method Perturbation-based effect measures, average perturbation effects.
result Proposed estimators efficiently estimate average perturbation effects, outperforming existing techniques.

New mechanism for pure differential privacy on functional summaries using Laplace-like process.

problem Challenges in achieving differential privacy for complex, structured functional summaries.
method Independent Component Laplace Process (ICLP) mechanism for infinite-dimensional Hilbert space.
result Effective enhancement of utility of private summaries through oversmoothing.

A new method compares persistent cycles in topological data.

problem Comparing persistent homology representations of two spaces.
method Direct comparison of individual persistent cycles based on persistence intervals and spatial placement.
result Demonstrated the effectiveness of the method in topological inference.

When learning a hidden Markov model (HMM), sequen- tial observations can often be complemented by real-valued summary response variables generated from the path of hid- den states. Such settings arise in numerous domains, includ- ing many applications in biology, like motif discovery and genome annotation. In this pape…

2015-12-16abs ↗pdf ↗

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 ↗

Unified approach for selecting summary statistics in ABC.

problem Efficient inference from large datasets in likelihood-free methods.
method Characterizing and unifying three classes of summary statistics, minimizing expected posterior entropy.
result EPE-minimizing summaries lead to competitive posterior inference.

The physics of classical particles in a Lorentz-breaking spacetime has numerous features resembling the properties of Finsler geometry. In particular, the Lagrange function plays a role similar to that of a Finsler structure function. A summary is presented of recent results, including new calculable Finsler structures…

2013-08-15abs ↗pdf ↗

New TSER algorithms outperform existing methods in time series extrinsic regression.

problem Improving time series extrinsic regression models.
method Extended TSER archive, introduced two new algorithms (FreshPRINCE and DrCIF), compared with rotation forest.
result DrCIF and FreshPRINCE models significantly outperform existing methods.

We introduce a framework using Generative Adversarial Networks (GANs) for likelihood--free inference (LFI) and Approximate Bayesian Computation (ABC) where we replace the black-box simulator model with an approximator network and generate a rich set of summary features in a data driven fashion. On benchmark data sets, …

2017-11-29abs ↗pdf ↗

This paper introduces depth functions for ranking data, improving statistical summaries.

problem Lack of comprehensive statistical summaries for ranking data.
method Metric-based depth functions on symmetric group to define rankings, depths, and procedures.
result Novel depth functions provide a more informative summary of ranking data.

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.

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 ↗

Bayesian neural networks improve with summary information and Dirichlet process.

problem Lack of prior knowledge in BNNs for complex architectures.
method Incorporates external summary information about predicted probabilities using a Dirichlet process.
result Improves model accuracy, uncertainty calibration, and robustness.

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.

Improved likelihood-free inference by localizing and refining low-dimensional approximations.

problem Poor performance of common likelihood-free methods in high-dimensional models.
method Localisation followed by refinement of low-dimensional summaries.
result Improved accuracy in marginal posteriors through localized and refined approximations.

New summary measures reveal geometric structure in weighted measures on manifolds.

problem Lack of geometric information in standard weight-only summaries.
method Heat-kernel entropy profiles, tracking nonuniformity across scales.
result Geometric effective sample size discounts nearby or duplicate particles.

Detecting PE malware files is now commonly approached using statistical and machine learning models. While these models commonly use features extracted from the structure of PE files, we propose that icons from these files can also help better predict malware. We propose an innovative machine learning approach to extra…

2017-12-10abs ↗pdf ↗

A new method improves likelihood-free Bayesian inference by transforming summary statistics and using efficient Variational Bayes.

problem Incorrectly assuming normally distributed summary statistics in likelihood-free Bayesian inference.
method Wasserstein Gaussianization transformation combined with robust BSL and efficient Variational Bayes.
result Highly efficient and reliable approximate Bayesian inference for likelihood-free problems.

Opinion summarization is the task of automatically creating summaries that reflect subjective information expressed in multiple documents, such as product reviews. While the majority of previous work has focused on the extractive setting, i.e., selecting fragments from input reviews to produce a summary, we let the mod…

2019-11-06abs ↗pdf ↗

Paper uses learned summary statistics for Bayesian inference with difficult likelihood functions.

problem Difficult to obtain exact likelihood function for observation data and simulation model.
method Simulation-based inference with learned summary statistics, using Cressie-Read discrepancy criterion.
result Effective inference performed over selected sample sets of observation data.

Flexible multi-task learning framework using summary statistics.

problem Data-sharing constraints in healthcare settings.
method Proposes a flexible multi-task learning framework utilizing summary statistics and adaptive parameter selection.
result Systematic non-asymptotic analysis and simulations demonstrate the method's performance.

Develops methods to learn centre groupings from summary statistics in multi-centre studies.

problem Violation of homogeneity of parameters across centres in multi-centre studies.
method Clusters-of-Centres (CoC) algorithm that merges centres based on multivariate Cochran-type tests.
result Golden-partition recovery as the number of rounds grows with sample size.

TopoFisher learns topological summaries by maximizing Fisher information, improving parameter efficiency and inference quality.

problem Simulation-based inference misses key information in low-order statistics, especially for non-Gaussian fields.
method TopoFisher uses a differentiable persistent-homology pipeline that learns topological summaries by maximizing local Gaussian Fisher information.
result TopoFisher recovers much of the available information and outperforms fixed topological vectorizations in weak gravitational lensing.

Interpreting predictions from tree ensemble methods such as gradient boosting machines and random forests is important, yet feature attribution for trees is often heuristic and not individualized for each prediction. Here we show that popular feature attribution methods are inconsistent, meaning they can lower a featur…

2018-02-12abs ↗pdf ↗

The paper proposes using Autoencoders to learn summary statistics for Bayesian inference.

problem Approximating posterior distributions for models with intractable likelihood functions.
method Using Autoencoders to extract summary statistics that retain parameter information and cancel noise.
result The approach effectively learns summary statistics that improve posterior approximation.

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.

Estimates non-parametric logistic model using case-control data and external summary info.

problem Imbalanced binary data in case-control studies.
method Two-step estimation procedure with deep neural network for functional approximation.
result Proposed estimator achieves optimal convergence rate in non-parametric regression.