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.
Constructing VAE Latent Spaces with Prescribed Topology
Ensemble decoders to capture latent space topology in deep generative models.
New algorithm reduces performance loss in IRL with mismatched transition dynamics.
This paper considers the classification of linear subspaces with mismatched classifiers. In particular, we assume a model where one observes signals in the presence of isotropic Gaussian noise and the distribution of the signals conditioned on a given class is Gaussian with a zero mean and a low-rank covariance matrix.…
The paper addresses score-mismatched diffusion models and zero-shot conditional samplers.
Paper identifies objective mismatch in MBRL, affecting control task performance.
BinaryDuo improves BNNs by coupling binary activations, outperforming state-of-the-art models.
Thompson Sampling shows polynomial regret for combinatorial semi-bandits with subgaussian rewards.
New method addresses error bounds for PnP-ULA under mismatched models.
Paper addresses linear regression with partially mismatched data using local search with theoretical guarantees.
PACMAN provides bounds for classification tasks considering accuracy vs. negative log-loss mismatch.
Study on LMMSE estimation with model mismatch, quantifying MSE trade-offs.
Current approaches for Knowledge Distillation (KD) either directly use training data or sample from the training data distribution. In this paper, we demonstrate effectiveness of 'mismatched' unlabeled stimulus to perform KD for image classification networks. For illustration, we consider scenarios where this is a comp…
We make a new attempt at the recently suggested program to express knot polynomials through topological vertices, which can be considered as a possible approach to the tangle calculus: we discuss the Macdonald deformation of the relation between the convolution of two topological vertices and the HOMFLY-PT invariant of…
Supervised learning based on a deep neural network recently has achieved substantial improvement on speech enhancement. Denoising networks learn mapping from noisy speech to clean one directly, or to a spectrum mask which is the ratio between clean and noisy spectra. In either case, the network is optimized by minimizi…
Recently, there has been significant interest in linear regression in the situation where predictors and responses are not observed in matching pairs corresponding to the same statistical unit as a consequence of separate data collection and uncertainty in data integration. Mismatched pairs can considerably impact the …
Piecewise normalizing flows improve multi-modal distribution modeling.
Ensemble models improve prediction calibration for mismatched distributions.
The dictionary-aided sparse regression (SR) approach has recently emerged as a promising alternative to hyperspectral unmixing (HU) in remote sensing. By using an available spectral library as a dictionary, the SR approach identifies the underlying materials in a given hyperspectral image by selecting a small subset of…
Empirical study compares finite- and infinite-width BNNs, revealing performance differences under model mismatch.
We characterize the performance of sequential information guided sensing, Info-Greedy Sensing, when there is a mismatch between the true signal model and the assumed model, which may be a sample estimate. In particular, we consider a setup where the signal is low-rank Gaussian and the measurements are taken in the dire…
The performance of automatic speech recognition (ASR) systems can be significantly compromised by previously unseen conditions, which is typically due to a mismatch between training and testing distributions. In this paper, we address robustness by studying domain invariant features, such that domain information become…
Many sleep studies suffer from the problem of insufficient data to fully utilize deep neural networks as different labs use different recordings set ups, leading to the need of training automated algorithms on rather small databases, whereas large annotated databases are around but cannot be directly included into thes…
Most of the existing studies on voice conversion (VC) are conducted in acoustically matched conditions between source and target signal. However, the robustness of VC methods in presence of mismatch remains unknown. In this paper, we report a comparative analysis of different VC techniques under mismatched conditions. …
New algorithm solves Schrödinger bridge problem with mismatched channels.
Modern society heavily relies on strongly connected, socio-technical systems. As a result, distinct risks threatening the operation of individual systems can no longer be treated in isolation. Consequently, risk experts are actively seeking for ways to relax the risk independence assumption that undermines typical risk…
SRRM improves recursive transport surrogates in the small-discrepancy regime.
Probabilistic models analyze data by relying on a set of assumptions. Data that exhibit deviations from these assumptions can undermine inference and prediction quality. Robust models offer protection against mismatch between a model's assumptions and reality. We propose a way to systematically detect and mitigate mism…
We study the estimation capacity of the generalized Lasso, i.e., least squares minimization combined with a (convex) structural constraint. While Lasso-type estimators were originally designed for noisy linear regression problems, it has recently turned out that they are in fact robust against various types of model un…
We study the problem of off-policy policy optimization in Markov decision processes, and develop a novel off-policy policy gradient method. Prior off-policy policy gradient approaches have generally ignored the mismatch between the distribution of states visited under the behavior policy used to collect data, and what …
Study addresses covariate mismatch in federated learning, improving model accuracy.
A new method improves data generation quality by correcting score mismatches.
A financial system contains many elements networked by their relationships. Extensive works show that topological structure of the network stores rich information on evolutionary behaviors of the system such as early warning signals of collapses and/or crises. Existing works focus mainly on the network structure within…
Improved BN for better performance in imbalanced data.
New tensor kernels reduce mismatch between clustering and reconstruction objectives in deep learning.
A new method for inventory control using in-context learning and generative models.
Our study employs sentiment analysis to evaluate the compatibility of Amazon.com reviews with their corresponding ratings. Sentiment analysis is the task of identifying and classifying the sentiment expressed in a piece of text as being positive or negative. On e-commerce websites such as Amazon.com, consumers can subm…
AIS corrects rollout-training mismatch in quantized RL, improving speed and stability.
New framework for RL transfer learning with state-action mismatch.
KalmanNet uses neural networks to improve state estimation in systems with unknown dynamics.
A new BN method corrects size mismatch in WLF for imbalanced data.
Subspace models play an important role in a wide range of signal processing tasks, and this paper explores how the pairwise geometry of subspaces influences the probability of misclassification. When the mismatch between the signal and the model is vanishingly small, the probability of misclassification is determined b…
MixMOOD improves SSDL by selecting unlabelled data based on deep feature similarity.
New method improves spatial prediction validation accuracy.
We study the question of how to imitate tasks across domains with discrepancies such as embodiment, viewpoint, and dynamics mismatch. Many prior works require paired, aligned demonstrations and an additional RL step that requires environment interactions. However, paired, aligned demonstrations are seldom obtainable an…
A tacit assumption in linear regression is that (response, predictor)-pairs correspond to identical observational units. A series of recent works have studied scenarios in which this assumption is violated under terms such as ``Unlabeled Sensing and ``Regression with Unknown Permutation''. In this paper, we study the s…
New techniques improve distributed training with compressed gradients.
We study the tracking problem, namely, estimating the hidden state of an object over time, from unreliable and noisy measurements. The standard framework for the tracking problem is the generative framework, which is the basis of solutions such as the Bayesian algorithm and its approximation, the particle filters. Howe…