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

Trend · papers per month

109219328437 · May 202619922001200920172026
48 results for margin condition

Neural networks can approximate high-dimensional classifiers with ReLU networks under margin conditions.

problem Approximating high-dimensional discontinuous classifiers with neural networks.
method Using ReLU neural networks with three hidden layers, approximating a classifier with a Barron-regular decision boundary.
result High-dimensional discontinuous classifiers can be approximated with a rate of n1n^{-1} under strong margin conditions.

In this paper, we deal with the problem of marginalization over and conditioning on two disjoint subsets of the node set of chain graphs (CGs) with the LWF Markov property. For this purpose, we define the class of chain mixed graphs (CMGs) with three types of edges and, for this class, provide a separation criterion un…

2014-05-28abs ↗pdf ↗

Study minimax rates for binary classifier estimation with margin conditions.

problem Estimating binary classifiers with geometric margin conditions.
method Derive lower bounds for worst-case learning rates over various function classes.
result Identify optimal rates close to O(n1)\mathcal{O}(n^{-1}) for different function classes.

Study shows exponential error reduction in multiclass classification without bias-variance trade-off.

problem Multiclass classification with margin conditions.
method Analysis of classification error under hard-margin conditions.
result Exponential decrease in classification error without bias-variance trade-off.

MCD reformulates conditional density estimation into binary classification.

problem Conditional density estimation in statistical and machine learning.
method Marginal Contrastive Discrimination, reformulating into marginal and ratio density functions for binary classification.
result Significantly outperforms existing methods on most density models and regression datasets.

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.

The paper studies marginally trapped submanifolds in Lorentzian manifolds under null energy condition.

problem Understanding marginally trapped submanifolds in Lorentzian manifolds.
method Analyzes properties of marginally trapped submanifolds in a Lorentzian manifold satisfying the null energy condition.
result Marginally trapped submanifolds have locally volume-maximizing properties in certain null hypersurfaces.

We extend probabilistic programming to handle conditioning on marginal distributions.

problem Conditioning probabilistic programs on marginal distributions of observable variables.
method We define and implement stochastic conditioning, allowing inference in probabilistic programs conditioned on marginal distributions.
result We demonstrate the effectiveness of stochastic conditioning in various real-life scenarios.

Paper resolves conflicting Shapley value approaches by showing conditional is unsound and marginal is preferred.

problem Conflicting results from conditional and marginal Shapley value approaches when features are correlated.
method Uses causal arguments to show differences arise from assumptions about missing causal information.
result Marginal approach is preferred over conditional due to causal soundness.

Random projections have been applied in many machine learning algorithms. However, whether margin is preserved after random projection is non-trivial and not well studied. In this paper we analyse margin distortion after random projection, and give the conditions of margin preservation for binary classification problem…

2012-06-18abs ↗pdf ↗

A new sampler for FLMs improves token-level decoding controls.

problem Sampling from FLMs using standard methods collapses marginals and produces invalid sequences.
method Samples clean one-hot endpoints from FLM token marginals and uses Ornstein-Uhlenbeck bridges conditioned on these endpoints.
result The method preserves token-wise posterior-predictive marginals and improves quality-diversity tradeoff.

The paper distinguishes between conditional and marginal processes in language models and discusses conditions for usefulness.

problem The conditional nature of language models trained on observed sequences and the need for marginal text-only processes.
method Distinguishing between full conditional language process, marginal text-only process, and model-induced distribution; analyzing assumptions of stationarity and ergodicity.
result The marginal text-only law is useful only when the observed prefix is an approximately sufficient statistic for the latent circumstances relevant to continuation.

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 ↗

Active learning can't improve over passive in certain settings.

problem Active learning vs. passive learning in nonparametric settings.
method Analyzing margin conditions and their effects on active learning performance.
result Nuances in margin conditions determine whether active learning can outperform passive learning.

DIET tests conditional independence using marginal dependence measures of residual information.

problem Computational intractability of conditional randomization tests (CRTs).
method DIET avoids fitting large models by leveraging marginal independence statistics of information residuals.
result DIET achieves higher power than other tractable CRTs on synthetic and real benchmarks.

Enhanced consistency bounds derived for classification under a new noise condition.

problem Enhanced consistency bounds for classification under a new noise condition.
method Model Margin Noise (MM noise) assumption, derived enhanced H-consistency bounds.
result Enhanced H-consistency bounds under MM noise condition, interpolates between linear and square-root regimes.

