Paper speeds up matrix multiplication on Intel PIII using SIMD.
problem Efficiently multiplying large matrices for faster algorithm performance.
method Implemented matrix-matrix multiply using Intel Pentium SIMD architecture.
result Average performance 2.09 times faster than public domain routines.
GPyTorch accelerates GP inference using GPU hardware.
problem Inefficient GP inference tools on modern hardware.
method Blackbox Matrix-Matrix (BBMM) inference with GPU acceleration.
result Significant speedup in GP inference and approximations.
Paper proposes new costs for learning multiple centers in MDNs.
problem Learning multiple centers for density approximation in MDNs.
method Combines MDNs with contrastive costs using four types of kernelized matrix costs.
result New costs improve data density approximation in MDNs.
This paper uses supervised learning to predict optimal chunk-size for parallel linear algebra operations.
problem Finding the optimal chunk-size for parallel linear algebra operations.
method The paper uses supervised learning models (logistic regression, neural networks, decision trees) to predict the optimal chunk-size for multiple linear algebra operations.
result The custom decision tree model outperforms classical decision trees and other models in predicting optimal chunk-size for linear algebra operations.
Improves matrix multiplication throughput for asymmetric bit-width operands.
problem Matrix multiplications between asymmetric bit-width operands, especially 8- and 4-bit, are not efficiently handled by existing SIMD instructions.
method Proposes a new SIMD matrix multiplication instruction that uses mixed precision on inputs (8- and 4-bit) and accumulates into 16-bit output, improving throughput.
result Offers 2x improvement in throughput compared to existing symmetric-operand-size instructions, with negligible overflow.
We consider the problem of efficient randomized dimensionality reduction with norm-preservation guarantees. Specifically we prove data-dependent Johnson-Lindenstrauss-type geometry preservation guarantees for Ho's random subspace method: When data satisfy a mild regularity condition -- the extent of which can be estima…
Efficiently solves high-dimensional ODEs with probabilistic methods.
problem Solving high-dimensional ODEs with uncertainty quantification.
method Probabilistic numerical algorithm based on independence assumptions or Kronecker structure.
result Efficient probabilistic solutions for ODEs with millions of dimensions.
High-dimensional time series prediction is needed in applications as diverse as demand forecasting and climatology. Often, such applications require methods that are both highly scalable, and deal with noisy data in terms of corruptions or missing values. Classical time series methods usually fall short of handling bot…
Data often comes in the form of an array or matrix. Matrix factorization techniques attempt to recover missing or corrupted entries by assuming that the matrix can be written as the product of two low-rank matrices. In other words, matrix factorization approximates the entries of the matrix by a simple, fixed function-…
Optimizes parameters in high-dimensional spaces for practical applications.
problem Tuning parameters for complex systems like electron accelerators.
method Bayesian optimization techniques applied to high-dimensional problems.
result Novel algorithm BORING for parameter optimization.
SGD with mini-batches can solve convex low-rank matrix problems efficiently.
problem Solving large-scale convex low-rank matrix problems efficiently.
method Stochastic Gradient Descent with mini-batches and low-rank projections.
result SGD with mini-batches produces low-rank iterates with high probability.
Paper proves Pareto efficient insurance for multiple entities.
problem Optimizing insurance for multiple policyholders and insurers.
method Sum-minimization characterization and pairwise implementability analysis.
result Characterization of Pareto efficient insurance arrangements.
Study of multiplicative connections in Lie groupoids.
problem Defining and understanding multiplicative connections in Lie groupoids.
method Definition and study of multiplicative connections satisfying compatibility with the groupoid structure.
result Identification of the obstruction to the existence of a multiplicative connection.
Study rectifying curves in 3D multiplicative Euclidean space.
problem Investigate rectifying curves in a non-Newtonian geometry setting.
method Apply multiplicative differential-geometric concepts to rectifying curves.
result Classify multiplicative rectifying curves using spherical curves.
Proves multiplicity one for mean curvature flow singularities.
problem Understanding singularities in mean curvature flow of surfaces.
method Analyzes self-shrinkers and constructs perturbations.
result Proves multiplicity one for generic singularities.
New method identifies proxies for causal effects on multiple outcomes.
problem Estimating causal effects in scenarios with multiple outcomes and treatments.
method Causal discovery method leveraging multiple outcomes as proxies for each treatment effect.
result Parallel studies of multiple outcomes can assist in causal identification.
The paper classifies symmetric triads with multiplicities and their applications.
problem Classifying symmetric triads with multiplicities and their applications.
method Developed the theory of symmetric triads with multiplicities, classified abstract triads, and determined corresponding triads for commutative compact triads.
result Classified symmetric triads with multiplicities and their applications.
We define a concept which we call multiplicity. First, multiplicity of a morphism is defined. Then the multiplicity of an object over another object is defined to be the minimum of the multiplicities of all morphisms from one to another. Based on this multiplicity, we define a pseudo distance on the class of objects. W…
Study finds methods to learn multiple solutions from single task in offline RL.
problem Learning multiple solutions from a single task in offline RL.
method Proposed algorithms for offline RL.
result Empirical results show learning of multiple solutions in offline RL.
We introduce a multiple conjugation biquandle, and show that it is the universal algebra to define a semi-arc coloring invariant for handlebody-links. A multiple conjugation biquandle is a generalization of a multiple conjugation quandle. We extend the notion of n-parallel biquandle operations for any integer n, an…
Let (M,ω) be a connected symplectic manifold on which a connected Lie group G acts properly and in a Hamiltonian fashion with moment map $μ:M \lra \mf g^*$. Our purpose is investigate multiplicity-free actions, giving criteria to decide a multiplicity freenes of the action. As an application we give the complete cl…
Recently neural networks and multiple instance learning are both attractive topics in Artificial Intelligence related research fields. Deep neural networks have achieved great success in supervised learning problems, and multiple instance learning as a typical weakly-supervised learning method is effective for many app…
MKLpy simplifies Multiple Kernel Learning in Python.
problem Learning optimal kernel functions from data.
method Python-based framework for Multiple Kernel Learning algorithms.
result Maximizes usability and simplifies development of novel solutions.
Strictly stable Allen-Cahn hypersurfaces have multiplicity one.
problem Understanding the multiplicity of stable hypersurfaces in Allen-Cahn equations.
method Analyzing strictly stable components without variational assumptions.
result Strictly stable components occur with multiplicity one.
X-SHAP assesses multiplicative variable contributions in machine learning models.
problem Understanding multiplicative interactions in machine learning models.
method Model-agnostic method that extends SHAP to assess multiplicative contributions.
result X-SHAP proves useful in capturing multiplicative feature importance.
New infinite-dimensional representations with bounded multiplicity found for Lie groups.
problem Finding representations with bounded multiplicity for Lie groups.
method Proving existence of infinite-dimensional irreducible representations with bounded multiplicity property.
result Infinite-dimensional irreducible representations with bounded multiplicity found for non-compact semisimple Lie groups.
Classifies compact multiplicity free quasi-Hamiltonian manifolds.
problem Classifying compact, multiplicity free, quasi-Hamiltonian manifolds.
method Symplectic reductions and Lie group analysis.
result Recover old and find new examples of these structures.
DMClusts discovers multiple clusterings from multi-view data.
problem Finding multiple meaningful and diverse clusterings from multi-view data.
method Deep matrix factorization to gradually factorize multi-view data into representational subspaces and generate one clustering per layer, enforcing diversity through proximity minimization.
result DMClusts outperforms state-of-the-art multiple clustering solutions.
Paper describes how to extend multiple conjugation quandles using maps.
problem Understanding affine extensions of multiple conjugation quandles.
method Introduces augmented MCQ Alexander pairs for affine extensions.
result Affine extensions of multiple conjugation quandles can be described by quadruples of maps.
New method constructs multiple group racks, differing from known constructions.
problem Define new invariants for spatial surfaces.
method Using a G-family of racks and a normal subgroup N of G.
result New method yields multiple group racks not derived from known methods.
Framework for generating multiple clusterings from multi-view data.
problem Challenges in finding optimal clustering criteria and handling incomplete multi-view data.
method DiMVMC framework that optimizes multiple decoder deep networks to complete data views and generate shared representations.
result DiMVMC outperforms state-of-the-art competitors in generating multiple clusterings with high diversity and quality.
Adapts manifold structure for better clustering performance.
problem Lack of consideration for local manifold structure in existing multiple kernel k-means methods.
method Adopts manifold adaptive kernel to integrate local manifold structure of kernels.
result Proposed method outperforms state-of-the-art methods.
The paper introduces new measures to quantify variability in decision tree models due to observational multiplicity.
problem The variability in decision tree models due to observational multiplicity.
method Introduces leaf regret and structural regret to decompose observational multiplicity.
result Structural regret is the primary driver of observational multiplicity, accounting for over 15 times the variability of leaf regret in some datasets.
This paper explores how random sampling and coding can speed up approximate matrix multiplication.
problem Efficiently computing large-scale matrix multiplications in distributed systems.
method Proposes two schemes: coding for recovery and random sampling for approximation.
result Investigates tradeoffs between recovery threshold and approximation error.
M3E2 neural network estimates multiple treatment effects.
problem Estimating effects of multiple treatments simultaneously.
method Multi-task learning neural network model for multiple treatments, continuous and binary.
result M3E2 outperforms baselines in synthetic datasets.
Paper defines predictive multiplicity and measures its severity in classification problems.
problem Challenges in machine learning due to competing models with conflicting predictions.
method Formal measures and integer programming tools for linear classification problems.
result Real-world datasets may admit competing models with wildly conflicting predictions.
Log-Normal Multiplicative Dynamics improves low-precision training of neural networks.
problem Training large neural networks with low precision is unstable.
method Derive a Bayesian learning rule with log-normal posterior distributions and multiplicative updates.
result LMD achieves stable and accurate training for Vision Transformer and GPT-2.
The paper introduces a new coloring invariant for spatial surfaces using a multiple group rack.
problem Distinguishing spatial surfaces embedded in the 3-sphere.
method Defined a coloring invariant using a multiple group rack.
result Introduced a new invariant to distinguish spatial surfaces.
Describes curves on surfaces with punctures and boundaries.
problem Representing multiple curves on surfaces with punctures and boundaries.
method Using geometric intersection numbers with embedded curves.
result Each multiple curve can be uniquely described.
Introduces Rashomon Capacity to measure predictive multiplicity in probabilistic classifiers.
problem Predictive multiplicity in classification models leading to unjustified decisions.
method Introduces Rashomon Capacity, a metric for probabilistic classifiers, and provides a rigorous derivation.
result Rashomon Capacity captures nuanced score variations and provides strategies for disclosing conflicting models.
Motivated by the study of a certain family of classical geometric problems we investigate the existence of multiplicative connections on proper Lie groupoids. We show that one can always deform a given connection which is only approximately multiplicative into a genuinely multiplicative connection. The proof of this fa…
New algorithm finds optimal sample complexity for pure exploration with multiple good answers.
problem Determining the optimal number of samples needed to explore multiple good answers in a bandit problem.
method Derive lower bound using game equilibrium, extend Track-and-Stop algorithm to multiple answers.
result New algorithm has asymptotic sample complexity matching the derived lower bound.
Study ruled surfaces with finite multiplicity, focusing on their curves and singularities.
problem Understanding ruled surfaces with finite multiplicity.
method Analyzing striction curves and singularities of ruled surfaces.
result Geometric meanings of invariants related to ruled surfaces.
New example of surface flow converging to a plane with multiplicity 2.
problem Constructing mean curvature flows with specific convergence properties.
method Constructing a new example of a mean curvature flow in R3. result The flow converges to a plane with multiplicity 2 as time approaches infinity.
A (quasi-)Hamiltonian manifold is called multiplicity free if all of its symplectic reductions are 0-dimensional. In this paper, we classify multiplicity free Hamiltonian actions for (twisted) loop groups or, equivalently, multiplicity free (twisted) quasi-Hamiltonian manifolds for simply connected compact Lie groups. …
We introduce the notion of a conjugation-free geometric presentation for a fundamental group of a line arrangement's complement, and we show that the fundamental groups of the following family of arrangements have a conjugation-free geometric presentation: A real arrangement L, whose graph of multiple points is a union…
Three counterexamples show higher eigenvalue multiplicities than conjectured.
problem Determining the maximum eigenvalue multiplicity for closed hyperbolic surfaces.
method Applying the twisted Selberg trace formula to induced representations of triangle groups.
result Found counterexamples with higher eigenvalue multiplicities than previously conjectured.
Polynomial algorithm for multiplication on one-hole torus skein algebra.
problem Complexity of multiplicative structure in skein algebra.
method Provided a polynomial algorithm for one-hole torus.
result Closed form formulas for multiplication of curves with low crossing number.