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

12.5%25.0%37.5%50.0% · Jul 199319922001200920172026
48 results for minimal separators

We solve minimal separator problems in AMP chain graphs and improve structure learning algorithms.

problem Finding minimal separators in AMP chain graphs and learning their structure from data.
method We analyze and solve several versions of the minimal separator problem. We propose modifications to the PC-like algorithm and extend a decomposition-based method for AMP CGs.
result Our modifications of the PC-like algorithm and the LCD-AMP method improve structure learning and are more accurate and stable, especially in high-dimensional settings.

Some elementary considerations are presented concerning Catenoids and their stability, separable minimal hypersurfaces, minimal surfaces obtainable by rotating shapes, determinantal varieties, minimal tori in S3, the minimality in Rnk of the ordered set of k orthogonal equal-length n-vectors, and U(1)-invariant minimal…

2019-03-28abs ↗pdf ↗

Extends Newton's minimal resistance problem to Lorentz-Minkowski space.

problem Minimal resistance in Lorentz-Minkowski space.
method Derived functional energy, determined Euler-Lagrange equation, analyzed maximum principle, found separable and radial solutions.
result Obtained solutions with conical singularities at the origin and analyzed the Single Shock Condition.

This paper develops a new nonlocal approximation method for minimal surfaces, proving robust estimates and separation properties.

problem Constructing minimal surfaces in 3-manifolds and understanding their stability and separation.
method Nonlocal approximation of minimal surfaces, focusing on stability and separation properties.
result Robust curvature and separation estimates for stable nonlocal minimal surfaces, proving hyperplanes are the only stable hypersurfaces in R^4.

New concept of regular separation for ODEs leads to improved Hardy field results.

problem Understanding solutions of definable ODEs with specific properties.
method Introducing regular separation and proving its implications for ODEs and vector fields.
result The regular separation property leads to improved Hardy field results and non-empty sets of trajectories.

Separable losses are inconsistent for structured prediction models.

problem Inconsistency of separable losses in structured prediction models.
method Analysis of separable negative log-likelihood losses for structured prediction.
result Separable losses are not Bayes consistent and may not predict the most probable structure.

Study of phase separation and geometry on a closed elastic curve, including dynamics and free energy minimization.

problem Free energy and dynamics of a closed elastic filament coupled to a scalar concentration field.
method Analytical and numerical simulations of coupled Willmore flow and Cahn--Hilliard gradient flow on differential geometry.
result Qualitative changes in free energy landscape due to closure constraint, leading to metastable and stable multi-domain morphologies.

This paper proposes a new evaluation metric and boosting method for weight separability in neural network design. In contrast to general visual recognition methods designed to encourage both intra-class compactness and inter-class separability of latent features, we focus on estimating linear independence of column vec…

2019-10-20abs ↗pdf ↗

The generalized soap bubble problem seeks the least perimeter way to enclose and separate n given volumes in R^m. We study the possible configurations for perimeter minimizing bubble complexes enclosing more than two regions. We prove that perimeter minimizing planar bubble complexes with equal pressure regions and wit…

1998-08-11abs ↗pdf ↗

Optimal joint separation condition for radar and communications channels in dual-blind deconvolution.

problem Recovering information from overlaid radar and communications signals with unknown channels.
method Extremal functions from Beurling-Selberg interpolation theory for joint separation, nuclear norm minimization for matrix retrieval, and MUSIC for parameter estimation.
result Guaranteed well-conditioned Vandermonde matrix for MUSIC, validating theoretical findings.

We introduce a new metric to evaluate corruption robustness of ML classifiers.

problem Evaluating corruption robustness of machine learning classifiers.
method We propose a test data augmentation method using minimal class separation distance to derive a robustness distance ε and a metric MSCR.
result The MSCR metric allows interpretable comparison of classifier robustness on different datasets.

Constructs classifiers for neural networks with specific data configurations.

problem Finding global minima of deep ReLU neural networks on sequentially separable data.
method Explicitly constructs zero loss neural network classifiers using cumulative parameters and truncation maps.
result Global minimizers can be described with a limited number of parameters based on the data structure.

Optimizes CM for stochastic convex optimization with progressive precision.

problem Stochastic nature of objective function in convex optimization.
method Iterative coordinate minimization with optimal precision control.
result Order-optimal regret performance for strongly convex and nonsmooth functions.

Adaptive clustering and personalization algorithms minimize regret in multi-agent stochastic linear bandits.

