Algorithm confirms non-order-preserving braids, proving infinite family not order-preserving.
problem Determining if a braid is non-order-preserving.
method Algorithm that checks non-order-preserving property of braids.
result Infinite family of simple 3-braids are not order-preserving.
Enhances image classification by integrating semantic hierarchy into CNN models.
problem Limited use of external guidance in image classification.
method Integrates label-hierarchy knowledge into CNN-based classifiers and uses order-preserving embeddings.
result Boosts image classification performance through semantic hierarchy integration.
In this article we introduce order preserving representations of fundamental groups of surfaces into Lie groups with bi-invariant orders. By relating order preserving representations to weakly maximal representations, introduced in arXiv:1305.2620, we show that order preserving representations into Lie groups of Hermit…
The thesis introduces methods to use semantic hierarchy in image classification.
problem Limited work in training image classifiers with non-conventional external guidance.
method Injects label hierarchy knowledge into arbitrary classifiers and uses order-preserving embeddings for image classification.
result Both embedding-based models and CNN-classifiers with hierarchical information outperform a hierarchy-agnostic model.
Method preserves order in hierarchical clustering of ordered data.
problem Order preserving hierarchical clustering of directed acyclic graphs.
method Combination of classical hierarchical clustering and ultrametric fitting.
result Optimal clustering preserves both cluster quality and order.
In this paper we further investigate the geometry of monads of order-preserving functionals and of positively homogeneous functionals. We prove that for any compactum X with w(X)=τ the map μFX, where F∈{O,OH}, is homeomorphic to trivial Iτ-fibration if and only if X is openly generated χ-homogeneou…
Polytopes A(P) for posets P compactify spaces of order-preserving maps.
problem Compactifying spaces of order-preserving maps for posets.
method Constructing polytopes A(P) and compactifying spaces of order-preserving maps. result Polytopes A(P) correspond to nested collections of subsets of posets. New method calibrates deep networks by preserving top-k predictions.
problem Calibrated confidence scores for multi-class deep networks to avoid rare mistakes.
method Intra order-preserving functions combined with neural network architecture.
result Outperforms state-of-the-art methods in evaluation metrics.
OP-GFNs sample candidates in order-preserving proportion to a learned reward function.
problem Sampling diverse candidates with varying rewards in multi-objective optimization.
method Order-Preserving GFlowNets (OP-GFNs) use a learned reward function consistent with a provided order on candidates.
result Training OP-GFNs sparsifies the reward landscape, focusing on higher-ranked candidates.
We present a novel factor analysis method that can be applied to the discovery of common factors shared among trajectories in multivariate time series data. These factors satisfy a precedence-ordering property: certain factors are recruited only after some other factors are activated. Precedence-ordering arise in appli…
New set class preserves Fourier series terms for planar ovals, leading to isoperimetric inequalities.
problem Investigate geometric properties of kth Order Preserving Sets and ovals. method Introduce and analyze kth Order Preserving Sets and Midpoint Sets; study geometric properties and isoperimetric inequalities. result Established an isoperimetric-type inequality relating perimeter and area of ovals and their associated sets.
New criterion for bi-ordering free groups under automorphisms.
problem Bi-ordering free groups under automorphisms.
method New criterion for bi-ordering free groups.
result Fundamental group of the magic manifold is bi-orderable.
MCNet improves uncertainty calibration in online advertising by modeling complex relations and balancing performance.
problem Lack of effective calibration for complex relations and context features in online advertising.
method Introduces MCNet with MCF, order-preserving, and field-balance regularizers.
result Superior performance in generating well-calibrated probability predictions on public and industrial datasets.
Framework analyzes neural network dynamics for better understanding and optimization.
problem Understanding the fundamental mechanisms of deep neural networks.
method Dynamical systems theory, transformation units, attraction basins.
result Different transformation modes lead to distinct learning phases and network performance.
A new method estimates rare events using tensor trains.
problem Estimating rare event probabilities in high-dimensional problems.
method Approximating optimal importance distribution via tensor-train decompositions and compositions.
result Better variance reduction and efficient computation of rare event probabilities.
A new index rebalancing strategy reduces large constituent weights without undesirable effects.
problem Undesirable effects of current Nasdaq-100 index rebalancing.
method A simple rebalancing strategy that avoids undesirable effects.
result Preserves the order of index weights and prevents maximum weight increase.
It is well known that a countable group admits a left-invariant total order if and only if it acts faithfully on R by orientation preserving homeomorphisms. Such group actions are special cases of group actions on simply connected 1-manifolds, or equivalently, actions on oriented order trees. We characterize a class of…
Let (W,S) be a finite rank Coxeter system with W infinite. We prove that the limit weak order on the blocks of infinite reduced words of W is encoded by the topology of the Tits boundary of the Davis complex X of W. We consider many special cases, including W word hyperbolic, and X with isolated flats. We establish tha…
CNNs, RNNs, GCNs, and CapsNets have shown significant insights in representation learning and are widely used in various text mining tasks such as large-scale multi-label text classification. However, most existing deep models for multi-label text classification consider either the non-consecutive and long-distance sem…
It is well-known that there is a faithful representation of braid groups on automorphism groups of free groups, and it is also well-known that free groups are bi-orderable. We investigate which n-strand braids give rise to automorphisms which preserve some bi-ordering of the free group rank n. As a consequence of our w…
A lot of attention has been devoted to multimedia indexing over the past few years. In the literature, we often consider two kinds of fusion schemes: The early fusion and the late fusion. In this paper we focus on late classifier fusion, where one combines the scores of each modality at the decision level. To tackle th…
Introduces a differentiable approximation to the zero-one loss.
problem Incompatibility of zero-one loss with gradient-based optimization.
method Smooth projection onto hypersimplex through constrained optimization.
result Achieves significant improvements in generalization under large-batch training.
In the past few years, a lot of attention has been devoted to multimedia indexing by fusing multimodal informations. Two kinds of fusion schemes are generally considered: The early fusion and the late fusion. We focus on late classifier fusion, where one combines the scores of each modality at the decision level. To ta…
New framework detects directional influence in multivariate time series.
problem Detecting directional influence in multivariate time series.
method Order-constrained spectral non-invariance.
result Unique diagnostic functional for directional influence.
Paper finds formulas for mutual information and MMSE in matrix tensor product problems.
problem High-dimensional inference problems involving matrix tensor products.
method Single-letter formulas for mutual information and MMSE, using new techniques.
result Analytical formulas describe leading order terms in mutual information and MMSE.
Efficiently learns and transports posterior densities for real-time inference.
problem High computational cost of Bayesian inference for complex posterior densities.
method Tensor-train (TT) format for offline learning, conditional transport for online inference.
result Significant improvement in inference performance for high-dimensional problems.
Paper generalizes tensor-train approximation for complex random variables.
problem Characterizing intractable high-dimensional random variables.
method Extends inverse Rosenblatt transform to general reference measures and integrates into deep variable transformation framework.
result Deep inverse Rosenblatt transport significantly expands tensor approximations for complex random variables.
A new framework separates classifier calibration and discrimination.
problem Combining reliability and resolution in probabilistic predictions.
method Manokhin Probability Matrix separates reliability and resolution using Spiegelhalter Z-statistic and AUC-ROC.
result Classifiers are categorized into four archetypes: Eagle, Bull, Sloth, and Mole.
TMTF improves time series visualization by separating dynamic regimes.
problem Misleading global transition matrix in time series analysis.
method Temporal chunking, local transition matrices, and image assembly.
result Temporal segmentation reveals distinct transition dynamics.
Improved change point detection using matched filters for non-parametric tests.
problem False positives and localization ambiguity in non-parametric two-sample tests.
method Derived and applied matched filters for various two-sample tests.
result Matched filters reduce false positives and improve test precision.
Develops a new nonparametric trace regression model for high-dimensional data.
problem Violation of known functional form and global low-rank structure assumptions in trace regression.
method Structured sign series representations for nonparametric trace regression models.
result Establishes excess risk bounds and sample complexities for the proposed model.
The paper develops a Galois theory for cluster algebras and Riemann surfaces.
problem Building a correspondence between cluster subalgebras and automorphism groups.
method Introducing Galois-like extensions and automorphism groups for cluster algebras.
result Conditions for Galois-like extensions and properties of cluster automorphism groups.
Embeddings are ubiquitous in machine learning, appearing in recommender systems, NLP, and many other applications. Researchers and developers often need to explore the properties of a specific embedding, and one way to analyze embeddings is to visualize them. We present the Embedding Projector, a tool for interactive v…
Proposes QQE for transforming and embedding data distributions.
problem Transforming and embedding data distributions for better representation or visualization.
method Quantile-Quantile Embedding (QQE) using quantile-quantile plot concept.
result QQE allows for better discrimination of classes in some cases.
Maps can be embedded in higher dimensions if they lift to embeddings in product spaces.
problem Embedding maps in higher dimensions without self-intersections.
method Lifting maps to embeddings in product spaces.
result Maps can be embedded in higher dimensions if they lift to embeddings in product spaces.
New embeddings for manifolds using heat kernels.
problem Constructing canonical conformal embeddings for manifolds.
method Employing heat kernel embedding from Bérard-Besson-Gallot'94 to find canonical conformal embeddings.
result Intrinsic construction of canonical conformal embeddings with dimensions growing exponentially with t. Introduces PELP for graph-enhanced word embeddings.
problem Combining graph side-information into static word embeddings.
method Probabilistic embeddings using Laplacian priors.
result Unified and flexible approach to various embedding methods.
Curvature regularization prevents distortion in graph embeddings.
problem Graph topology patterns distort in Euclidean space, making detection difficult.
method Proposes curvature regularization to enforce flatness in embedding manifolds.
result Significant improvements in five embedding methods on open graph datasets.
Word embeddings are a powerful approach for unsupervised analysis of language. Recently, Rudolph et al. (2016) developed exponential family embeddings, which cast word embeddings in a probabilistic framework. Here, we develop dynamic embeddings, building on exponential family embeddings to capture how the meanings of w…
Proposes cone embedding for better graph hierarchical structure representation.
problem Lack of natural and interpretable hierarchical indicators in graph embeddings.
method Metric cone embedding method to capture hierarchical structure.
result Extracts hierarchical structure from other graph embedding outputs.
Classifies linear embeddings of grassmannians and ind-grassmannians.
problem Understanding linear embeddings of grassmannians and ind-grassmannians.
method Classification through isomorphism of Picard groups and direct limits.
result Most linear embeddings of grassmannians are equivariant.
BC-Aligner maintains backward compatibility of embeddings after frequent updates.
problem Updating embeddings without requiring consumer teams to retrain their models.
method Learning backward compatible embeddings through BC-Aligner.
result BC-Aligner maintains backward compatibility with existing unintended tasks after multiple model version updates.
Embedding calculus proves convergence for surfaces.
problem Proving convergence of embedding calculus for surfaces.
method Goodwillie-Weiss' embedding calculus for spaces of embeddings into a manifold of dimension at most two.
result Relates Johnson filtration of mapping class group to embedding calculus.
Unified framework for word embedding models using noise examples.
problem Improving word embedding models with negative sampling.
method Formulated a Word-Context Classification (WCC) framework that generalizes SkipGram word embedding models.
result The best noise distribution is the data distribution, improving both performance and training speed.
Models use embeddings and attention for better claim severity prediction.
problem Improving predictive modeling of claim severity with categorical data.
method Developed neural networks and attention-based architectures with embeddings.
result Attention-based models enhance predictive performance with contextual augmentation.
A fast graph embedding method for large graphs.
problem Efficiently embedding large graphs for various applications.
method One-hot graph encoder embedding with linear complexity.
result Graph encoder embedding is approximately normally distributed and converges to its mean.
Paper proves impossibility of three desirable properties in node embedding.
problem Understanding limitations of node embedding methods.
method Axiomatic approach to node embedding, proving impossibility of three properties.
result No node embedding method can satisfy all three desirable properties simultaneously.
The study characterizes and verifies equivariant embeddings of symmetric Kählerian manifolds.
problem Characterizing and verifying equivariant embeddings of symmetric Kählerian manifolds.
method Investigation motivated by Cartan and Wallach's theorem on symmetric spaces, focusing on CPn and parallel plurimean curvature. result If an equivariant embedding has parallel plurimean curvature, it is the extrinsically symmetric one.