We present a new replay-based method of continual classification learning that we term "conditional replay" which generates samples and labels together by sampling from a distribution conditioned on the class. We compare conditional replay to another replay-based continual learning paradigm (which we term "marginal rep…

2018-10-29abs ↗pdf ↗

Identifying components and estimating mixing weights in unlabeled finite mixtures under marginal independence.

problem Identifying components and estimating mixing weights in unlabeled finite mixtures.
method Proving structural results and extending them to observable mixtures.
result Identifying components and estimating mixing weights under marginal independence.

New insights into how linear classifiers and leaky ReLU networks can overfit without harming generalization.

problem Understanding conditions for benign overfitting in linear classifiers and leaky ReLU networks.
method Utilizing Karush--Kuhn--Tucker (KKT) conditions for margin maximization.
result Satisfaction of KKT conditions leads to benign overfitting in linear classifiers and leaky ReLU networks.

3MSBM learns smooth trajectories from multiple snapshots.

problem Capturing long-range temporal dependencies in complex systems.
method Lifts dynamics to phase space, generalizes stochastic bridges to multi-marginal conditional problems, learns transport maps preserving intermediate marginals.
result Significantly improves convergence and scalability in capturing complex dynamics.

We develop a framework for post model selection inference, via marginal screening, in linear regression. At the core of this framework is a result that characterizes the exact distribution of linear functions of the response yy, conditional on the model being selected (``condition on selection" framework). This allows…

2014-02-23abs ↗pdf ↗

CMRFs extend PGMs for topological data, capturing both conditional and marginal dependencies.

problem Limited expressiveness of PGMs for topological data.
method Introducing Colored Markov Random Fields (CMRFs) that model Gaussian edge variables on topological spaces.
result CMRFs improve distributed estimation over physical networks compared to baselines.

New method for efficient conditional sampling from diffusion models.

problem Efficient conditional simulation from diffusion models.
method Explicit forward-backward bridging to express conditional simulation as an inference problem.
result Principled particle Gibbs and pseudo-marginal samplers for conditional distribution.

Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property that is closed under conditioning and marginalization. By design, ancestral graphs encode precisely the conditional independence structures t…

2012-07-11abs ↗pdf ↗

Researchers expand on best subset selection theory, identifying key complexities.

problem Understanding model selection performance in high-dimensional sparse linear regression.
method Analyzing residualized signals, orthogonality, and spurious projections to establish margin conditions.
result Established necessary and sufficient margin conditions for BSS model consistency.

Risk bounds for Classification and Regression Trees (CART, Breiman et. al. 1984) classifiers are obtained under a margin condition in the binary supervised classification framework. These risk bounds are obtained conditionally on the construction of the maximal deep binary tree and permit to prove that the linear penal…

2009-02-18abs ↗pdf ↗

The paper introduces canonical parameters for marginally trapped surfaces in Minkowski space.

problem Determining marginally trapped surfaces in Minkowski space.
method Introducing canonical parameters and proving existence and uniqueness theorems.
result Every marginally trapped surface is determined by three smooth functions.

Study on deep neural networks for reward modeling with pairwise comparison data.

problem Reward modeling with deep neural networks in non-parametric settings.
method Established a non-asymptotic regret bound for deep reward estimators, introduced a margin-type condition.
result Improved regret bound for deep reward estimators, highlighting the importance of clear human beliefs.

We propose a novel and flexible rank-breaking-then-composite-marginal-likelihood (RBCML) framework for learning random utility models (RUMs), which include the Plackett-Luce model. We characterize conditions for the objective function of RBCML to be strictly log-concave by proving that strict log-concavity is preserved…

2018-06-04abs ↗pdf ↗

We introduce a new model for building conditional generative models in a semi-supervised setting to conditionally generate data given attributes by adapting the GAN framework. The proposed semi-supervised GAN (SS-GAN) model uses a pair of stacked discriminators to learn the marginal distribution of the data, and the co…

2017-08-19abs ↗pdf ↗

Study stability and rigidity of axisymmetric marginally outer trapped surfaces.

problem Stability and rigidity of axisymmetric marginally outer trapped surfaces.
method Refined results from initial data sets with Killing vector fields, using new foliation lemma.
result Conditions for the stability of axisymmetric MOTS and new foliation lemma.

The paper develops distribution-free methods for ordinal classification.

problem Constructing valid prediction sets for ordinal classification problems.
method Leveraging conformal prediction and multiple testing with FWER control.
result The proposed methods achieve satisfactory levels of marginal and class-specific conditional coverages.

GD iterates for non-homogeneous deep nets increase margin and converge in direction.

problem Understanding implicit bias in non-homogeneous deep networks.
method Characterization of GD iterates' properties starting from small empirical risk.
result GD iterates converge in direction despite diverging norms, satisfying KKT conditions.

It has been argued that in supervised classification tasks, in practice it may be more sensible to perform model selection with respect to some more focused model selection score, like the supervised (conditional) marginal likelihood, than with respect to the standard marginal likelihood criterion. However, for most Ba…

2013-01-10abs ↗pdf ↗

New test for conditional independence using GNNs avoids estimating conditional distributions.

problem Testing conditional independence of XX and YY given ZZ.
method Proposes a non-parametric testing procedure using GNNs to sample from marginal conditional distributions.
result Test statistic is doubly robust against GNN approximation errors.

We introduce a globally-convergent algorithm for optimizing the tree-reweighted (TRW) variational objective over the marginal polytope. The algorithm is based on the conditional gradient method (Frank-Wolfe) and moves pseudomarginals within the marginal polytope through repeated maximum a posteriori (MAP) calls. This m…

2015-11-06abs ↗pdf ↗