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

6511,3011,9522,602 · Jun 202019922001200920172026
48 results for Area Under the Margin

Adapts AUM to identify ambiguous tasks in crowdsourced learning, improving generalization.

problem Discerning ambiguous tasks in crowdsourced labels to prevent mislabeling.
method Introduces Weighted Areas Under the Margin (WAUM) to average AUMs weighted by task-specific scores.
result Improves generalization performance by discarding ambiguous tasks.

Paper identifies and removes mislabeled data to improve neural network training.

problem Improving neural network training by identifying and removing ambiguous or mislabeled data.
method Introduces Area Under the Margin (AUM) statistic to identify mislabeled data and a simple procedure to remove it.
result Consistently improves test error on synthetic and real-world datasets.

New insights into deep learning: reducing training data significantly improves performance.

problem Understanding and improving generalization in deep learning models.
method Analyzing the distribution of classification margins and dynamically reducing the training set.
result The area under the curve of the margin distribution is a good measure of generalization.

This paper considers some fundamental questions concerning marginally trapped surfaces, or apparent horizons, in Cauchy data sets for the Einstein equation. An area estimate for outermost marginally trapped surfaces is proved. The proof makes use of an existence result for marginal surfaces, in the presence of barriers…

2007-08-30abs ↗pdf ↗

The paper explores rigid geometric structures near surfaces with equality in area-charge inequalities.

problem Geometric constraints near surfaces with equality in area-charge inequalities.
method Investigation of equality in area-charge inequalities for spherical minimal surfaces and MOTS within the Einstein-Maxwell equations framework.
result Equality in area-charge inequalities imposes rigid geometric structures, including normal electric and magnetic fields and isometric Riemannian products.

Tall wheatgrass outperforms rye in energy and environmental metrics, marginally improving economic viability.

problem Finding sustainable alternatives for marginal agricultural areas.
method Economic assessment using profit margin and Life Cycle Assessment (LCA) for energy and environmental performance.
result Tall wheatgrass shows better environmental and energy performance with reduced inputs and lower energy consumption.

As discussed in the paper, in a matter-filled spacetime, perhaps with positive cosmological constant, a stable marginally outer trapped 2-sphere must satisfy a certain area inquality. Namely, its area must be bounded above by 4π/c4π/c, where c>0c > 0 is a lower bound on a natural energy momentum term. In this note we cons…

2015-03-18abs ↗pdf ↗

In a matter-filled spacetime, perhaps with positive cosmological constant, a stable marginally outer trapped 2-sphere must satisfy a certain area inequality. Namely, as discussed in the paper, its area must be bounded above by 4π/c4π/c, where c>0c > 0 is a lower bound on a natural energy-momentum term. We then consider th…

2015-05-29abs ↗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.

We prove in this paper that, under suitable coinditions on an initial data set, we can obtain Area and Curvature Estimates for simple marginally outer trapped surfaces (or MOTS). Using this estimates, we derive a Compactness Theorem for MOTS. Moreover, the Compactness Theorem will allow us to adapt the recent Degree Th…

2011-05-29abs ↗pdf ↗

Study improves curvature estimate for stable marginally outer trapped hypersurfaces with a free boundary.

problem Curvature estimate for stable marginally outer trapped hypersurfaces with a free boundary.
method Iteration argument based on uniform area bound.
result Improved curvature estimate for stable marginally outer trapped hypersurfaces.

New offline RL method works with limited data and function approximators.

problem Sample efficiency with limited data and weak function approximators.
method Pessimistic algorithm based on version space formed by marginalized importance sampling (MIS), with gap assumption.
result Guarantees sample efficiency for simple algorithm under specific assumptions.

Bayesian evidence computation revisited for model selection with improper priors.

problem Model selection with improper priors and their impact on Bayesian evidence computation.
method Employing improper priors in model selection problems, distinguishing between Bayesian evidence and fake evidences.
result Diffuse priors asymptotically to infinity do not recover the area under the likelihood.

In this article we show the duality between tensor networks and undirected graphical models with discrete variables. We study tensor networks on hypergraphs, which we call tensor hypernetworks. We show that the tensor hypernetwork on a hypergraph exactly corresponds to the graphical model given by the dual hypergraph. …

2017-10-04abs ↗pdf ↗

Study proves existence of MOTTs in de Sitter spacetime.

