Kernel clustering methods have biases due to density, which can be corrected.
problem Density biases in kernel clustering methods.
method Theoretical analysis and proposed solutions to density biases.
result Density biases can be corrected by density equalization using locally adaptive weights or kernels.
CB-GLNs learn video data's complex dependencies via graph representation.
problem Capturing complex dependency structures in sequential data like videos.
method Represent video data as a graph, find compositional dependencies via graph-cut and message passing.
result CB-GLNs efficiently learn video data's semantic compositional structure.
We propose a new method to model multi-way similarities into hypergraphs for clustering.
problem Clustering real-valued data using hypergraphs with multi-way similarities.
method Formulate multi-way similarities using kernel functions, establish connections to hypergraph cut, and develop a fast spectral clustering algorithm.
result Our method outperforms existing graph and heuristic modeling methods in clustering performance.
In this paper, we study statistical classification accuracy of two different Markov field environments for pixelwise image segmentation, considering the labels of the image as hidden states and solving the estimation of such labels as a solution of the MAP equation. The emission distribution is assumed the same in all …
We propose and analyze a constrained level-set method for semi-automatic image segmentation. Our level-set model with constraints on the level-set function enables us to specify which parts of the image lie inside respectively outside the segmented objects. Such a-priori information can be expressed in terms of upper a…
This paper establishes the consistency of a family of graph-cut-based algorithms for clustering of data clouds. We consider point clouds obtained as samples of a ground-truth measure. We investigate approaches to clustering based on minimizing objective functionals defined on proximity graphs of the given sample. Our f…
Min-cut clustering, based on minimizing one of two heuristic cost-functions proposed by Shi and Malik, has spawned tremendous research, both analytic and algorithmic, in the graph partitioning and image segmentation communities over the last decade. It is however unclear if these heuristics can be derived from a more g…
Study improves infant cry-based asphyxia diagnosis using transfer learning.
problem Improving accuracy of diagnosing perinatal asphyxia in newborns.
method Neural transfer learning from adult speech to infant cries.
result Transfer learning models are resilient to noise and signal loss.
Criteria ensure manifold triangulation without differentiable structure.
problem Ensuring a manifold can be triangulated without differentiable structure.
method Local coordinate chart criteria for homeomorphism verification.
result Criteria guarantee triangulation of manifolds without Delaunay property.
We give some general criteria of being a homeomorphism for continuous mappings of topological manifolds, as well as criteria of being a diffeomorphism for smooth mappings of smooth manifolds. As an illustration, we apply these criteria to the problems arising in two- and three-dimensional grid generation.
The study reveals flaws in pruning criteria and proposes a new assumption for better filter selection.
problem Flaws in existing pruning criteria for CNNs.
method Empirical experiments and Convolutional Weight Distribution Assumption.
result The Convolutional Weight Distribution Assumption improves filter selection in pruning.
New method finds optimal hyperparameters for multiple tasks and criteria.
problem Finding optimal hyperparameters for multiple tasks and criteria.
method Multi-Task Multi Criteria (MTMC) method that provides Pareto-optimal solutions.
result The method selects optimal hyperparameters based on given criteria significance coefficients.
Improved recommendations using latent embeddings from user reviews.
problem Lack of consideration for latent embeddings in multi-criteria recommender systems.
method Utilized variational autoencoders to map user reviews into latent embeddings, which are then compressed into discrete vectors for multi-criteria recommendation.
result The proposed method significantly outperforms baselines across various datasets and evaluation measures.
Max-Cut decision tree improves classification accuracy and reduces computation time.
problem Improving decision tree accuracy and efficiency for complex classification tasks.
method Alternative splitting metric (max cut) and PCA-based feature selection at each node.
result 49% improvement in accuracy with 94% reduction in CPU time on CIFAR-100 data.
New criteria for Heegaard splittings ensure strong irreducibility and finite Goeritz groups.
problem Determining strong irreducibility and finite Goeritz groups of Heegaard splittings.
method Two diagrammatic criteria for Heegaard splittings, accepting arbitrary disk systems.
result Criteria ensure strong irreducibility and finite Goeritz groups for Heegaard splittings.
Novel framework provides statistical significance for image segmentation results.
problem Evaluating the reliability of individual image segmentation results.
method Selective inference to account for segmentation bias in p-value computation.
result Valid p-values for segmentation results, accounting for bias.
Develops scenario theory for multi-criteria decision making.
problem Need for robustness assessment with multiple criteria and datasets.
method Collectively treats risks associated with individual criteria for multi-criteria decision problems.
result More accurate robustness certificates and sharper quantification of simultaneous criterion satisfaction.
We consider the problem of identifying patterns in a data set that exhibit anomalous behavior, often referred to as anomaly detection. In most anomaly detection algorithms, the dissimilarity between data samples is calculated by a single criterion, such as Euclidean distance. However, in many cases there may not exist …
The paper evaluates criteria for selecting cryptocurrencies based on historical data.
problem High risk of cryptocurrencies due to volatility.
method Characterized returns and risks using historical data in short time windows (7 and 15 days). Analyzed the importance of criteria using various methods.
result Importance of criteria for selecting cryptocurrencies is analyzed and evaluated.
Fairness criteria may harm over time, contrary to conventional wisdom.
problem The impact of fairness criteria on long-term population well-being.
method Study of fairness criteria in a one-step feedback model, analyzing long-term outcomes.
result Static fairness criteria do not necessarily promote improvement over time and may cause harm.
Study compares different complexity criteria for free boundary minimal surfaces.
problem Comparing different complexity criteria for free boundary minimal surfaces.
method Global theory of free boundary minimal surfaces.
result Provides a complete picture of how area, topology, and Morse index compare.
When sufficient labeled data are available, classical criteria based on Receiver Operating Characteristic (ROC) or Precision-Recall (PR) curves can be used to compare the performance of un-supervised anomaly detection algorithms. However , in many situations, few or no data are labeled. This calls for alternative crite…
New approach uses causal reasoning to address fairness issues.
problem Fairness criteria based on observational data are limited and unreliable.
method Shifts focus from observational criteria to causal reasoning.
result Formalizes why and when observational criteria fail.
The paper analyzes performance criteria for competing fund managers in Ito-diffusion markets.
problem Analyzing performance of competing fund managers in Ito-diffusion markets.
method Developed forward relative performance criteria and forward Nash equilibrium for passive and competitive cases.
result Extended performance criteria for investment problems in Ito-diffusion markets.
Paper defines numerical criteria to test handlebody link irreducibility.
problem Determining the irreducibility of handlebody links.
method A set of numerical criteria to test handlebody links for irreducibility.
result Effective method to recognize irreducibility of handlebody knots and most handlebody links.
Turnpike results for risk tolerance in incomplete markets under time-monotone criteria.
problem Turnpike results for risk tolerance in incomplete markets under time-monotone criteria.
method Time-monotone forward performance criteria, analysis of limits, dependence on measure support.
result Temporal and spatial limits do not coincide and depend on measure support.
We shall give useful criteria of lips, beaks and swallowtail singularities of smooth map from the plane into the plane. As an application of criteria, we will discuss the singularities of Cauchy problem of single conservation law.
A new method for multi-criteria recommender systems using graph attention networks.
problem Lack of nuanced relationships between users and items based on specific criteria.
method MDGAT, a multi-edge bipartite graph with dual attention networks and contrastive learning.
result MDGAT achieves higher accuracy in predicting item ratings compared to baseline methods.
New framework for resilient bi-criteria optimization under noisy feedback.
problem Bi-criteria combinatorial optimization with noisy function evaluations.
method Introducing (α,β,δ,extttN)-resilience and developing a black-box framework. result Achieves sublinear regret and constraint violation for bi-criteria bandit problems.
New algorithms minimize risk in MNL bandits, achieving near-optimal performance.
problem Minimizing risk in multi-armed bandit problems.
method Designing algorithms for various risk criteria (e.g., CVaR, Sharpe ratio, entropy risk).
result Near-optimal regret for the designed algorithms.
A game-theoretic approach to multi-criteria ranking from ordinal data.
problem Ranking objects from ordinal data with multiple criteria.
method Generalizing von Neumann winner to multi-criteria setting using Blackwell's approachability.
result The Blackwell winner can be computed as a convex optimization problem and achieves near-optimal sample complexity.
Criteria found for graph drawings on surfaces.
problem Graph drawings on surfaces.
method Criteria for integer and modulo 2 embeddability.
result Found criteria for graph drawings on surfaces.
Proposes a multi-criteria AutoML system to optimize additional criteria like fairness and interpretability.
problem Current AutoML systems limit model choices and preprocessing steps, ignoring secondary criteria.
method Optimizes additional criteria directly to guide the search for optimal machine learning pipelines.
result Demonstrates the need and usefulness of a multi-criteria AutoML system.
Introduces new performance criteria for investment under distorted probabilities.
problem Reconciling time-consistent performance with probability distortions.
method Two definitions of forward rank-dependent criteria, equivalence established; characterization of viable probability distortion processes.
result Characterization of optimal wealth process and new distorted measure.
The paper introduces risk consistency properties for credit ratings.
problem Promoting prudent investment decisions in credit ratings.
method Introducing and studying risk consistency properties in the framework of Choquet rating criteria.
result Characterization of Choquet risk measures and rating criteria satisfying risk consistency properties.
Many machine learning frameworks, such as resource-allocating networks, kernel-based methods, Gaussian processes, and radial-basis-function networks, require a sparsification scheme in order to address the online learning paradigm. For this purpose, several online sparsification criteria have been proposed to restrict …
Study tackles criterion collapse in learning criteria, showing conditions for loss minimization.
problem Criterion collapse in optimization, focusing on error probability minimizers.
method Analyzes various learning criteria, including DRO, OCE risks, and non-monotonic criteria.
result Non-monotonic criteria can avoid collapse, while monotonic ones cannot.
The paper characterizes when numerical criteria for PDE solvability fail and provides effective criteria for existence.
problem Characterizing when numerical criteria for PDE solvability fail.
method Finite number of subvarieties violating Nakai type criterion, and their rigidity.
result Finite number of subvarieties violating the Nakai type criterion, and these subvarieties are rigid.
Study proves conditions for geometric flow blowup on surfaces.
problem Conditions for geometric flow blowup on surfaces.
method Splitting of geometric flows, new compactness theorem, and blow-up criteria.
result Proves blow-up criteria for harmonic Ricci flow and spinor flow on surfaces.
Managing risk in dynamic decision problems is of cardinal importance in many fields such as finance and process control. The most common approach to defining risk is through various variance related criteria such as the Sharpe Ratio or the standard deviation adjusted reward. It is known that optimizing many of the vari…
Simple criteria for codimension two surface singularities.
problem Identifying singularities in surfaces of codimension two.
method Provided criteria for singularities in surfaces of codimension less than or equal to two.
result Conditions for codimension two singularities in ruled surfaces and center maps.
SPX optimizes multiple graph drawing metrics for better readability.
problem Graph drawing algorithms often optimize one metric at a time, leading to suboptimal layouts.
method Introduces Stress-Plus-X (SPX) framework that optimizes stress, crossings, angles, and upwardness simultaneously.
result SPX achieves results close to state-of-the-art algorithms that optimize metrics individually.
This paper evaluates criteria for a versatile classifier.
problem Choosing an optimal classifier for all problems.
method Data analysis and scoring of six popular classifiers.
result Random forests are the best generalist classifiers.
Developed criteria for selecting non-normalized models using NCE and score matching.
problem No information criteria for non-normalized models estimated by NCE or score matching.
method Developed information criteria based on discrepancy measures for non-normalized models estimated by NCE or score matching.
result The proposed criteria enable selection of the appropriate non-normalized model in a data-driven manner.
Study finite-type solutions of elliptic sinh-Gordon equation with Durham boundary conditions.
problem Finite-type solutions of elliptic sinh-Gordon equation with Durham boundary conditions.
method Determine rationality criteria for Durham conditions and analyze spectral curve properties.
result Rationality criteria are sufficient for finite-type solutions with complementary boundary conditions.
We give criteria for Morin singularities into higher dimensions. As an application, we study the number of A-isotopy classes of Morin singularities.
New criteria for splitting definite 4-manifolds with cyclic groups.
problem Definite 4-manifolds with infinite cyclic fundamental groups.
method Two new criteria extending previous results, equivalent to algebraic representation conditions.
result Equivalence to algebraic representation conditions and production of new forms.
A government has to finance a risk for its population. It shares the charges among the population with a fixed scale based on economic criteria. Various organisms have to collect and to redistribute fairly the subsidies. Under these conditions, when the size of the organisms is varied, the distribution's laws of the cr…