Optimizes vessel hull forms using PCA and DNN.
problem Designing optimal hull forms for vessel performances.
method PCA compresses hull forms, DNN predicts performances.
result DNN accurately predicts hull form performances.
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “hull optimization”
Optimal algorithm finds if point is in convex hull of distributions.
problem Determining if a point is inside the convex hull of means of multiple distributions.
method Thompson-CHM algorithm with modular design of stopping and sampling rules.
result First asymptotically optimal algorithm for CHM problem in one dimension.
Estimating the Convex Hull of the Image of a Set with Smooth Boundary: Error Bounds and Applicationsmath.OC
Estimates convex hulls of smooth function images with error bounds.
problem Estimating the convex hull of the image of a smooth boundary set.
method Using submersion properties and sampling inputs, derive bounds on Hausdorff distance.
result New tighter and more general error bounds for geometric inference.
The study approximates nearly optimal Lasso solutions using convex hulls.
problem Finding diverse yet nearly optimal Lasso solutions.
method Formulate problem as approximating nearly optimal solutions with a convex hull of sampled extreme points. Use a greedy algorithm to select a small number of points.
result The proposed algorithm can approximate the solution set well and obtain diverse Lasso solutions.
Sketching algorithm finds closest point on convex hull efficiently.
problem Finding the closest point on a convex hull of large datasets.
method Sketching procedure to exploit data structure, gradient project method.
result Faster solution than standard optimization algorithms.
The paper develops mixed-integer formulations for neural networks using partitioning.
problem Optimizing trained ReLU neural networks with balanced model size and tightness.
method Partitioning node inputs into groups, forming the convex hull via disjunctive programming.
result The proposed formulations outperform existing ones, especially with fewer partitions.
New approach to convex hulls for low-rank problems.
problem Characterizing convex hulls for low-rank sets.
method Matrix perspective function and orthogonal projection matrices.
result Strong relaxations for various low-rank problems.
New conditions ensure Dantzig-Wolfe relaxation matches rank-constrained optimization problems.
problem Rank-constrained optimization problems with linear matrix inequalities.
method Investigates Dantzig-Wolfe relaxation and develops conditions for exactness.
result Conditions for extreme point, convex hull, and objective exactness.
Optimum in Convex Hulls (OCH) generalizes clinical trial results to broader populations.
problem Clinical trials exclude confounding but limit recruitment; observational data are more inclusive but suffer from confounding.
method OCH uses convex hulls of conditional expectations or densities to approximate the true treatment effect from both observational and trial data.
result OCH estimates the treatment effect with state-of-the-art accuracy in terms of both expectations and densities.
NNLMs optimize poorly for word probabilities due to embedding space structure.
problem NNLMs assign suboptimal probabilities to some words.
method Analyzed the inductive bias of NNLMs and the structure of word embeddings.
result Words on the convex hull have bounded probability, affecting others.
Optimizes UUV hull design with a two-orders-of-magnitude speedup.
problem Designing efficient underwater vehicle hulls using CFD simulations.
method Bayesian Optimization-LCB algorithm and DNN-based surrogate model.
result Two-orders-of-magnitude speedup in design optimization process.
We present a nonstandard hull construction for locally uniform groups in a spirit similar to Luxembourg's construction of the nonstandard hull of a uniform space. Our nonstandard hull is a local group rather than a global group. We investigate how this construction varies as one changes the family of pseudometrics used…
Paper develops compact formulations for optimization problems with rank-one convex functions and indicator variables.
problem Optimization problems involving rank-one convex functions with support constraints.
method Perspective reformulation techniques to exploit conic structure and establish convex hull results.
result Systematic perspective formulations for convex hull descriptions of sets with nonlinear separable or non-separable objective functions and combinatorial constraints.
The paper characterizes sets with infinite hyperbolic convex hull volume.
problem Characterizing sets with infinite hyperbolic convex hull volume.
method Geometric conditions and self-similar sets.
result Characterizes continua and planar self-similar sets with infinite hyperbolic convex hull volume.
The n-th hull of a union of curves in R^3 is the set of points with the property: Any plane passing through the point intersects the curves at least 2n times. The hull number u(L) of a link L is defined as the minimum number of non-empty hulls a representative of L can have. We show that the hull numbers of torus links…
Minimal hulls of compact sets in math.DG
The main result of this paper is a characterization of the minimal surface hull of a compact set in by sequences of conformal minimal discs whose boundaries converge to in the measure theoretic sense, and also by -dimensional minimal currents which are limits of Green currents supported by conf…
A new method solves convex optimization on curved spaces.
problem Optimization on curved spaces with non-smooth functions.
method Convex bundle method on Riemannian manifolds.
result The method converges to a minimizer under mild conditions.
Develops harmonic metrics for Hull-Strominger system stability.
problem Existence of solutions to the Hull-Strominger system with balanced class.
method Uses non-Hermitian Yang-Mills connections and holomorphic Courant algebroids, introduces harmonic metrics.
result Expected existence of a numerical stability condition for generic families of solutions.
Study analyzes correlation structure in two-factor Hull-White model for XVA calculations.
problem Capturing the correlation structure in two-factor Hull-White model for accurate XVA calculations.
method Combination of approximation formula and Monte-Carlo simulation to investigate correlation structure.
result Hull-White model effectively captures de-correlation of the yield curve under specific parameter conditions.
Deep learning models generalize by extending decision boundaries outside the convex hull of training data.
problem Understanding how deep learning models generalize beyond their training data.
method Investigation of decision boundaries inside and outside the convex hull of training sets, using various neural network architectures and training regimes.
result Over-parameterization is necessary for deep learning models to extend decision boundaries outside the convex hull of their training data.
Study shows non-compact convex hulls in certain metric spaces.
problem Compactness of convex hulls in weakly non-positive curvature spaces.
method Introduced a conical geodesic bicombing and used it to construct a counterexample.
result Existence of a metric space with a finite subset whose convex hull is not compact.
The paper transforms a convex hull into a concave surface around a point cloud.
problem Creating a concave surface that encloses all points in a point cloud.
method Iterative facet replacement and expansion of the convex hull.
result A method to evolve a convex hull into a concave surface that fits the point cloud.
The integer hull of a polyhedron is the convex hull of the integer points contained in it. We show that the vertices of the integer hulls of a rational family of polyhedra of size O(n) have quasipolynomial coordinates. As a corollary, we show that the stable commutator length of elements in a surgery family is a ratio …
Study characterizes hulls and capacities on Riemannian manifolds, proving isoperimetric inequalities.
problem Characterizing hulls and capacities on Riemannian manifolds.
method Investigates strictly outward minimising hulls and uses p-capacities to recover their areas.
result Sharp isoperimetric inequality on complete noncompact manifolds with nonnegative Ricci curvature.
The convex hull of a set K in space consists of points which are, in a certain sense, "surrounded" by K. When K is a closed curve, we define its higher hulls, consisting of points which are "multiply surrounded" by the curve. Our main theorem shows that if a curve is knotted then it has a nonempty second hull. This pro…
A new proof of the description of the convex hull of space curves with totally positive torsionmath.PR
New proofs given for space curves with totally positive torsion.
problem Description of convex hulls of space curves with totally positive torsion.
method New proofs of parametric representation, surface area, and volume formulas.
result Recovery of formulas for convex hull's surface area and volume.
Traditional nearest points methods use all the samples in an image set to construct a single convex or affine hull model for classification. However, strong artificial features and noisy data may be generated from combinations of training samples when significant intra-class variations and/or noise occur in the image s…
New solutions found for Hull-Strominger system on torus bundles.
problem Finding solutions to the Hull-Strominger system with torus symmetry.
method Constructing solutions on torus bundles over K3 orbifolds.
result Smooth manifolds with complex structures have solutions to the Hull-Strominger system.
We introduce the notion of a ``projective hull'' for subsets of complex projective varieties, parallel to the idea of the polynomial hull in affine varieties. With this concept, a generalization of J. Wermer's classical theorem on the hull of a curve in is established in the projective setting. The projective hul…
Conditioning random points by the number of vertices of their convex hull: the bi-pointed casemath.PR
The paper studies the convex hull of random points in a triangle, focusing on the asymptotic behavior and phase transitions.
problem Analyzing the convex hull of random points in a triangle with a phase transition.
method Conditional analysis of the convex hull's boundary size and shape, proving phase transitions and convergence to specific curves.
result The convex hull's boundary converges to a hyperbola or parabola under specific conditions, solving an optimization problem.
Researchers link vertex algebras to non-Kähler solutions of the Hull-Strominger system.
problem Constructing representations of vertex algebras from non-Kähler solutions of the Hull-Strominger system.
method Embedding the N=2 superconformal vertex algebra in the chiral de Rham complex of a string Courant algebroid, with a condition on the Hermitian-Yang-Mills connection.
result Any solution of the Hull-Strominger system satisfying the Hermitian-Yang-Mills condition has an associated N=2 embedding.
Direct proof of implication between geometric convex hull statements.
problem Deriving one geometric convex hull statement from another.
method Direct proof of implication between statements.
result Direct derivation of one geometric convex hull statement from another.
Study finds knots with ideal length need not have smallest volume.
problem Tackles the conjecture that ideal knot length equals smallest volume.
method Measures convex hull volume of knots during length annealing.
result Identifies knots with non-ideal global minimum volume.
Study reduces human labeling in LLM-based classification systems.
problem Minimizing human intervention in training LLM-based classification systems.
method Active learning framework with Conservative Hull-based Classifier (CHC), Center-based Classifier (CC), and Generalized Hull-based Classifier (GHC).
result CHC achieves regret and is minimax optimal for . GHC bridges the gap between different regimes.
Positive weights improve kernel quadrature's accuracy.
problem Improving kernel quadrature weights to be positive and stable.
method Using convex geometry to approximate the kernel mean embedding with positive weights.
result Positive weights lead to improved kernel quadrature bounds with Monte-Carlo-beating rates.
Study Hull-Strominger system and Anomaly flow on specific solvmanifolds.
problem Characterize invariant solutions to Hull-Strominger system and investigate flow of invariant metrics.
method Characterization of invariant solutions using Gauduchon connections, investigation of Anomaly flow, and proof of flow immortality under certain conditions.
result Anomaly flow reduces to a special form and always converges to a Kähler metric when slope parameter is zero.
New solutions found for complex structures on specific manifolds.
problem Constructing smooth solutions to the Hull-Strominger system.
method Using fibrations over K3 orbisurfaces.
result Proved existence of solutions for certain manifolds.
Study convex hulls of orbits for compact groups, defining new invariants related to polynomial degrees.
problem Understanding properties of convex hulls of coadjoint orbits of compact groups.
method Introduce partial convex hulls and use them to define numerical invariants.
result Orbits with new invariants form rational convex polyhedral cones related to Littlewood-Richardson cones.
Proposes a faster algorithm for machine learning problems.
problem General minimum conical hull problems in machine learning.
method Sublinear classical algorithm for general minimum conical hull problems.
result Achieves exponential speedup over existing methods.
For a convex curve in an even-dimensional affine space we introduce a series of convex domains (called Young hulls), describe their structure and give a formulas fo the volume of the biggest of these domains. This paper is an attempt to generalize the classical isoperimetric inequality for the volume of the convex hull…
We study a hybrid tree-finite difference method which permits to obtain efficient and accurate European and American option prices in the Heston Hull-White and Heston Hull-White2d models. Moreover, as a by-product, we provide a new simulation scheme to be used for Monte Carlo evaluations. Numerical results show the rel…
Researchers solve a market model with stochastic interest rate using worst case approach.
problem Finding the worst case measure for a market with a stochastic interest rate.
method Formulated as a stochastic game, solved using PDE methods and verified with precise argument.
result The worst case measure is not a martingale measure in the given market model.
We obtain an upper bound for the volume of the convex hull of a simple closed Frenet curve with exactly four vertices, i.e., four points of vanishing torsion, and lying on the boundary of its convex hull. Moreover, we show that the upper bound is attained when the curve intersects every plane in at most four points, a …
New flow defined to solve Hull-Strominger system, with estimates and convergence results.
problem Constructing solutions to the Hull-Strominger system of equations.
method Introducing a natural extension of pluriclosed flow and using string algebroids and higher gauge theory.
result Proves global existence and convergence of the flow on special backgrounds.
New solutions found for complex geometry problem.
problem Solving the Hull-Strominger system on non-Kähler manifolds.
method Constructing solutions with a specific connection ansatz and using moduli spaces of sheaves.
result First T-dual solutions on compact non-Kähler manifolds with different topology.
We compute the algebraic hull of the Kontsevich-Zorich cocycle over any GL^+_2(R) invariant subvariety of the Hodge bundle, and derive from this finiteness results on such subvarieties.
We show how to construct the nonstandard hull of certain infinite-dimensional Lie algebras in order to generalize a theorem of Pestov on the enlargeability of Banach-Lie algebras. In the process, we consider a nonstandard smoothness condition on functions between locally convex spaces to ensure that the induced functio…
Greedy optimization methods such as Matching Pursuit (MP) and Frank-Wolfe (FW) algorithms regained popularity in recent years due to their simplicity, effectiveness and theoretical guarantees. MP and FW address optimization over the linear span and the convex hull of a set of atoms, respectively. In this paper, we cons…