Study on unimodality of plucking polynomial with delay function.
problem Exploring unimodality of plucking polynomial with delay function.
method Presented a formula for the plucking polynomial of hedgehog rooted trees and explored unimodality with specific delay functions.
result Found interesting examples and speculations on unimodality of plucking polynomials with delay functions.
Optimal unimodal fitting for linear loss functions in a sequential, efficient manner.
problem Optimal unimodal transformation of univariate model scores under linear loss functions.
method Proposes a sequential approach to estimate the optimal rectangular fit for observed samples with each new sample.
result Sequential approach achieves optimal efficiency with logarithmic time complexity per iteration.
Proposes a method to partition univariate data into unimodal subsets.
problem Partitioning univariate multimodal data into unimodal subsets.
method Recursive splitting around valley points of the data density using properties of critical points on the convex hull of the ecdf plot.
result Obtains a hierarchical statistical model of the initial dataset as a mixture of UMMs.
A new UU-test decides unimodality of datasets.
problem Deciding on the unimodality of a dataset for better data analysis.
method UU-test operates on the empirical cumulative density function (ecdf) to build a piecewise linear approximation that models the data as a Uniform Mixture Model.
result The UU-test provides a statistical model of the data in the form of a Uniform Mixture Model.
GONs improve predictions of maximizers from noisy black-box functions.
problem Estimating maximizers of noisy black-box functions.
method Global Optimization Networks (GONs) composed of invertible and unimodal functions.
result GONs outperform convex fits, GPR, and DNNs in prediction accuracy.
Proposes models to better represent ordinal data with non-unimodal distributions.
problem Real-world ordinal data often have non-unimodal conditional probability distributions.
method Develops approximately unimodal likelihood models to better represent non-unimodal CPDs.
result Proposed models can effectively represent both unimodal and nearly unimodal CPDs.
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…
Proposes a deep ordinal regression framework using optimal transport loss and unimodal output probabilities.
problem Lack of unimodal output probabilities in recent ordinal regression models.
method Introduces a deep learning framework based on optimal transport loss and unimodal output distribution, inspired by the Proportional Odds model.
result Demonstrates improved performance and unimodal output probabilities on real-world datasets compared to existing methods.
New algorithm optimizes unimodal bandits using empirical divergence.
problem Optimizing decisions in multi-armed bandit problems with unimodal distributions.
method Indexed Minimum Empirical Divergence (IMED) adapted for unimodal structure.
result IMED-UB algorithm optimally exploits unimodal structure.
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.
problem Theoretical justification for empirical success of multimodal machine learning.
method Introduced a stronger average-case computational separation between unimodal and multimodal learning.
result For typical instances, unimodal learning is computationally hard, while multimodal learning is easy.
Unimodal sequences of moves connect 3-manifold triangulations.
problem Understanding the structure of sequences of bistellar flips.
method Examined unimodal sequences of moves that increase and decrease triangulation size.
result Proved that any two one-vertex triangulations are connected by a unimodal sequence of moves.
We propose a differentiable sigmoid function for efficient p-value calculation in clustering.
problem Efficient and accurate p-value calculation for clustering algorithms.
method Designed a differentiable sigmoid function to approximate the Dip-p-value transformation.
result Accelerates computation and integrates well with gradient descent-based learning schemes.
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…
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…
New strategies avoid forced exploration for unimodal bandits.
problem Optimal exploration of unimodal bandit problems.
method Adapting IMED strategy to unimodal structure without forced exploration.
result Proven optimal strategies for unimodal bandits.
High-dimensional unimodal distributions can cause MCMC methods to fail.
problem Failure of MCMC methods in high-dimensional unimodal distributions.
method Examples and theoretical analysis of MCMC methods, including Metropolis-Hastings adjusted methods.
result MCMC methods can take an exponential run-time for high-dimensional unimodal distributions.
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.
problem Analyzing risk metrics and entropies for unimodal, symmetric distributions with limited information.
method Develops lower and upper bounds for worst-case distortion riskmetrics and weighted entropy for unimodal, symmetric distributions with known mean and variance.
result Sharp upper bounds for distortion riskmetrics and weighted entropy for symmetric distributions.
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.
problem Understanding the distribution of slope gaps on polygon surfaces.
method Explicit computation of slope gap distributions for 2n-gons, providing bounds on non-differentiability points.
result Slope gap distributions are not always unimodal, answering a question by Athreya.
Proposes methods for local clustering in attributed graphs.
problem Finding a single cluster concentrated on a specific region in a graph.
method Introduces Graph Unimodality (GU) and Attribute Unimodality (AU) measures, and LOCLU algorithm to optimize Compactness score.
result Local cluster detected by LOCLU concentrates on the region of interest and exhibits unimodal data distribution.
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.
problem Analyzing systemic risk in financial systems using mathematical models.
method Investigation of one-dimensional unimodal maps perturbed by heteroscedastic noise, proving stability, convergence, and Lyapunov exponent continuity.
result Continuous dependence of average Lyapunov exponent on Markov chain parameters, and Gumbel's law for extreme values.
New algorithm reduces regret in multi-armed bandit problems with Gaussian rewards.
problem Optimizing decisions in multi-armed bandit problems with Gaussian rewards.
method Proposed TSCG and UTSCG algorithms using Thompson Sampling with Gaussian prior.
result Achieved lower regret bounds for optimal arm selection.
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…
Let M be a compact, connected Riemannian manifold whose Riemannian volume measure is denoted by σ. Let f:M→R be a non-constant eigenfunction of the Laplacian. The random wave conjecture suggests that in certain situations, the value distribution of f under σ is approximately Gaussian. Wr…
This work uses ANOVA to understand how different factors contribute to test error in machine learning models.
problem Understanding why overparametrized models generalize well despite potentially fitting noise.
method Analysis of variance (ANOVA) to decompose test error into components of variance.
result The interaction between training samples and initialization can dominate variance, and there are phase transitions in variance behavior.
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…
Deep Gaussian Processes improve likelihood-free inference for complex distributions.
problem Limited flexibility of Bayesian Optimization with GPs for multimodal distributions.
method Proposes Deep Gaussian Processes (DGPs) as a surrogate model for likelihood-free inference.
result DGPs outperform GPs on multimodal distributions while maintaining comparable performance on unimodal cases.
This work improved clustering methods by analyzing various datasets and dendrograms.
problem Avoiding false positives in clustering, especially for unimodal and bimodal data.
method Applied agglomerative clustering methods (single, average, median, complete, centroid, Ward's) to various datasets.
result Many methods detected two clusters in unimodal data, with single-linkage being more resilient.
Paper introduces clock moves for plane graphs and proves Alexander polynomial properties.
problem Alexander polynomial of plane graphs and unimodality of coefficients.
method Introduces clock moves for plane graphs and develops a spanning tree model of Alexander polynomial.
result Proves unimodal property of Alexander polynomial coefficients and confirms conjectures.
WES improves neural network regression by stretching distribution error.
problem Improving prediction performance in neural-network-based regression.
method Proposed weighted empirical stretching (WES) loss function.
result WES outperforms existing loss functions, especially in extreme domains.
Unimodal approach for group-level emotion recognition without individual features.
problem Privacy issues in individual-based emotion recognition models.
method Frugal approach using global features, state-of-the-art and synthetic corpora.
result 59.13% accuracy on VGAF test set, 11th place in EmotiW Challenge 2020.
Sharp bounds for distortion risk metrics under uncertain distributions.
problem Modeling risk metrics under distributional uncertainty.
method Established bounds for distortion risk metrics using specific features of underlying distributions.
result Identified worst- and best-case values of distortion risk metrics.
Proposes new loss functions for better handling bimodal predictive uncertainty.
problem Bimodal predictive uncertainty in machine learning models.
method Family of distribution-aware loss functions integrating normalized RMSE with Wasserstein and Cramér distances.
result Proposed loss functions reduce predictive uncertainty estimation error by 45% on complex bimodal datasets.
Using a result of Takata, we prove a formula for the colored Jones polynomial of the double twist knots K(−m,−p) and K(−m,p) where m and p are positive integers. In the (−m,−p) case, this leads to new families of q-hypergeometric series generalizing the Kontsevich-Zagier series. Comparing with the cyc…
We find stationary distributions in a financial model with trends and mean-reversion.
problem Financial markets with competing trends and mean-reversion.
method Analytical derivation of stationary distributions in various noise and feedback regimes.
result The distributions are unimodal Gaussians in small noise, small feedback limits, but can be bimodal for stronger trends.
We solve a century-old conjecture about Alexander polynomials of special alternating links.
problem Fox's conjecture about unimodality of Alexander polynomial coefficients.
method Proving a multivariate generalization of the Alexander polynomial is Lorentzian.
result Alexander polynomial coefficients of special alternating links form a log-concave sequence.
Algorithm bounds causal queries under selection bias.
problem Selection bias affects causal analysis.
method Proposes a new algorithm to address both identifiable and unidentifiable causal queries.
result The likelihood of available data is unimodal, enabling bounds on causal queries.
Thermal preferences vary from person to person and may change over time. The main objective of this paper is to sequentially pose intelligent queries to occupants in order to optimally learn the indoor air temperature values which maximize their satisfaction. Our central hypothesis is that an occupant's preference rela…
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 …
Enhances multimodal generation with Normalizing Flows and correlation analysis.
problem Generating coherent cross-modal data from multiple sources.
method Uses Deep Canonical Correlation Analysis for shared information, Normalizing Flows for diversity, and Product of Experts for scalability.
result Improves likelihood, diversity, and coherence in conditional generation.
Let W⋉L be an irreducible affine Weyl group with Coxeter complex Σ, where W denotes the associated finite Weyl group and L the translation subgroup. The Steinberg torus is the Boolean cell complex obtained by taking the quotient of Σ by the lattice L. We show that the ordinary and flag h-polynomial…
Cluster analysis is an unsupervised learning strategy that can be employed to identify subgroups of observations in data sets of unknown structure. This strategy is particularly useful for analyzing high-dimensional data such as microarray gene expression data. Many clustering methods are available, but it is challengi…
Automatic detection of emotion has the potential to revolutionize mental health and wellbeing. Recent work has been successful in predicting affect from unimodal electrocardiogram (ECG) data. However, to be immediately relevant for real-world applications, physiology-based emotion detection must make use of ubiquitous …