activity
20112025
most citedBipartite ranking algorithm for classification and survival analysis

1 citations · 1 across the 8 of their papers we have counts for

collaborators
Showing cs.LGShow all

6 papers · 1 filter

cs.LG2025

Practical machine learning is learning on small samples

Marina Sapir

Based on limited observations, machine learning discerns a dependence which is expected to hold in the future. What makes it possible? Statistical learning theory imagines indefini…

cs.LG2020

Logic of Machine Learning

Marina Sapir

The main question is: why and how can we ever predict based on a finite sample? The question is not answered by statistical learning theory. Here, I suggest that prediction require…

cs.LG2018

Learnable: Theory vs Applications

Marina Sapir

Two different views on machine learning problem: Applied learning (machine learning with business applications) and Agnostic PAC learning are formalized and compared here. I show t…

cs.LG2011★ 1 cited

Bipartite ranking algorithm for classification and survival analysis

Marina Sapir

Unsupervised aggregation of independently built univariate predictors is explored as an alternative regularization approach for noisy, sparse datasets. Bipartite ranking algorithm…

cs.LG2011

Bias Plus Variance Decomposition for Survival Analysis Problems

Marina Sapir

Bias - variance decomposition of the expected error defined for regression and classification problems is an important tool to study and compare different algorithms, to find the b…

cs.LG2011

Ensemble Risk Modeling Method for Robust Learning on Scarce Data

Marina Sapir

In medical risk modeling, typical data are "scarce": they have relatively small number of training instances (N), censoring, and high dimensionality (M). We show that the problem m…