Research
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,742 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for Model Marginalization

MACQ method explains deep learning models by analyzing feature contributions across prediction levels.

problem Explaining deep learning model predictions.
method Global gradient-based, model-agnostic approach focusing on marginal attribution.
result MACQ separates feature contributions from interaction effects and visualizes 3-way relationships.

Max-margin learning is a powerful approach to building classifiers and structured output predictors. Recent work on max-margin supervised topic models has successfully integrated it with Bayesian topic models to discover discriminative latent semantic structures and make accurate predictions for unseen testing data. Ho…

2013-10-10abs ↗pdf ↗

Improves sampling from complex hierarchical models using HMC and automatic marginalization.

problem Sampling from complex hierarchical models is difficult for HMC.
method Proposes automatic marginalization as part of the sampling process using HMC in a graphical model extracted from a PPL.
result Significantly improves sampling from real-world hierarchical models.

New method estimates marginal likelihood for deep learning models using training data alone.

problem Estimation difficulties in marginal likelihood for model selection in deep learning.
method Scalable marginal likelihood estimation based on Laplace's method and Gauss-Newton approximations.
result Estimate outperforms cross-validation and manual tuning on various datasets.

New DP algorithms with margin guarantees for various hypothesis sets.

problem Differential privacy in machine learning with margin guarantees.
method Developed pure and efficient DP learning algorithms for linear, kernel-based, and neural network hypotheses.
result Margin guarantees are independent of input dimension and hypothesis type.

We present a new active sampling method we call min-margin which trains multiple learners on bootstrap samples and then chooses the examples to label based on the candidates' minimum margin amongst the bootstrapped models. This extends standard margin sampling in a way that increases its diversity in a supervised manne…

2019-05-31abs ↗pdf ↗

Local mappings relate dual and primal factor graphs for efficient marginal probability estimation.

problem Efficient estimation of marginal probabilities in statistical physics models.
method Local mappings based on Fourier transform of local factors, applied to Ising, Potts, and clock models.
result Local extrema of fixed points are at phase transition points, and the mapping facilitates efficient estimation.

Proposes a model for clearing prices in financial markets due to margin calls.

problem Determining prices in financial markets following margin calls and short squeezes.
method Developed an explicit formulation for clearing prices after margin calls and short squeezes.
result Identified a threshold short interest ratio leading to discontinuity in clearing prices.

We develop an HMC algorithm to easily marginalize random effects in LMMs.

problem Bayesian inference in LMMs is challenging, especially marginalizing random effects.
method Developed an HMC algorithm to marginalize random effects in LMMs efficiently.
result Marginalization is always beneficial when applicable and improves various models, especially cognitive science models.

Paper analyzes GMM for separable data with various parameter structures.

problem Classifying separable data with logistic models and their generalizations.
method Introduces and analyzes Generalized Margin Maximizer (GMM) for logistic models with specific parameter structures.
result GMM outperforms max-margin classifiers in various parameter settings and structures.

The marginal maximum a posteriori probability (MAP) estimation problem, which calculates the mode of the marginal posterior distribution of a subset of variables with the remaining variables marginalized, is an important inference problem in many models, such as those with hidden variables or uncertain parameters. Unfo…

2013-02-26abs ↗pdf ↗

New method for efficient marginalization of discrete latent variables in neural networks.

problem Computational challenges in training models with discrete latent variables.
method Parameterizing discrete distributions using sparse mappings (sparsemax and structured variants) to reduce support and enable efficient marginalization.
result Achieved good performance in various tasks with efficient and practical training.

Batch normalization biases linear models towards uniform margins, improving performance in binary classification.

problem Understanding the implicit bias of batch normalization in linear models and neural networks.
method Analyzing gradient descent convergence on linear models and two-layer CNNs with batch normalization.
result Gradient descent with batch normalization in linear models converges to a uniform margin classifier with an exponential convergence rate.

