New method for interpreting non-linear models using forward marginal effects.
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.
Trend · papers per month
We analyze bias-variance of margin losses.
MACQ method explains deep learning models by analyzing feature contributions across prediction levels.
Margin enlargement over training data has been an important strategy since perceptrons in machine learning for the purpose of boosting the robustness of classifiers toward a good generalization ability. Yet Breiman (1999) showed a dilemma that a uniform improvement on margin distribution does NOT necessarily reduces ge…
Bayesian evidence helps compare models but can overfit.
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…
Improves sampling from complex hierarchical models using HMC and automatic marginalization.
An econometric or statistical model may undergo a marginal gain if we admit a new variable to the model, and a marginal loss if we remove an existing variable from the model. Assuming equality of opportunity among all candidate variables, we derive a valuation framework by the expected marginal gain and marginal loss i…
In order to protect brokers from customer defaults in a volatile market, an active margin system is proposed for the transactions of margin lending in China. The probability of negative return under the condition that collaterals are liquidated in a falling market is used to measure the risk associated with margin loan…
New method estimates marginal likelihood for deep learning models using training data alone.
Margin system for margin loans using cash and stock as collateral is considered in this paper, which is the line of defence for brokers against risk associated with margin trading. The conditional probability of negative return is used as risk measure, and a recursive algorithm is proposed to realize this measure under…
For linear classifiers, the relationship between (normalized) output margin and generalization is captured in a clear and simple bound -- a large output margin implies good generalization. Unfortunately, for deep models, this relationship is less clear: existing analyses of the output margin give complicated bounds whi…
New DP algorithms with margin guarantees for various hypothesis sets.
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…
An active margin system for margin loans is proposed for Chinese margin lending market, which uses cash and randomly selected stock as collateral. The conditional probability of negative return(CPNR) after a forced sale of securities from under-margined account in a falling market is used to measure the risk faced by t…
Local mappings relate dual and primal factor graphs for efficient marginal probability estimation.
New margin bound improves generalization for voting classifiers.
Proposes a model for clearing prices in financial markets due to margin calls.
We develop an HMC algorithm to easily marginalize random effects in LMMs.
Paper analyzes GMM for separable data with various parameter structures.
New method resolves nonidentifiability in mixture models.
Boosting and other ensemble methods combine a large number of weak classifiers through weighted voting to produce stronger predictive models. To explain the successful performance of boosting algorithms, Schapire et al. (1998) showed that AdaBoost is especially effective at increasing the margins of the training data. …
With an eye toward understanding complexity control in deep learning, we study how infinitesimal regularization or gradient descent optimization lead to margin maximizing solutions in both homogeneous and non-homogeneous models, extending previous work that focused on infinitesimal regularization only in homogeneous mo…
We study adversarial robustness of neural networks from a margin maximization perspective, where margins are defined as the distances from inputs to a classifier's decision boundary. Our study shows that maximizing margins can be achieved by minimizing the adversarial loss on the decision boundary at the "shortest succ…
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…
We prove that the marginal densities of a global probability mass function in a primal normal factor graph and the corresponding marginal densities in the dual normal factor graph are related via local mappings. The mapping depends on the Fourier transform of the local factors of the models. Details of the mapping, inc…
New method for efficient marginalization of discrete latent variables in neural networks.
Batch normalization biases linear models towards uniform margins, improving performance in binary classification.
SUMO provides unbiased log marginal likelihood estimation for latent variable models.
Generative models often fail to preserve joint structure despite matching marginals.
Bayesian approach models nonignorable missing data using copulas and marginal quantiles.
fmeffects package interprets non-linear models in plain language.
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…
Copulas outperform marginal models in multivariate risk forecasting, reducing model risk by narrowing down the set of 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 to , while - the margin r…
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…
The paper proposes a parallelizable clustering method for multivariate data.
Maximizing margins leads to lossless compression of training data.
Margin trading in which investors purchase shares with money borrowed from brokers is blamed to be a major cause of the 2015 Chinese stock market crash. We propose a cascading failure model and examine how an increase in margin trading increases share price vulnerability. The model is based on a bipartite graph of inve…
The paper discusses the impact of prior densities on Bayesian model selection.
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…
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…
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…
In this article we discuss the problem of calculating optimal model-independent (robust) bounds for the price of Asian options with discrete and continuous averaging. We will give geometric characterisations of the maximising and the minimising pricing model for certain types of Asian options in discrete and continuous…
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…
We present and implement two algorithms for analytic asymptotic evaluation of the marginal likelihood of data given a Bayesian network with hidden nodes. As shown by previous work, this evaluation is particularly hard for latent Bayesian network models, namely networks that include hidden variables, where asymptotic ap…
New method bounds causal effects using local consistency of marginals.
In this paper, we introduce a new form of amortized variational inference by using the forward KL divergence in a joint-contrastive variational loss. The resulting forward amortized variational inference is a likelihood-free method as its gradient can be sampled without bias and without requiring any evaluation of eith…