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.
Proposes a deep ordinal regression framework using optimal transport loss and unimodal output probabilities.
Optimal unimodal fitting for linear loss functions in a sequential, efficient manner.
Proposes models to better represent ordinal data with non-unimodal distributions.
A new UU-test decides unimodality of datasets.
Proposes a method to partition univariate data into unimodal subsets.
New algorithm optimizes unimodal bandits using empirical divergence.
Study on unimodality of plucking polynomial with delay function.
This paper provides a new unimodality test with application in hierarchical clustering methods. The proposed method denoted by signature test (Sigtest), transforms the data based on its statistics. The transformed data has much smaller variation compared to the original data and can be evaluated in a simple proposed un…
This paper strengthens the computational separation between multimodal and unimodal learning, showing unimodal learning is hard on typical instances.
Unimodal sequences of moves connect 3-manifold triangulations.
We classify rooted trees which have strictly unimodal q-polynomials (plucking polynomial). We also give criteria for a trapezoidal shape of a plucking polynomial. We generalize results of Pak and Panova on strict unimodality of q-binomial coefficients. We discuss which polynomials can be realized as plucking polynomial…
New strategies avoid forced exploration for unimodal bandits.
High-dimensional unimodal distributions can cause MCMC methods to fail.
We consider stochastic multi-armed bandits where the expected reward is a unimodal function over partially ordered arms. This important class of problems has been recently investigated in (Cope 2009, Yu 2011). The set of arms is either discrete, in which case arms correspond to the vertices of a finite graph whose stru…
Multimodalities provide promising performance than unimodality in most tasks. However, learning the semantic of the representations from multimodalities efficiently is extremely challenging. To tackle this, we propose the Transformer based Cross-modal Translator (TCT) to learn unimodal sequence representations by trans…
The paper calculates bounds for risk metrics and entropies under partial information constraints.
Chia and Nakano (2009) introduced the concept of M-decomposability of probability densities in one-dimension. In this paper, we generalize M-decomposability to any dimension. We prove that all elliptical unimodal densities are M-undecomposable. We also derive an inequality to show that it is better to represent an M-de…
Study calculates slope gaps on polygon surfaces, finding non-unimodal distributions.
Proposes methods for local clustering in attributed graphs.
In regression tasks, aleatoric uncertainty is commonly addressed by considering a parametric distribution of the output variable, which is based on strong assumptions such as symmetry, unimodality or by supposing a restricted shape. These assumptions are too limited in scenarios where complex shapes, strong skews or mu…
We present an efficient approach for leveraging the knowledge from multiple modalities in training unimodal 3D convolutional neural networks (3D-CNNs) for the task of dynamic hand gesture recognition. Instead of explicitly combining multimodal information, which is commonplace in many state-of-the-art methods, we propo…
Stochastic Rank-One Bandits (Katarya et al, (2017a,b)) are a simple framework for regret minimization problems over rank-one matrices of arms. The initially proposed algorithms are proved to have logarithmic regret, but do not match the existing lower bound for this problem. We close this gap by first proving that rank…
Probability distributions produced by the cross-entropy loss for ordinal classification problems can possess undesired properties. We propose a straightforward technique to constrain discrete ordinal probability distributions to be unimodal via the use of the Poisson and binomial probability distributions. We evaluate …
Study on financial systems using perturbed unimodal maps with heteroscedastic noise.
New algorithm reduces regret in multi-armed bandit problems with Gaussian rewards.
Hierarchical nucleation patterns emerge in deep neural network layers.
Integrating visual and linguistic information into a single multimodal representation is an unsolved problem with wide-reaching applications to both natural language processing and computer vision. In this paper, we present a simple method to build multimodal representations by learning a language-to-vision mapping and…
The paper studies how arm selection in a bandit problem changes with shape constraints.
Automatic prediction of emotion promises to revolutionise human-computer interaction. Recent trends involve fusion of multiple data modalities - audio, visual, and physiological - to classify emotional state. However, in practice, collection of physiological data `in the wild' is currently limited to heartbeat time ser…
An infinite family of generalized pseudo-Anosov homeomorphisms of the sphere S is constructed, and their invariant foliations and singular orbits are described explicitly by means of generalized train tracks. The complex strucure induced by the invariant foliations is described, and is shown to make S into a complex sp…
Human language is a rich multimodal signal consisting of spoken words, facial expressions, body gestures, and vocal intonations. Learning representations for these spoken utterances is a complex research problem due to the presence of multiple heterogeneous sources of information. Recent advances in multimodal learning…
GONs improve predictions of maximizers from noisy black-box functions.
Multimodal fusion is considered a key step in multimodal tasks such as sentiment analysis, emotion detection, question answering, and others. Most of the recent work on multimodal fusion does not guarantee the fidelity of the multimodal representation with respect to the unimodal representations. In this paper, we prop…
This work improved clustering methods by analyzing various datasets and dendrograms.
Paper introduces clock moves for plane graphs and proves Alexander polynomial properties.
Unimodal approach for group-level emotion recognition without individual features.
A method to improve image synthesis diversity using mutual information.
Trend and Value are pervasive anomalies, common to all financial markets. We address the problem of their co-existence and interaction within the framework of Heterogeneous Agent Based Models (HABM). More specifically, we extend the Chiarella (1992) model by adding noise traders and a non-linear demand of fundamentalis…
Sorting input objects is an important step in many machine learning pipelines. However, the sorting operator is non-differentiable with respect to its inputs, which prohibits end-to-end gradient-based optimization. In this work, we propose NeuralSort, a general-purpose continuous relaxation of the output of the sorting…
GGMPs improve non-Gaussian conditional density estimation.
We find stationary distributions in a financial model with trends and mean-reversion.
In this paper, we propose to employ a bank of modality-dedicated Convolutional Neural Networks (CNNs), fuse, train, and optimize them together for person classification tasks. A modality-dedicated CNN is used for each modality to extract modality-specific features. We demonstrate that, rather than spatial fusion at the…
We propose a differentiable sigmoid function for efficient p-value calculation in clustering.
We solve a century-old conjecture about Alexander polynomials of special alternating links.
Algorithm bounds causal queries under selection bias.
Regularized least-squares approaches have been successfully applied to linear system identification. Recent approaches use quadratic penalty terms on the unknown impulse response defined by stable spline kernels, which control model space complexity by leveraging regularity and bounded-input bounded-output stability. T…
This work uses ANOVA to understand how different factors contribute to test error in machine learning models.
We introduce Disease Knowledge Transfer (DKT), a novel technique for transferring biomarker information between related neurodegenerative diseases. DKT infers robust multimodal biomarker trajectories in rare neurodegenerative diseases even when only limited, unimodal data is available, by transferring information from …