SUMO provides unbiased log marginal likelihood estimation for latent variable models.

problem Biased estimates of log marginal likelihood in latent variable models.
method Randomized truncation of infinite series for unbiased estimation.
result Models trained with SUMO give better test-set likelihoods than standard methods.

Generative models often fail to preserve joint structure despite matching marginals.

problem Generative models fail to capture complex dependencies beyond univariate marginals.
method Introduced D_Sigma(P,Q) = ||Sigma_P - Sigma_Q||_F to measure covariance-level dependence fidelity.
result Covariance-level divergence can lead to structural instability in downstream inference.

Bayesian approach models nonignorable missing data using copulas and marginal quantiles.

problem Nonignorable missing data in lead exposure and test score analysis.
method Gaussian copula model with auxiliary marginal quantiles for missingness indicators and study variables.
result Efficient MCMC algorithm estimates copula correlation and marginal distributions consistently.

Graphical models trained using maximum likelihood are a common tool for probabilistic inference of marginal distributions. However, this approach suffers difficulties when either the inference process or the model is approximate. In this paper, the inference process is first defined to be the minimization of a convex f…

2012-06-13abs ↗pdf ↗

Copulas outperform marginal models in multivariate risk forecasting, reducing model risk by narrowing down the set of models.

problem Model risk in multivariate risk forecasting, especially during crises.
method Comprehensive empirical study comparing Copula-GARCH models with fixed marginals, copulas, or neither.
result Model risk is almost entirely due to copula choice, not marginal models.

In this paper, we reformulate the forest representation learning approach as an additive model which boosts the augmented feature instead of the prediction. We substantially improve the upper bound of generalization gap from O(lnmm)\mathcal{O}(\sqrt\frac{\ln m}{m}) to O(lnmm)\mathcal{O}(\frac{\ln m}{m}), while λλ - the margin r…

2019-05-07abs ↗pdf ↗

A classical condition for fast learning rates is the margin condition, first introduced by Mammen and Tsybakov. We tackle in this paper the problem of adaptivity to this condition in the context of model selection, in a general learning framework. Actually, we consider a weaker version of this condition that allows one…

2008-04-18abs ↗pdf ↗

The paper proposes a parallelizable clustering method for multivariate data.

problem The standard model-based clustering method assumes the same number of clusters per margin, which is often unrealistic.
method Developed a finite mixture model per margin with different numbers of clusters, and used a game-inspired algorithm to cluster multivariate data.
result The proposed method shows good performance in various scenarios and real datasets.

The paper discusses the impact of prior densities on Bayesian model selection.

problem The sensitivity of marginal likelihood to prior choice in Bayesian model selection.
method Analyzes the role of prior densities in model selection, discusses improper priors, and proposes solutions.
result Marginal likelihood can be sensitive to prior choice, but improper priors can still be used with caution.

We present a max-margin nonparametric latent feature model, which unites the ideas of max-margin learning and Bayesian nonparametrics to discover discriminative latent features for link prediction and automatically infer the unknown latent social dimension. By minimizing a hinge-loss using the linear expectation operat…

2012-06-18abs ↗pdf ↗

We present new differentially private algorithms for learning a large-margin halfspace. In contrast to previous algorithms, which are based on either differentially private simulations of the statistical query model or on private convex optimization, the sample complexity of our algorithms depends only on the margin of…

2019-02-24abs ↗pdf ↗

We present a new family of models that is based on graphs that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them is Markov equivalent to some AMP chain graph under marginalization of some of its nodes. However, MAMP chain graphs do not onl…

2013-05-03abs ↗pdf ↗

Initial margin requirements are becoming an increasingly common feature of derivative markets. However, while the valuation of derivatives under collateralisation (Piterbarg 2010, Piterbarg2012), under counterparty risk with unsecured funding costs (FVA) (Burgard2011, Burgard2011, Burgard2013) and in the presence of re…

2014-05-02abs ↗pdf ↗