New criteria distinguish cause from effect in data, overcoming statistical limitations.
problem Determining causal direction from statistical dependence alone.
method Intuitive criteria based on simplicity of prediction, tested on synthetic data.
result Criteria accurately distinguish cause from effect in various scenarios.
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.
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.
Simplifies causal effect identification by pruning unnecessary variables.
problem Complex expressions from causal models can lead to unnecessary variables and computational burden.
method Graphical criteria and improved identifiability algorithm to detect and prune redundant variables.
result Improved computational efficiency and reduced bias in estimating causal effects.
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.
Cost-effective framework for eliciting and aggregating preferences.
problem Eliciting preferences efficiently under budget constraints.
method Iterative computation of cost-effective questions using Plackett-Luce model and various information criteria.
result Carefully designed information criteria lead to more accurate predictions with fewer questions.
New criteria for effective prolongations of graded Lie algebras.
problem Effective criteria for the finiteness of prolongations of graded Lie algebras.
method Explicit construction of matrices to check the rank for effective criteria.
result Results apply to geometries defined by structure algebras on contact distributions.
Investigates model selection challenges in heterogeneous treatment effect estimation.
problem Lack of validation metrics for choosing the best model in treatment effect estimation.
method Empirical investigation of different model selection criteria.
result Complex interplay between selection strategies, estimators, and data.
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.
The study evaluates different parameter selection methods for Gaussian process interpolation.
problem Choosing optimal parameters for Gaussian process interpolation.
method Empirical study using scoring rules and leave-one-out selection criteria.
result The choice of model family is often more important than the selection criterion.
The construction of efficient and effective decision trees remains a key topic in machine learning because of their simplicity and flexibility. A lot of heuristic algorithms have been proposed to construct near-optimal decision trees. ID3, C4.5 and CART are classical decision tree algorithms and the split criteria they…
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.
This paper identifies criteria for quantum confinement on non-complete Riemannian manifolds.
problem Quantum confinement on non-complete Riemannian manifolds with potential and degenerate measures.
method Identification of an effective potential Veff and formulation of criteria for quantum confinement. result Simple criteria for quantum confinement are formulated, allowing for measures with degeneracies or singularities near the metric boundary.
Selective regression allows abstention to improve fairness criteria.
problem Selective regression can exacerbate disparities between subgroups.
method Proposes new fairness criteria and two approaches to mitigate performance disparity.
result Proposed fairness criteria ensures performance improvement for every subgroup with reduced coverage.
Enhances credit card limit adjustments by considering treatment uncertainty and prediction criteria.
problem Optimal treatment selection under multitreatment scenarios.
method Proposes a comprehensive methodology incorporating conditional value-at-risk and prediction criterion for continuous outcomes.
result Significantly improved policy performance in credit card limit adjustments.
New model selects more promising patients for knee osteoarthritis trials.
problem Selecting patients likely to benefit from osteoarthritis treatments.
method Multi-classifier prediction from longitudinal data, cost-sensitive learning, feature selection.
result Model reduces by 20-25% the number of patients showing no progression.
New fairness criteria for algorithmic recourse actions that consider causal relationships.
problem Fairness of recourse actions in algorithmic classification.
method Proposes two new fairness criteria at group and individual levels, explicitly accounting for causal relationships.
result Fairness of recourse is complementary to fairness of prediction, and can be enforced by altering the classifier.
Framework for estimating treatment effects using external control data.
problem Improving efficiency in estimating average treatment effects (ATE) in hybrid trials.
method Developed a formal causal inference framework based on exchangeability assumptions and graphical criteria. Proposed estimators and efficient doubly-robust methods.
result Established finite-sample performance and demonstrated application to spinal muscular atrophy trial.
The paper shows how instrumental variables can help identify sparse causal effects in linear models.
problem Identifying sparse causal effects in linear models with limited instruments.
method Conditions and graphical criteria for identifiability, spaceIV estimator.
result Causal effects can be identified from observed distributions with sparse effects and limited instruments.
New graphical criteria for efficient covariate adjustment in non-parametric causal models.
problem Estimating population average treatment effects in observational studies using non-parametric causal graphical models.
method Developed new graphical criteria to determine efficient covariate adjustment sets for estimating treatment effects in non-parametric causal graphical models.
result Graphical criteria for efficient covariate adjustment can be applied in both linear and non-parametric causal models.
Geometric framework for consistent pairwise comparisons reduces inconsistency.
problem Inconsistency in pairwise comparisons matrices.
method Generalized pairwise comparison matrices to Lie group G, provided necessary and sufficient consistency criteria, and proposed geometric interpretation. result Found a geometric interpretation and basic criteria for finding nearest consistent matrices.
Active learning has shown to reduce the number of experiments needed to obtain high-confidence drug-target predictions. However, in order to actually save experiments using active learning, it is crucial to have a method to evaluate the quality of the current prediction and decide when to stop the experimentation proce…
Paper proposes a unified sparsity-based framework for evaluating algorithmic fairness.
problem Ensuring fairness in machine learning across diverse domains.
method Unified sparsity-based framework for evaluating fairness.
result Demonstrates broad applicability and effectiveness of the framework.
New algorithms improve experimental design efficiency and approximation quality.
problem Finding optimal subset of vectors for expensive measurements.
method Bayesian experimental design using determinantal point processes.
result Developed efficient algorithms for optimal design under multiple criteria.
Study reveals finite-size effects and sensitivity to random numbers in Levy-Levy-Solomon model.
problem Finite-size effects and sensitivity to random numbers in Levy-Levy-Solomon model.
method Simulations and analysis of Levy-Levy-Solomon model with different random number generators and stopping criteria.
result Low-quality pseudo random number generators significantly impact simulation results.
Study of flat Legendre transforms on complex projective plane.
problem Characterizing homogeneous foliations with flat dual web.
method Effective criteria for flatness of dual d-web, explicit examples, classification results. result Up to automorphism of P2, there are 11 homogeneous foliations of degree 3 with flat dual web. Two new criteria help understand the advantage of deep neural networks.
problem Understanding the advantage of deepening neural networks.
method Proposed two new criteria to evaluate the expressivity of functions computable by deep neural networks.
result Increasing layers is more effective than increasing units in improving the expressivity of deep neural networks.
New method speeds up model selection for complex scientific tasks.
problem Exhaustive model selection is computationally infeasible for large model spaces.
method Branch-and-bound algorithm with non-monotonic criteria.
result Guaranteed identification of optimal models with significant computational speedups.
We investigate modular embeddings for semi-arithmetic Fuchsian groups. First we prove some purely algebro-geometric or even topological criteria for a regular map from a smooth complex curve to a quaternionic Shimura variety to be covered by a modular embedding. Then we set up an adelic formalism for modular embeddings…
Optimal experiments tighten causal effect bounds efficiently.
problem Selecting experiments to tighten causal effect bounds from observational data.
method Formalized as max-potency problem, NP-hard. Polynomial-programming framework with graphical pruning criteria.
result Pruning criteria reduce search space significantly, enabling efficient experiment selection.
A novel MQCAL method selects high-value samples via weighted rank aggregation.
problem Lack of scalable and general integration criteria for MQCAL methods.
method Proposes a novel MQCAL method using weighted rank aggregation.
result Achieves superior results compared to state-of-the-art MQCALs.
Inference-aware meta-alignment of LLMs reduces computational cost.
problem Aligning LLMs to diverse human preferences is challenging due to conflicting criteria.
method IAMA trains a base model to be aligned to multiple tasks via different inference-time alignment algorithms, using non-linear GRPO for optimization.
result IAMA enables effective alignment of LLMs to multiple criteria with limited computational budget.
The paper tackles causal rule discovery from observational data.
problem Challenges in inferring causal effects from observational data due to confounding factors and high variance.
method Measures causal effect from observational data, providing graphical criteria and a conservative estimator.
result Proposes an efficient algorithm that maximises the estimator and discovers meaningful causal rules.
Causal trees struggle with accuracy in estimating treatment effects.
problem Estimating heterogeneous causal treatment effects using recursive decision trees.
method Adaptive recursive partitioning with and without sample splitting.
result Causal tree estimators can have uniform-norm errors decreasing more slowly than any power of the sample size.
Estimating the dependences between random variables, and ranking them accordingly, is a prevalent problem in machine learning. Pursuing frequentist and information-theoretic approaches, we first show that the p-value and the mutual information can fail even in simplistic situations. We then propose two conditions for r…
We extend causal calculus to models with cycles, latent confounders, and selection bias.
problem Causal reasoning in the presence of cycles, latent confounders, and selection bias.
method Prove rules of causal calculus for i/o structural causal models, generalize adjustment criteria, and extend ID algorithm.
result Enable causal reasoning in complex models with cycles, latent confounders, and selection bias.
New framework converts fairness criteria to social welfare maximization.
problem Interpreting fairness criteria in terms of societal welfare and distribution.
method Converts constrained loss minimization to social welfare maximization problem.
result Predictions and fairness constraints shape societal welfare and distribution.
99% of papers use real-world data, but only 3% provide formal comparisons.
problem Lack of complete argumentative chains in demonstrating algorithmic effectiveness in machine learning papers.
method Systematic review of NeurIPS papers from 2017, assessing completeness of argumentative steps.
result Only 3% of papers provide formal comparisons, indicating incomplete argumentative chains.
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.
New method prevents classifiers from relying on spurious correlations.
problem Group invariant learning fails to prevent classifiers from depending on spurious correlations.
method Statistical independence tests to construct groups and reweight samples by group label proportion.
result New method significantly outperforms existing group invariant learning methods in generalizing to spurious correlation shifts.
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.
We provide notions of numerical effectiveness and numerical flatness for Higgs vector bundles on compact Kähler manifolds in terms of fibre metrics. We prove several properties of bundles satisfying such conditions and in particular we show that numerically flat Higgs bundles have vanishing Chern classes, and that they…
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.
Improved pre-trained embeddings through effective entropy maximization.
problem Developing high-quality pre-trained embeddings for future tasks.
method E2MC criterion defined in terms of low-dimensional constraints.
result Significant improvement in downstream performance.
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.
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.