Researcher profile

Ricardo Fraiman

Ricardo Fraiman contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 15 - UnverifiedVerification L1Unclaimed author
3works
0followers
4topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

3 published item(s)

preprint2026arXiv

Imbalanced Classification under Capacity Constraints

In many classification settings, the class of primary interest is underrepresented, leading to imbalanced data problems that arise in applications such as rare disease detection and fraud identification. In these contexts, identifying a potential positive instance typically triggers costly follow-up actions, such as medical imaging or detailed transaction inspection, which are subject to limited operational capacity. Motivated by this setting, we consider classification problems where data may arrive sequentially and decisions must be made under constraints on the number of instances that can be selected for further analysis. We propose a classification framework that explicitly controls the rate of positive predictions, enforcing a user-defined bound on the proportion of observations classified as belonging to the minority class while maximizing detection performance. The approach can be implemented using standard learning methods and naturally extends to online settings, where decisions are taken in real time. We show that incorporating capacity constraints leads to substantial improvements over classical approaches, including resampling techniques such as SMOTE, which do not directly control the selection rate.

preprint2022arXiv

Application of the Cramér-Wold theorem to testing for invariance under group actions

We address the problem of testing for the invariance of a probability measure under the action of a group of linear transformations. We propose a procedure based on consideration of one-dimensional projections, justified using a variant of the Cramér-Wold theorem. Our test procedure is powerful, computationally efficient, and dimension-independent, extending even to the case of infinite-dimensional spaces (multivariate functional data). It includes, as special cases, tests for exchangeability and sign-invariant exchangeability. We compare our procedure with some previous proposals in these cases, in a small simulation study. The paper concludes with two real-data examples.

preprint2022arXiv

Estimation of surface area

We study the problem of estimating the surface area of the boundary $\partial S$ of a sufficiently smooth set $S\subset\mathbb{R}^d$ when the available information is only a finite subset $\X\subset S$. We propose two estimators. The first makes use of the Devroye--Wise support estimator and is based on Crofton's formula, which, roughly speaking, states that the $(d-1)$-dimensional surface area of a smooth enough set is the mean number of intersections of randomly chosen lines. For that purpose, we propose an estimator of the number of intersections of such lines with support based on the Devroye--Wise support estimators. The second surface area estimator makes use of the $α$-convex hull of $\X$, which is denoted by $C_α(\X)$. More precisely, it is the $(d-1)$-dimensional surface area of $C_α(\X)$, as denoted by $|C_α(\X)|_{d-1}$, which is proven to converge to the $(d-1)$-dimensional surface area of $\partial S$. Moreover, $|C_α(\X)|_{d-1}$ can be computed using Crofton's formula. Our results depend on the Hausdorff distance between $S$ and $\X$ for the Devroye--Wise estimator, and the Hausdorff distance between $\partial S$ and $\partial C_α(\X)$ for the second estimator.