We characterize the class of exchangeable feature allocations assigning probability to a feature allocation of individuals, displaying features with counts for these features. Each element of this class is parametrized by a countable matrix …
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “individual consistency”
We address the problem of estimating the parameters of a time-homogeneous Markov chain given only noisy, aggregate data. This arises when a population of individuals behave independently according to a Markov chain, but individual sample paths cannot be observed due to limitations of the observation process or the need…
New approach for estimating individual treatment effects in low compliance settings.
problem Estimating individual treatment effects in scenarios with low compliance.
method Proposes a new approach using Structural Causal Model and do-calculus to estimate Individual Prescription Effect (IPE) with asymptotic variance guarantees.
result Consistently improves state-of-the-art in low compliance settings.
Paper proves identifiability and consistency of hub model for network inference.
problem Identifying network structure from group behavior.
method Hub model and variants, proving identifiability and consistency under mild conditions.
result Identifiability and estimation consistency of hub model and its variants proved.
This work develops a model to distinguish network and covariate information.
problem Identifying unique network and covariate information.
method Low-rank model with two-step estimation: spectral method followed by refinement.
result The method accurately recovers joint and individual components.
This paper presents a dynamic model to study the impact on the economic outcomes in different societies during the Malthusian Era of individualism (time spent working alone) and collectivism (complementary time spent working with others). The model is driven by opposing forces: a greater degree of collectivism provides…
Algorithm learns similarity metrics for individual fairness.
problem Difficulty in learning similarity metrics for individual fairness.
method Gradient descent and Bradley-Terry model for pairwise comparisons.
result Algorithm converges to ground truth metric for individual fairness.
We give a microscopic representation of the stock-market in which the microscopic agents are the individual traders and their capital. Their basic dynamics consists in the auto-catalysis of the individual capital and in the global competition/cooperation between the agents mediated by the total wealth invested in the s…
Study finds AUC is most consistent across different prevalence in binary classification.
problem Consistency of model evaluation metrics across varying prevalence in binary classification.
method Analysis of 156 data scenarios with 18 metrics, 5 models, and a random guess model.
result AUC has the smallest variance in evaluating individual models and ranking of models.
We propose nonparametric methods for individual calibration in regression models.
problem Uncertainty quantification and individual calibration for regression models.
method Nonparametric methods agnostic of the underlying model, combining nonparametric and covering number arguments.
result Established matching upper and lower bounds for calibration error.
Framework generates precise synthetic populations for scalable modeling.
problem Generating accurate synthetic populations without personal data.
method Constraint-programming framework encoding aggregated statistics and structural relations.
result Exact control of demographic profiles without requiring microdata.
We find the optimal investment strategy to minimize the expected time that an individual's wealth stays below zero, the so-called {\it occupation time}. The individual consumes at a constant rate and invests in a Black-Scholes financial market consisting of one riskless and one risky asset, with the risky asset's price…
Currently, pension providers are running into trouble mainly due to the ultra-low interest rates and the guarantees associated to some pension benefits. With the aim of reducing the pension volatility and providing adequate pension levels with no guarantees, we carry out mathematical analysis of a new pension design in…
Unified approach to aggregating models and preferences.
problem Consistent aggregation of models and preferences.
method Formal definition and weighted averaging of models and preferences.
result All rational aggregation rules are weighted averages of highest-ranked models/experts.
Interpreting predictions from tree ensemble methods such as gradient boosting machines and random forests is important, yet feature attribution for trees is often heuristic and not individualized for each prediction. Here we show that popular feature attribution methods are inconsistent, meaning they can lower a featur…
Matrix estimation improves individual fairness without sacrificing performance.
problem Ensuring fairness in algorithmic decision-making.
method Using singular value thresholding (SVT) to preprocess data.
result SVT pre-processing improves IF guarantees and maintains performance.
Rank aggregation systems collect ordinal preferences from individuals to produce a global ranking that represents the social preference. Rank-breaking is a common practice to reduce the computational complexity of learning the global ranking. The individual preferences are broken into pairwise comparisons and applied t…
DGSAM improves domain generalization by minimizing individual sharpness.
problem Improving domain generalization models that perform well on unseen target domains.
method Shifts DG paradigm toward minimizing individual sharpness across source domains.
result DGSAM reduces performance variance across domains with less computational overhead.
System recommends workouts and predicts success rates using RNNs.
problem Promoting healthy lifestyles through personalized exercise recommendations.
method Two interconnected recurrent neural networks (RNNs) using historical workout data.
result Interconnected-RNN model predicts exercise success rates with improved accuracy.
We consider the predictive problem of supervised ranking, where the task is to rank sets of candidate items returned in response to queries. Although there exist statistical procedures that come with guarantees of consistency in this setting, these procedures require that individuals provide a complete ranking of all i…
The study analyzes how deep neural networks treat instances with regular and irregular patterns.
problem Understanding how deep neural networks handle both common and rare patterns in data.
method Characterizes instances using a consistency score based on training data sets of varying sizes.
result The consistency score identifies out-of-distribution and mislabeled examples, distinguishing them from strongly regular examples.
The authors propose a parametric model called the arena model for prediction in paired competitions, i.e. paired comparisons with eliminations and bifurcations. The arena model has a number of appealing advantages. First, it predicts the results of competitions without rating many individuals. Second, it takes full adv…
Nonparametric efficient inference for network quantile causal effects under partial interferencestat.ME
Study efficient inference for network quantile causal effects with partial interference.
problem Estimating network causal effects on outcome quantiles with partial interference.
method Developed a nonparametric efficiency theory and a nonparametrically efficient estimator using a three-way cross-fitting procedure.
result Proposed estimator is consistent, asymptotically normal, and allows flexible estimation of nuisance functions.
On consistency of constrained spectral clustering under representation-aware stochastic block modelstat.ML
New method finds balanced clusters in graphs using auxiliary information.
problem Finding balanced clusters in graphs with population-level constraints.
method Proposes individual-level balancing constraint and develops spectral clustering algorithms.
result Establishes first statistical consistency result for constrained spectral clustering.
A number of machine learning (ML) methods have been proposed recently to maximize model predictive accuracy while enforcing notions of group parity or fairness across sub-populations. We propose a desirable property for these procedures, slack-consistency: For any individual, the predictions of the model should be mono…
Consistent spectral clustering with fairness constraints on representation graphs.
problem Finding balanced clusters in similarity graphs with fairness constraints.
method Developed variants of unnormalized and normalized spectral clustering for fair planted partitions.
result Consistency results for constrained spectral clustering under fair planted partitions.
This note fills the gap in market-consistent valuation of lifelong health insurance products.
problem Market-consistent valuation of lifelong health insurance products is not well-addressed.
method Constructs a valuation portfolio to separate Best Estimate into policy data and financial instrument prices.
result The Best Estimate valuation is not uniquely determined by prevailing term structures and requires a stochastic model.
Confidentiality of patient information is an essential part of Electronic Health Record System. Patient information, if exposed, can cause a serious damage to the privacy of individuals receiving healthcare. Hence it is important to remove such details from physician notes. A system is proposed which consists of a deep…
Develops methods for near-optimal personalized treatment recommendations.
problem Assigning optimal treatments to patients based on individual characteristics.
method Outcome weighted learning framework to estimate near-optimal alternative individualized treatment recommendations (A-ITR).
result Consistency of proposed methods and upper bound for risk between optimal and estimated recommendations.
ClusterSC improves synthetic control by selecting relevant donor groups.
problem The curse of dimensionality in synthetic control with individual-level data.
method ClusterSC incorporates clustering to select relevant donor groups.
result ClusterSC consistently outperforms classical SC approaches.
This paper introduces new methods for analysing the extreme and erratic behaviour of time series to evaluate the impact of COVID-19 on cryptocurrency market dynamics. Across 51 cryptocurrencies, we examine extreme behaviour through a study of distribution extremities, and erratic behaviour through structural breaks. Fi…
Paper uses stochastic algorithms to estimate systemic risk measures.
problem Estimating systemic risk measures in interconnected financial systems.
method Uses stochastic algorithms to estimate MSRM and proves consistency and asymptotic normality.
result Consistent and asymptotically normal estimators of MSRM are obtained.
We propose a new algorithm for training generative adversarial networks that jointly learns latent codes for both identities (e.g. individual humans) and observations (e.g. specific photographs). By fixing the identity portion of the latent codes, we can generate diverse images of the same subject, and by fixing the ob…
New method estimates optimal dose intervals for personalized treatment.
problem Learning optimal dose intervals from observational data.
method Probability dose interval (PDI) method using DC algorithm.
result Consistent policy with risk converging to best-in-class at root-n rate.
Pareto's Law for Income of Individuals and Debt of Bankrupt Companiescond-mat.stat-mech
We analyze the distribution of income and income tax of individuals in Japan for the fiscal year 1998. From the rank-size plots we find that the accumulated probability distribution of both data obey a power law with a Pareto exponent very close to -2. We also present an analysis of the distribution of the debts owed b…
This paper improves deep learning model consistency through ensemble methods.
problem Consistency and correct-consistency issues in deep learning models.
method Formal definition of consistency and correct-consistency, proving ensemble improvement, proposing dynamic snapshot ensemble method.
result Ensemble methods can improve correct-consistency of deep learning models.
Estimating the largest community in a mixed population via sequential sampling.
problem Identifying the largest community in a mixed population with limited sampling.
method Sequential, random sampling of individuals across multiple boxes, optimizing sampling strategy and decision rule.
result Proposed algorithms achieve optimal error probability decay rates under fixed budget constraints.
New model clusters cells and individuals, revealing genetic influences on cell types.
problem Clustering nested data with group-level and observation-level variables.
method Nested Atoms Model (NAM), Bayesian nonparametric approach.
result Identifies clusters of genetically similar individuals with homogeneous cell-type profiles.
Revisiting Counterfactual Regression through the Lens of Gromov-Wasserstein Information Bottleneckcs.LG
GWIB improves counterfactual regression by balancing latent distributions and reducing selection bias.
problem Selection bias between control and treatment groups negatively impacts counterfactual regression performance.
method GWIB uses Gromov-Wasserstein information bottleneck to maximize mutual information between covariates and outcomes while penalizing kernelized mutual information between latent representations and covariates.
result GWIB consistently outperforms state-of-the-art CFR methods in ITE estimation tasks.
In recent years rank aggregation has received significant attention from the machine learning community. The goal of such a problem is to combine the (partially revealed) preferences over objects of a large population into a single, relatively consistent ordering of those objects. However, in many cases, we might not w…
Survival Cluster Analysisstat.ML
Bayesian approach clusters survival data for better risk prediction.
problem Identifying subpopulations with distinct risk profiles in survival analysis.
method Bayesian nonparametric approach in a clustered latent space.
result Consistent improvements in predictive performance and interpretability.
An AI-powered Bayesian generative modeling approach for causal inference in observational studiesstat.ML
CausalBGM uses AI to infer causal effects from complex data.
problem Challenges in causal inference with high-dimensional covariates.
method AI-powered Bayesian generative modeling approach to estimate individual treatment effects.
result CausalBGM consistently outperforms existing methods in high-dimensional scenarios.
Joint and individual variation explained (JIVE) for integrated analysis of multiple data typesstat.ML
Research in several fields now requires the analysis of data sets in which multiple high-dimensional types of data are available for a common set of objects. In particular, The Cancer Genome Atlas (TCGA) includes data from several diverse genomic technologies on the same cancerous tumor samples. In this paper we introd…
We consider the problem of learning predictive models from longitudinal data, consisting of irregularly repeated, sparse observations from a set of individuals over time. Such data often exhibit {\em longitudinal correlation} (LC) (correlations among observations for each individual over time), {\em cluster correlation…
SD-SCMs generate counterfactual data for causal inference benchmarks.
problem Benchmarking causal inference methods with realistic data.
method Sequence-driven structural causal models (SD-SCMs) for causal inference.
result State-of-the-art methods struggle with individual treatment effect estimation.
Person re-identification (re-id), an emerging problem in visual surveillance, deals with maintaining entities of individuals whilst they traverse various locations surveilled by a camera network. From a visual perspective re-id is challenging due to significant changes in visual appearance of individuals in cameras wit…
Proposes a new estimator for weak instrumental variables in panel data models.
problem Weak instrumental variables due to ignored nonlinearities in panel data.
method Triangular simultaneous equation model with a nonlinear reduced form equation and a control function approach using Super Learner.
result The proposed SLCF estimator is consistent and asymptotically normal, achieving a parametric rate of convergence.
With ever-increasing available data, predicting individuals' preferences and helping them locate the most relevant information has become a pressing need. Understanding and predicting preferences is also important from a fundamental point of view, as part of what has been called a "new" computational social science. He…