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.

169,181 papers · 148 categories

Trend · papers per month

75151226301 · Jun 202019922001200920182026
48 results for weighted area

New weighted surface area measures for convex bodies with applications.

problem Generalizing surface area measures to weighted Borel measures.
method Formulating and analyzing weighted surface area measures, proving integral formula and Bézout-type inequality.
result New integral formula for mixed measure of three bodies, generalizing Bézout-type inequality.

Asymptotic results for weighted floating bodies are established and used to obtain new proofs for the existence of floating areas on the sphere and in hyperbolic space and to establish the existence of floating areas in Hilbert geometries. Results on weighted best and random approximation and the new approach to floati…

2016-11-13abs ↗pdf ↗

New surface area measures defined for ball-convex bodies, leading to entropy and inequalities.

problem Defining and analyzing surface area measures for ball-convex bodies.
method Introducing LpL_p relative surface areas, proving invariance and inequalities, and using geometric interpretations.
result Established inequalities and a new notion of entropy for ball-convex bodies.

We use a new approach that we call unification to prove that standard weighted double bubbles in nn-dimensional Euclidean space minimize immiscible fluid surface energy, that is, surface area weighted by constants. The result is new for weighted area, and also gives the simplest known proof to date of the (unit weight…

2012-12-19abs ↗pdf ↗

Extends illumination bodies to non-Euclidean spaces and proves their volume derivative defines surface area.

problem Defining surface area in non-Euclidean geometries.
method Generalizes illumination bodies to Riemannian spaces of constant curvature and projective Finsler geometries, proving their volume derivative defines surface area.
result Derivative of volume of illumination bodies defines surface area in non-Euclidean geometries.

Hyperplanes, hyperspheres and hypercylinders in Rn\Bbb R^n with suitable densities are proved to be weighted minimizing by a calibration argument. Also calibration method is used to prove a weighted minimal hypersurface is weighted area-minimizing locally.

2010-04-06abs ↗pdf ↗

Since nn-dimensional λλ-hypersurfaces in the Euclidean space Rn+1\mathbb {R}^{n+1} are critical points of the weighted area functional for the weighted volume-preserving variations, in this paper, we study the rigidity properties of complete λλ-hypersurfaces. We give a gap theorem of complete λλ-hypersurfaces with po…

2014-03-17abs ↗pdf ↗

In this paper we study the functional $\SW_{λ_1,λ_2}$, which is the the sum of the Willmore energy, λ1λ_1-weighted surface area, and λ2λ_2-weighted volume, for surfaces immersed in R3\R^3. This coincides with the Helfrich functional with zero `spontaneous curvature'. Our main result is a complete classification of all …

2012-01-22abs ↗pdf ↗

Study shows how certain metrics can be split into warped products.

problem Understanding conditions under which metrics can be split as warped products.
method Investigating warped area-minimizing hypersurfaces and spectral Ricci/scalar curvature bounds.
result Metrics can be locally split as warped products under specific curvature conditions.

Study proves no minimal surfaces can be contained in certain half-spaces or cones.

problem Prohibiting minimal surfaces from certain geometric configurations.
method Analyzes weighted minimal surfaces in R3\mathbb{R}^3 with height-dependent weights.
result No proper surfaces can be contained in specific half-spaces or cones.

Paper finds relations between Willmore-type energies, weighted areas, and vertical potential energies for cylindrical critical points.

problem Tackles relations between three types of energy functions for cylindrical critical points.
method Uses differential equations and critical point analysis for Willmore-type energies and weighted areas.
result Generating curves coincide for Willmore-type energies and weighted areas, and similar results hold for Willmore-type energies and vertical potential energies.

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.

New illumination bodies defined for ball-convex shapes, proving convexity and establishing surface area measures.

problem Characterizing properties of ball-convex shapes.
method Introducing illumination bodies and weighted illumination bodies, proving convexity, and establishing surface area measures.
result Illumination bodies are convex and provide surface area measures for ball-convex shapes.

The paper proves weighted monotonicity theorems in various spaces and applies them to minimal surfaces.

problem Proving weighted monotonicity theorems in different spaces.
method Proving weighted monotonicity theorems for functions proportional to the metric tensor in Riemannian manifolds.
result Weighted monotonicity theorems in hyperbolic space imply unweighted theorems, leading to bounds on minimal surface areas.

The paper proves Calabi-Bernstein type results for minimal and maximal surfaces in 3D and 3D-L spacetime.

problem Characterizing minimal and maximal surfaces in 3D and 3D-L spacetime.
method Analyzing surfaces with specific properties and using geometric and functional methods.
result Calabi-Bernstein type results for critical points of a weighted area functional in R3\mathbb{R}^{3} and L3\mathbb{L}^{3}.

The paper proves smoothness of almost-minimizers' boundaries near the free boundary.

problem Minimizing degenerate area functionals with weighted boundary conditions.
method Epsilon-regularity theorem applied to almost-minimizers.
result Almost-minimizers' boundaries are C1,γ0C^{1,γ_0}-smooth, orthogonal to the boundary ΩΩ.

Proves a similar inequality to a conjecture about hyperbolic space hypersurfaces.

problem Proving a conjecture about weighted Alexandrov-Fenchel inequalities for hyperbolic space hypersurfaces.
method Analyzes horospherically convex hypersurfaces in hyperbolic space.
result Proves a similar inequality to the conjectured one, provides a counterexample when applicable.

Paper proposes a method for predicting future passenger flow in urban transportation.

problem Predicting future passenger flow in urban transportation development.
method Multi-view localized correlation learning method with adaptive-weight.
result Our method achieves excellent performance compared with other baselines.

Paper proves a sharp weighted Isoperimetric inequality for substatic manifolds.

problem Proving geometric results for substatic Riemannian manifolds.
method Comparison theory based on a newly discovered conformal connection.
result Sharp, weighted Isoperimetric inequality quantifying boundary minimization.

The study connects minimal and maximal surfaces in 3D and 3-L space.

problem Describing correspondences between minimal and maximal surfaces in different spaces.
method Weierstrass representation and asymptotic analysis.
result Established criteria for singularity types and moduli spaces.

LUTNet optimizes FPGA neural network accelerators by leveraging LUTs for inference, achieving significant area savings.

problem Redundancy in deep neural networks and inefficient use of FPGA resources.
method End-to-end hardware-software framework using LUTs to implement any K-input Boolean operation for inference.
result Significant area savings and comparable accuracy compared to state-of-the-art binarized neural networks.

A new model Weighted-SVD improves recommendation accuracy by adjusting latent factor weights.

problem Current Matrix Factorization models assume equal weights for all latent factors, which may not be accurate.
method Integrates linear regression with SVD to allow different weights for latent factors.
result The Weighted-SVD model outperforms other models in RMSE metrics on multiple datasets.

We prove that on a Riemannian manifold, a smooth differential form has a primitive with a given (functional) upper bound provided the necessary weighted isoperimetric inequalities implied by Stokes are satisfied. We apply this to prove a comparison predicted by Gromov between the cofilling function and the filling area…

2005-01-06abs ↗pdf ↗

Random projection improves deep learning performance on high-dimensional data.

problem Training deep neural networks on high-dimensional data is infeasible.
method Prepending the network with an input layer initialized with random projection matrices.
result Neural networks with RP layers achieve competitive or improved performance on high-dimensional datasets.

Paper proposes a training framework for deploying DNNs on analog NVM crossbars, achieving significant efficiency gains.

problem Challenges in deploying deep learning models on microcontrollers due to limited compute and memory resources.
method Developed a training algorithm to eliminate tuning and propose unipolar-weighted matrices to reduce crossbar area and simplify hardware.
result Achieved up to 92.91% accuracy with 2-bit crossbars and up to 45% energy reduction.

SoftAdapt dynamically adjusts loss weights for multi-part functions.

problem Slow convergence and poor weight selection for multi-part loss functions.
method SoftAdapt dynamically changes weights based on live performance statistics.
result Improved convergence and better weight selection for multi-part loss functions.

We prove a generalization of Hsiung-Minkowski formulas for closed submanifolds in semi-Riemannian manifolds with constant curvature. As a corollary, we obtain volume and area upper bounds for k-convex hypersurfaces in terms of a weighted total k-th mean curvature of the hypersurface. We also obtain some Alexandrov-type…

2013-07-11abs ↗pdf ↗

Researchers find continuous solutions to minimizers in weighted least gradient problems.

problem Existence and regularity of minimizers to weighted least gradient problems.
method Constructing continuous solutions using Sternberg-Williams-Ziemer technique extended to inhomogeneous variations.
result Continuous solutions constructed for minimizers in any dimension n≥2, with level sets being minimal surfaces in a conformal metric.

Proposes a new method to initialize neural networks by estimating global curvature of weights.

problem Improving the initialization of neural networks for better training and convergence.
method Estimates the global curvature of weights across layers using the Hessian matrix norm.
result The proposed method helps in more rigorously initializing weights, leading to better performance.

The paper develops a spectral theory for hypergraphs with edge-dependent vertex weights using random walks.

problem Lack of spectral theory for hypergraphs with edge-dependent vertex weights.
method Random walks on hypergraphs with edge-dependent vertex weights, deriving a random walk-based hypergraph Laplacian.
result Random walks on hypergraphs with edge-dependent vertex weights can capture higher-order relationships in data.

OverQ increases model accuracy by handling outliers in neural networks with minimal hardware changes.

problem Handling outliers in neural network weights and activations for low-precision quantization.
method Overwrite quantization (OverQ) that opportunistically increases bitwidth for activation outliers.
result OverQ can handle over 90% of outliers and achieve +5% ImageNet Top-1 accuracy on a quantized ResNet-50 at 4 bits.