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.
Meta-learning improved by using information theory to prioritize data-driven adaptation.
Study risk-constrained Kelly optimization for mutually exclusive outcomes, proving support invariance and developing a structured algorithm.
In this paper we consider the problem of semi-supervised learning with deep Convolutional Neural Networks (ConvNets). Semi-supervised learning is motivated on the observation that unlabeled data is cheap and can be used to improve the accuracy of classifiers. In this paper we propose an unsupervised regularization term…
It is well known that a random vector with given marginal distributions is comonotonic if and only if it has the largest sum with respect to the convex order [ Kaas, Dhaene, Vyncke, Goovaerts, Denuit (2002), A simple geometric proof that comonotonic risks have the convex-largest sum, ASTIN Bulletin 32, 71-80. Cheung (2…
One of the problems on the way to successful implementation of neural networks is the quality of annotation. For instance, different annotators can annotate images in a different way and very often their decisions do not match exactly and in extreme cases are even mutually exclusive which results in noisy annotations a…
Various measures can be used to estimate bias or unfairness in a predictor. Previous work has already established that some of these measures are incompatible with each other. Here we show that, when groups differ in prevalence of the predicted event, several intuitive, reasonable measures of fairness (probability of p…
The girth of a finitely generated group G is the supremum of the girth of Cayley graphs for G over all finite generating sets. Let G be a finitely generated subgroup of the mapping class group Mod(S), where S is a compact orientable surface. Then, either G is virtually abelian or it has infinite girth; moreover, if we …
There is a sequence of positive numbers , such that for any connected -dimensional Riemannian manifold , there are two mutually exclusive possibilities: There is a complex structure on making it into a Kähler manifold, or For any almost complex structure compatible with the metric, at e…
CREAM models enable concept-grounded predictions and interpretability.
Survey of integrating domain knowledge into DL models.
Different from the traditional classification tasks which assume mutual exclusion of labels, hierarchical multi-label classification (HMLC) aims to assign multiple labels to every instance with the labels organized under hierarchical relations. Besides the labels, since linguistic ontologies are intrinsic hierarchies, …
Overlapping clustering problem is an important learning issue in which clusters are not mutually exclusive and each object may belongs simultaneously to several clusters. This paper presents a kernel based method that produces overlapping clusters on a high feature space using mercer kernel techniques to improve separa…
We review two strands of conceptual approaches to the formal representation of a decision maker's non-knowledge at the initial stage of a static one-person, one-shot decision problem in economic theory. One focuses on representations of non-knowledge in terms of probability measures over sets of mutually exclusive and …
In reinforcement learning (RL), temporal abstraction still remains as an important and unsolved problem. The options framework provided clues to temporal abstraction in the RL, and the option-critic architecture elegantly solved the two problems of finding options and learning RL agents in an end-to-end manner. However…
This paper tackles multi-modal label disentanglement in partition-based XMC.
In this paper we study the problem of acoustic scene classification, i.e., categorization of audio sequences into mutually exclusive classes based on their spectral content. We describe the methods and results discovered during a competition organized in the context of a graduate machine learning course; both by the st…
After admission to emergency department (ED), patients with critical illnesses are transferred to intensive care unit (ICU) due to unexpected clinical deterioration occurrence. Identifying such unplanned ICU transfers is urgently needed for medical physicians to achieve two-fold goals: improving critical care quality a…
Latent variable models with hidden binary units appear in various applications. Learning such models, in particular in the presence of noise, is a challenging computational problem. In this paper we propose a novel spectral approach to this problem, based on the eigenvectors of both the second order moment matrix and t…
PyDTS analyzes survival data with discrete intervals and competing risks.
Multivariate count data are defined as the number of items of different categories issued from sampling within a population, which individuals are grouped into categories. The analysis of multivariate count data is a recurrent and crucial issue in numerous modelling problems, particularly in the fields of biology and e…
Introduces joint exclusivity (JE), a new form of negative dependence.
The paper proves neural networks with ReLU and softmax can approximate any function.
We propose an efficient method to estimate the accuracy of classifiers using only unlabeled data. We consider a setting with multiple classification problems where the target classes may be tied together through logical constraints. For example, a set of classes may be mutually exclusive, meaning that a data instance c…
Adversarial examples are delicately perturbed inputs, which aim to mislead machine learning models towards incorrect outputs. While most of the existing work focuses on generating adversarial perturbations in multi-class classification problems, many real-world applications fall into the multi-label setting in which on…
Log-conformal projective pairs restrict to simple geometric structures.
Efficient neural networks for resource-constrained systems.
The assumption of positivity in causal inference (also known as common support and co-variate overlap) is necessary to obtain valid causal estimates. Therefore, confirming it holds in a given dataset is an important first step of any causal analysis. Most common methods to date are insufficient for discovering non-posi…
The classical mixture of Gaussians model is related to K-means via small-variance asymptotics: as the covariances of the Gaussians tend to zero, the negative log-likelihood of the mixture of Gaussians model approaches the K-means objective, and the EM algorithm approaches the K-means algorithm. Kulis & Jordan (2012) us…
A new method for optimizing stakes in a single event with multiple outcomes.
New method identifies latent variables with sparse perturbations.
Study shows over-sampling biases prediction results on imbalanced datasets.
A new sampling method balances multi-label datasets by preserving category frequency order.
New causal analysis reconciles predictive and statistical fairness.
HHAR-net uses neural networks to recognize human activities at different levels of abstraction.
New framework compares credal sets for hypothesis testing with epistemic uncertainty.
MUSIC learns coupled systems with sparse data and incomplete physics.
This work explores the relation between trainability and dequantization in variational QML models.
Proposes extensions to semi-parametric models using BART for shared covariates.
Develops AMITE for analyzing neural network nonlinearities.
AER combines auto-encoder and LSTM for better time series anomaly detection.
Fair Adversarial Networks remove bias from data.
Polymarket users exploit mispriced assets for profit.
Paper proposes scalable multi-label classification for edge devices using CNN.
This paper reviews dMTL and methods for selecting auxiliary tasks.
APT-Gen generates tasks to help RL learn in hard problems.
OCEAN infers online task identities from context variables.
Sharing information between multiple tasks enables algorithms to achieve good generalization performance even from small amounts of training data. However, in a realistic scenario of multi-task learning not all tasks are equally related to each other, hence it could be advantageous to transfer information only between …
Proposes a new method for clustering tasks in multi-task learning.