problem Minimizing regret in a multi-agent stochastic linear bandits framework with user heterogeneity.
method Proposes a novel algorithm that refines cluster identities and minimizes regret, adapting to cluster separation and user parameter deviations.
result Regret scales as O(T/N)\mathcal{O}(\sqrt{T/N}) for well-separated clusters and O(T12+ε/(N)12ε)\mathcal{O}(T^{\frac{1}{2} + \varepsilon}/(N)^{\frac{1}{2} -\varepsilon}) for poorly separated clusters.

Sparse Blind Source Separation (sparse BSS) is a key method to analyze multichannel data in fields ranging from medical imaging to astrophysics. However, since it relies on seeking the solution of a non-convex penalized matrix factorization problem, its performances largely depend on the optimization strategy. In this …

2018-12-17abs ↗pdf ↗

We present a conjecture, based on computational results, on the area minimizing way to enclose and separate two arbitrary volumes in the flat cubic 3-torus. For comparable small volumes, we prove that an area minimizing double bubble in the 3-torus is the standard double bubble from R^3.

2002-08-15abs ↗pdf ↗

This study examines abnormal geodesics in 2D-Zermelo navigation problems, revealing their role in separating time minimal and maximal curves.

problem The role of abnormal geodesics in planar Zermelo navigation problems with strong current.
method Geometric time optimal control approach, focusing on the heading angle of the ship.
result Abnormal geodesics separate time minimal and maximal curves, and are both small-time minimizing and maximizing.

Minimal constructions of meanders and hyperelliptic pillowcase covers help in understanding ratio-optimizing pseudo-Anosovs.

problem Understanding ratio-optimizing pseudo-Anosovs in moduli spaces of quadratic differentials.
method Minimal constructions of meanders and hyperelliptic pillowcase covers.
result Existence of ratio-optimizing pseudo-Anosovs deep in the Johnson filtration.

Gradient flow on softmax attention minimizes nuclear norm of weight matrices.

problem Classification with separate key and query weight matrices.
method Gradient flow on exponential loss, separability assumption, reparameterization, approximate KKT conditions.
result Gradient flow implicitly minimizes nuclear norm of weight matrices, contrasting with Frobenius norm minimization.

Single-microphone, speaker-independent speech separation is normally performed through two steps: (i) separating the specific speech sources, and (ii) determining the best output-label assignment to find the separation error. The second step is the main obstacle in training neural networks for speech separation. Recent…

2019-08-04abs ↗pdf ↗

Adversarial training is a technique for training robust machine learning models. To encourage robustness, it iteratively computes adversarial examples for the model, and then re-trains on these examples via some update rule. This work analyzes the performance of adversarial training on linearly separable data, and prov…

2019-05-22abs ↗pdf ↗

SRTC model for background/foreground separation with missing pixels.

problem Background/foreground separation with missing pixels in videos.
method Smooth robust tensor completion (SRTC) model with tensor proximal alternating minimization (tenPAM).
result Global convergence guarantee for the proposed algorithm.

Study essential diagrams of knots in SgimesS1S_{g} imes S^{1} and their relation to virtual knots.

problem Understanding essential diagrams and their relation to virtual knots in SgimesS1S_{g} imes S^{1}.
method Analyzing knots with minimal double lines and embedding virtual knot theory.
result Virtual knot theory is embedded in the theory of knots in SgimesS1S_{g} imes S^{1}.

We propose a new stochastic coordinate descent method for minimizing the sum of convex functions each of which depends on a small number of coordinates only. Our method (APPROX) is simultaneously Accelerated, Parallel and PROXimal; this is the first time such a method is proposed. In the special case when the number of…

2013-12-20abs ↗pdf ↗

Enhanced Hopfield model boosts memory retrieval capacity.

problem Memory retrieval in modern Hopfield models with limited capacity.
method Introduces a learnable feature map transforming energy function into kernel space, minimizing separation loss for uniform memory distribution.
result Significant reduction in metastable states, enhancing memory capacity and retrieval accuracy.

Let MM be a compact Riemannian manifold of nonnegative Ricci curvature and ΣΣ a compact embedded 2-sided minimal hypersurface in MM. It is proved that there is a dichotomy: If ΣΣ does not separate MM then ΣΣ is totally geodesic and MΣM\setminusΣ is isometric to the Riemannian product Σ×(a,b)Σ\times(a,b), and if ΣΣ se…

2016-05-21abs ↗pdf ↗

We bound the locations of outermost minimal surfaces in geometrostatic manifolds whose ADM mass is small relative to the separation between the black holes and prove the Intrinsic Flat Stability of the Positive Mass Theorem in this setting.

2017-07-10abs ↗pdf ↗