problem Proving existence of marginally outer trapped tubes in de Sitter spacetime.
method Combining results from spacetimes satisfying null convergence condition and properties of CMC surfaces in S3.
result Existence of complete MOTTs with CMC sections in de Sitter spacetime.

We study quaternionic stochastic areas processes associated with Brownian motions on the quaternionic rank-one symmetric spaces HHn\mathbb{H}H^n and HPn\mathbb{H}P^n. The characteristic functions of fixed-time marginals of these processes are computed and allows for the explicit description of their corresponding large-t…

2019-03-02abs ↗pdf ↗

Metaheuristics optimize portfolios with pre-assignment and margin trading for better risk-adjusted returns.

problem Maximizing returns while minimizing risk in portfolio optimization.
method Incorporates pre-assignment constraints and margin trading strategies using Genetic Algorithms and Particle Swarm Optimization.
result Metaheuristic-based portfolio optimization yields superior risk-adjusted returns compared to traditional methods.

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.

Paper proves rigidity of initial data sets with boundary and capillary MOTS.

problem Rigidity of initial data sets with boundary and capillary MOTS.
method Estimates area of MOTS, proves rigidity for 3D, extends to high dimensions using Yamabe constant.
result Rigidity results for initial data sets with boundary and capillary MOTS.

A framework estimates categorical distributions under constraints, ensuring generality and uniqueness.

problem Estimating categorical distributions summarizing sample data under marginal constraints.
method Theoretical framework + Iterative Proportional Fitting (IPF) to estimate the distribution.
result A unique categorical distribution of Maximum Entropy under marginal constraints exists and is estimated.

Any regular Gaussian probability distribution that can be represented by an AMP chain graph (CG) can be expressed as a system of linear equations with correlated errors whose structure depends on the CG. However, the CG represents the errors implicitly, as no nodes in the CG correspond to the errors. We propose in this…

2013-06-28abs ↗pdf ↗

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 ↗

The paper examines how heavy-tailed risks behave under Gaussian copula models.

problem Understanding tail risk probabilities with heavy-tailed marginal risks and Gaussian dependence.
method Modeling heavy-tailed risks using regular variation and analyzing tail probabilities under Gaussian copula.
result The rate of decay of tail set probabilities varies with the type of tail sets and Gaussian correlation matrix.

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.

Proposes a tabular transformer model to maintain feature effect intelligibility.

problem Losing marginal feature effects in deep tabular transformer networks.
method Adapts tabular transformer networks to identify marginal feature effects.
result The model accurately identifies marginal feature effects, matching black-box performance while maintaining intelligibility.

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 ↗

CMRM improves robustness in noisy label settings without requiring privileged knowledge.

problem Learning with noisy labels without privileged knowledge.
method Conformal Margin Risk Minimization (CMRM) framework.
result CMRM consistently improves accuracy and reduces mislabeling under various noise conditions.

K-area is an invariant for Riemannian manifolds introduced by Gromov as an obstruction to the existence of positive scalar curvature. However in general it is difficult to determine whether K-area is finite or not. though the definition of K-area is quite natural. In this paper, we study how the invariant changes under…

2013-05-01abs ↗pdf ↗

We solve Einstein vacuum equations in a spacetime region up to the "center" of gravitational collapse. Within this region, we construct a sequence of marginally outer trapped surfaces (MOTS) with areas going to zero. These MOTS form a marginally outer trapped tube (apparent horizon). It emerges from a point and is smoo…

2017-03-01abs ↗pdf ↗

A new policy learning method allows policies to abstain when uncertain, improving safety and applicability.

problem Risk of making decisions without full confidence in uncertain predictions.
method Policy learning with abstention, identifying near-optimal policies and constructing an abstention rule.
result Improved safety and applicability in policy learning, with theoretical guarantees.

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.

A new SVM classifier using L0/1L_{0/1} soft-margin loss for improved performance.

problem Improving SVM performance in binary classification tasks.
method Introducing L0/1L_{0/1} soft-margin loss and using the alternating direction method of multipliers.
result The new L0/1L_{0/1}-SVM model generates better performance with shorter computational time and fewer support vectors.

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.

The study establishes SQ lower bounds for learning halfspaces and ReLUs under Gaussian marginals.

problem Agnostically learning halfspaces and ReLUs under Gaussian marginals.
method Statistical Query (SQ) lower bounds analysis.
result Proves SQ lower bounds of dpoly(1/ε)d^{\mathrm{poly}(1/ε)} for both problems.