Mathematical approach assesses human resource competences accurately.
problem Accurate assessment and representation of human resource competences.
method Detailed quantification scheme and mathematical approach.
result Flexible tools for optimal job assignment and recruitment.
Paper improves competence estimation of machine learning models.
problem Estimating machine learning performance in real-world scenarios.
method ALICE Score: a pointwise competence estimator considering distributional, data, and model uncertainty.
result Significant improvements in competence prediction over state-of-the-art methods.
Paper evaluates competence measures for DRS systems.
problem Choosing the best measure to quantify competence in DRS systems is challenging.
method Reviewed and adapted eight competence measures for regression problems, compared them on 15 datasets, and evaluated three DRS systems.
result DRS systems outperform individual regressors and static systems, but competence measure choice depends on the problem.
Proposes KNORA-B and KNORA-BI for DES, improving classification performance.
problem Selecting locally competent classifiers for new test samples.
method KNORA-B and KNORA-BI use nearest neighbors to reduce region of competence, maintaining at least one sample from each class.
result KNORA-BI outperforms state-of-the-art techniques on imbalance datasets.
SSPN uses deep learning to estimate risk scores in survival analysis with competing risks.
problem Nonidentifiability of cause-specific survival curves in competing risk survival analysis.
method Siamese Survival Prognosis Network (SSPN) that avoids estimating cause-specific survival curves and optimizes an approximation to the C-discrimination index.
result SSPN estimates pairwise concordant time-dependent risks, improving risk scoring in survival analysis with competing risks.
Comprisk simplifies competing-risks analysis in Python.
problem Analyzing medical time-to-event data with competing risks.
method A scikit-learn-compatible toolkit for competing-risks survival analysis.
result Comprisk provides a unified API for various competing-risks methods.
We developed a framework to benchmark and compare competing risks survival models.
problem Limited systematic evaluation and adoption of competing risks survival models.
method Open-source reproducible benchmarking framework for comprehensive comparison.
result Systematic comparison across multiple datasets on various performance aspects.
SurvivalBoost improves prediction of event times in competing risks scenarios.
problem Predicting event times in scenarios with multiple possible outcomes.
method Developed a strictly proper censoring-adjusted scoring rule for stochastic optimization of competing risks.
result SurvivalBoost outperforms 12 state-of-the-art models across various metrics.
This paper uses neural networks to accurately model competing risks in survival analysis.
problem Ignoring competing risks leads to biased survival estimation in machine learning models.
method The paper introduces constrained monotonic neural networks to model each competing survival distribution.
result The method ensures exact likelihood maximization with reduced computational cost.
Competency questions help experts select best clustering for energy data.
problem Ad hoc and subjective selection of clustering structures by domain experts.
method Formalize expert knowledge and requirements with competency questions.
result Competency questions improve reproducibility and evaluation of clustering applications.
Study examines HTE estimation from time-to-event data with competing events.
problem Estimating HTEs from time-to-event data with competing events.
method Outcome modeling approach using plug-in estimators for potential outcomes.
result Competing events introduce new challenges for HTE estimation.
META-DES.H selects competent classifiers using meta-learning and dynamic weighting.
problem Selecting competent classifiers in dynamic ensemble selection.
method META-DES framework using meta-learning and dynamic weighting.
result Improvements in recognition accuracy on 30 datasets.
HACSurv models dependencies between competing risks and censoring for improved survival analysis.
problem Inaccurate survival predictions due to ignoring dependencies between competing risks and censoring.
method HACSurv uses hierarchical Archimedean copulas to model dependencies and cause-specific survival functions.
result HACSurv improves accuracy in survival predictions and captures complex risk interactions.
PyDTS analyzes survival data with discrete intervals and competing risks.
problem Discrete-time survival analysis with competing risks and optional penalization.
method Regularized estimation methods, model evaluation metrics, variable screening tools, and simulation module.
result Supports research and development in discrete-time survival analysis.
Article models firm interactions on market with taxation.
problem Analyzing firm interactions on market with taxation.
method Differential equations and Lotka-Volterra model applied to non-competing and competing firms.
result Algorithm for solving competing firms' interaction in taxation.
New method for discrete-time survival analysis with competing risks.
problem Discrete failure time data in survival analysis.
method Proposes a new estimation procedure for discrete-time survival analysis with competing events.
result Offers advantages over existing procedures and integrates regularized regression methods.
Meta-DES uses meta-learning to dynamically select competent classifiers for ensemble learning.
problem Dynamic selection of classifiers based on limited training data.
method Meta-learning approach to estimate competence of classifiers using multiple meta-features.
result Meta-DES significantly improves classification accuracy compared to existing techniques.
LDR models survival with competing risks using nonparametric Bayesian approach.
problem Survival analysis with competing risks and non-monotonic covariate effects.
method Lomax delegate racing, data augmentation, Gibbs sampler, stochastic gradient descent.
result Distinguished performance in survival analysis with competing risks.
The paper estimates personalized treatment effects in medical settings with competing risks.
problem Estimating treatment effectiveness for specific events in the presence of alternative event types.
method Meta-learners combining Cox regression or random survival forests for risk modeling and elastic net regression or random forests for direct CATE modeling.
result Compared meta-learners in multiple simulation settings, providing practical guidance for model selection.
Improved dynamic classifier selection by refining regions of competence.
problem Limited performance of dynamic selection systems due to noisy regions.
method Integrates a filter and an adaptive distance to enhance regions of competence.
result Significant increase in recognition performance and decrease in computational cost.
CoPhy-PGNN tackles competing PG losses in neural networks for solving eigenvalue problems.
problem Solving eigenvalue problems with competing physics-guided loss functions.
method Learning generalizable solutions using a novel approach to handle competing PG losses.
result Demonstrates the effectiveness of the approach in quantum mechanics and electromagnetic propagation.
Paper introduces Decentralized Non-stationary Competing Bandits ( exttt{DNCB}) for dynamic matching markets.
problem Understanding dynamic two-sided matching markets with competing agents.
method Proposes a decentralized asynchronous learning algorithm ( exttt{DNCB}) for non-stationary environments.
result Obtains sub-linear (logarithmic) regret of exttt{DNCB} in dynamic settings.
SSH-Net: A Deep Neural Network for Predicting Failure Time Distribution Functions under Competing Risks with GPU Data
problem Predicting failure time distribution functions under competing risks
method Structured Segmented Hazard Deep Neural Network (SSH-Net)
result Prediction accuracy validated through simulation studies and GPU data
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.
Develops new methods to estimate treatment effects in survival data with competing risks.
problem Estimating treatment effects in survival data with competing risks.
method Censoring Unbiased Transformations (CUTs) for survival outcomes with and without competing risks.
result Consistent estimates of heterogeneous cumulative incidence effects and total effects using HTE learners.
Random forest models predict CLABSI risk in hospital admissions, with static models performing similarly to dynamic ones.
problem Predicting CLABSI risk in hospital admissions using EHR data with competing risks.
method Comparison of static and dynamic random forest models for binary, multinomial, survival, and competing risks outcomes.
result Static and dynamic random forest models perform similarly in predicting CLABSI risk, with multinomial models having the lowest computation times.
SurvTRACE uses transformers to analyze survival times with competing events.
problem Analyzing survival times with multiple competing events and confounders.
method Transformer-based model for survival analysis, handling competing events and confounders.
result SurvTRACE outperforms existing methods in multi-event scenarios.
Enhances DES by removing noise and defining regions more accurately.
problem Incompetent classifier selection in noisy regions and true indecision regions.
method FIRE-DES++ uses equal number of samples from each class and removes noise to define regions more accurately.
result FIRE-DES++ outperforms FIRE-DES and state-of-the-art DES frameworks.
New method estimates survival risks without strong proportional hazard assumptions.
problem Time-to-event prediction with censored data and competing risks.
method Jointly learns deep nonlinear representations for fully parametric survival regression.
result Demonstrates benefits in real-world datasets with different censoring levels.
The recent trend for acquiring big data assumes that possessing quantitatively more and qualitatively finer data necessarily provides an advantage that may be critical in competitive situations. Using a model complex adaptive system where agents compete for a limited resource using information coarse-grained to differe…
ICP separates and competes feature representations to learn diverse information.
problem Learning representations with diversified information.
method Information Competing Process (ICP) separates representations into parts with different mutual information constraints, forcing them to learn independently in a competitive environment.
result ICP facilitates obtaining diversified representations with rich information.
A competing market model with a polyvariant profit function that assumes "zeitnot" stock behavior of clients is formulated within the banking portfolio medium and then analyzed from the perspective of devising optimal strategies. An associated Markov process method for finding an optimal choice strategy for monovariant…
The Surprise index assesses autonomous systems' competency in uncertain environments.
problem Evaluating competency of autonomous systems in dynamic, uncertain environments.
method Surprise index, a measure that quantifies system performance based on available data.
result The Surprise index can be computed for dynamic systems with Gaussian marginal distributions.
SurvLatent ODE predicts VTE risk for cancer patients, outperforming current methods.
problem Predicting clinical outcomes from irregularly sampled EHR data with competing events.
method Neural ODE-based Recurrent Neural Networks (ODE-RNN) for flexible survival time estimation.
result SurvLatent ODE outperforms Khorana Risk scores for VTE risk prediction.
Study shows competition feedback can make ML predictors biased towards specific user groups.
problem How competition affects machine learning predictors and user prediction quality.
method Flexible model of competing ML predictors, empirical and mathematical analysis.
result Competition causes predictors to specialize for specific sub-populations at the cost of general performance.
Develops regression trees for estimating cumulative incidence curves in competing risks.
problem Estimating cumulative incidence functions in competing risks settings.
method Uses augmented estimators of the Brier score risk to build and prune regression trees.
result Demonstrates the utility of the proposed methods through simulation studies and real data.
Dynamic ensemble selection (DES) techniques work by estimating the level of competence of each classifier from a pool of classifiers. Only the most competent ones are selected to classify a given test sample. Hence, the key issue in DES is the criterion used to estimate the level of competence of the classifiers in pre…
Prototype selection improves DS techniques' accuracy and reduces computational cost.
problem Improving the performance of dynamic selection techniques.
method Prototype selection techniques that edit validation data to remove noise and redundant instances.
result Improves DS techniques' classification accuracy and reduces computational cost.
Study analyzes shunt thrombosis recurrence in dialysis patients, adjusting for competing risks.
problem Analyzing shunt thrombosis recurrence in dialysis patients with competing risks.
method Formulated under recurrent events data framework, applied IPCW for adjusted inference, used bootstrap for further inference.
result Validated large sample properties and finite-sample performances of proposed methods.
Model predicts market dynamics of competing technologies.
problem Understanding market dynamics and technology competition.
method Modified Replicator Dynamics model with external influences.
result Shows how external influences affect market outcomes.
The study proposes a framework to accept OOD data based on competence scores.
problem Silent failures in Domain Generalization where models reject OOD data without proper justification.
method A learning to reject framework using proxy incompetence scores to predict trustworthiness.
result Increasing incompetence scores are predictive of reduced accuracy, but not always favorable for accuracy/rejection trade-off.
Develops confidence intervals for Fine-Gray model with high-dimensional covariates.
problem Estimating regression coefficients in Fine-Gray model with many covariates and censoring.
method One-step bias-correction for regularized estimation, theoretical framework for partial likelihood, concentration results for time-dependent processes.
result Established confidence intervals for Fine-Gray model with high-dimensional covariates.
The paper explains how language models acquire complex skills through scaling laws and statistical analysis.
problem Understanding how language models acquire new skills as their size and training data increase.
method Statistical framework and mathematical analysis of scaling laws.
result Language models can learn complex skills efficiently due to a strong inductive bias.
A new algorithm for competing agents in a two-sided market setting.
problem Decentralized competition between agents in a two-sided market with unknown valuations.
method UCB-D3 algorithm for UCB with Decentralized Dominant-arm Deletion.
result UCB-D3 is order optimal and achieves a new regret lower bound.
We study an economic model where agents trade a variety of products by using one of three competing rules: "need", "greed" and "noise". We find that the optimal strategy for any agent depends on both product composition in the overall market and composition of strategies in the market. In particular, a strategy that do…
The paper explores variations of ensemble methods for cancer survival prediction.
problem Predicting survival functions in cancer research with competing risks and right censoring.
method The authors implement and compare different variations of adaboost for survival prediction.
result The variations of adaboost show improved performance in terms of run time and error metrics.
We study the problem of online learning with a notion of regret defined with respect to a set of strategies. We develop tools for analyzing the minimax rates and for deriving regret-minimization algorithms in this scenario. While the standard methods for minimizing the usual notion of regret fail, through our analysis …
This paper addresses the problem of estimating, in the presence of random censoring as well as competing risks, the extreme value index of the (sub)-distribution function associated to one particular cause, in the heavy-tail case. Asymptotic normality of the proposed estimator (which has the form of an Aalen-Johansen i…