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.
This paper reviews Bayesian methods for sparsity-aware modeling.
We propose two sparsity-aware normalized subband adaptive filter (NSAF) algorithms by using the gradient descent method to minimize a combination of the original NSAF cost function and the l1-norm penalty function on the filter coefficients. This l1-norm penalty exploits the sparsity of a system in the coefficients upd…
Space-time adaptive processing (STAP) algorithms with coprime arrays can provide good clutter suppression potential with low cost in airborne radar systems as compared with their uniform linear arrays counterparts. However, the performance of these algorithms is limited by the training samples support in practical appl…
Efficient method certifies robustness of discrete data models, especially graphs.
Latent Dirichlet Allocation (LDA) is a popular tool for analyzing discrete count data such as text and images. Applications require LDA to handle both large datasets and a large number of topics. Though distributed CPU systems have been used, GPU-based systems have emerged as a promising alternative because of the high…
Signal processing tasks as fundamental as sampling, reconstruction, minimum mean-square error interpolation and prediction can be viewed under the prism of reproducing kernel Hilbert spaces. Endowing this vantage point with contemporary advances in sparsity-aware modeling and processing, promotes the nonparametric basi…
In recent years, deep neural networks have yielded state-of-the-art performance on several tasks. Although some recent works have focused on combining deep learning with recommendation, we highlight three issues of existing models. First, these models cannot work on both explicit and implicit feedback, since the networ…
In-network distributed estimation of sparse parameter vectors via diffusion LMS strategies has been studied and investigated in recent years. In all the existing works, some convex regularization approach has been used at each node of the network in order to achieve an overall network performance superior to that of th…
This work presents a two-stage neural architecture for learning and refining structural correspondences between graphs. First, we use localized node embeddings computed by a graph neural network to obtain an initial ranking of soft correspondences between nodes. Secondly, we employ synchronous message passing networks …
This technical note considers the problems of blind sparse learning and inference of electrogram (EGM) signals under atrial fibrillation (AF) conditions. First of all we introduce a mathematical model for the observed signals that takes into account the multiple foci typically appearing inside the heart during AF. Then…
SpeqNets improve graph neural networks by scaling and adapting to graph sparsity.
New attacks and defenses for GNNs on large graphs.
In this paper, we address the problem of reconstructing coverage maps from path-loss measurements in cellular networks. We propose and evaluate two kernel-based adaptive online algorithms as an alternative to typical offline methods. The proposed algorithms are application-tailored extensions of powerful iterative meth…
Developing efficient and scalable algorithms for Latent Dirichlet Allocation (LDA) is of wide interest for many applications. Previous work has developed an O(1) Metropolis-Hastings sampling method for each token. However, the performance is far from being optimal due to random accesses to the parameter matrices and fr…
AdaCGP learns dynamic graph topology from time series data, improving over existing methods.
Sparse feature selection improves batch RL efficiency.
Improved tensor rank learning for CPD models using a generalized hyperbolic prior.
The paper introduces BCART models for aggregate claim amount, improving frequency-severity and joint modeling.
The paper uses model-based trees to create interpretable surrogate models for complex machine learning models.
Gauge Flow Models use a learnable Gauge Field in Generative Flow Models.
The study examines how model predictions hold up under model extensions.
Revises Bayesian model averaging for foundation models.
Paper introduces symmetric divergence link models for probability distributions.
New method to handle credit portfolio model uncertainties.
The paper tests stock return models and uses LSTM to predict stock returns.
Researchers review challenges in interpreting additive models, especially neural additive models.
Novel hybrid modeling combines ML and physics for real-time diagnosis.
CRS model improves ranking data modeling with theoretical guarantees.
Sigma models linked to Gross-Neveu models via quiver varieties.
Interpretable machine learning has become a strong competitor for traditional black-box models. However, the possible loss of the predictive performance for gaining interpretability is often inevitable, putting practitioners in a dilemma of choosing between high accuracy (black-box models) and interpretability (interpr…
Simple models are preferred over complex models, but over-simplistic models could lead to erroneous interpretations. The classical approach is to start with a simple model, whose shortcomings are assessed in residual-based model diagnostics. Eventually, one increases the complexity of this initial overly simple model a…
Matryoshka hides secret models in a carrier model, achieving high capacity and robustness.
Seq2Seq models speed up epidemic model predictions.
This work develops scalable model selection methods with fast update and selection.
Paper proposes BMPO to optimize policies using bidirectional models.
Copulas outperform marginal models in multivariate risk forecasting, reducing model risk by narrowing down the set of models.
BayesBlend blends multiple models' predictions for better insurance loss predictions.
The paper identifies when larger models improve predictions and proposes a switcher model.
Improved diffusion model generation speed with speculative sampling.
We propose a generalization of neural network sequence models. Instead of predicting one symbol at a time, our multi-scale model makes predictions over multiple, potentially overlapping multi-symbol tokens. A variation of the byte-pair encoding (BPE) compression algorithm is used to learn the dictionary of tokens that …
The paper extends statistical inference methods for black-box generative models.
PMM uses Bayesian inference to generate data from noisy approximations.
Unified model improves sampling speed and quality.
In science and especially in economics, agent-based modeling has become a widely used modeling approach. These models are often formulated as a large system of difference equations. In this study, we discuss two aspects, numerical modeling and the probabilistic description for two agent-based computational economic mar…
Driven by an increasing need for model interpretability, interpretable models have become strong competitors for black-box models in many real applications. In this paper, we propose a novel type of model where interpretable models compete and collaborate with black-box models. We present the Model-Agnostic Linear Comp…
Combining models in appropriate ways to achieve high performance is commonly seen in machine learning fields today. Although a large amount of combinatorial models have been created, little attention is drawn to the commons in different models and their connections. A general modelling technique is thus worth studying …
MaxEnt Model Correction improves reinforcement learning model accuracy.
Macroscopic price evolution models are commonly used for investment strategies. There are first promising achievements in defining microscopic agent based models for the same purpose. Microscopic models allow a deeper understanding of mechanisms in the market than the purely phenomenological macroscopic models, and thu…