A new learning scheme improves model efficiency and performance.
problem Characterizing correlation between batch-level and global data distributions.
method Epoch-evolving Gaussian Process Guided Learning (GPGL) scheme with context labels and triangle consistency loss.
result Significantly outperforms existing models on mainstream datasets.
In this paper, we consider the exact triangles consisting of stable vector bundles on one-dimensional complex tori, and give a geometric interpretation of them in terms of the corresponding Fukaya category via the homological mirror symmetry.
New algorithm estimates causal effects for non-Gaussian data.
problem Estimating causal effects in non-Gaussian distributions.
method Generalized k-Triangle Faithfulness Assumption and Edge Estimation Algorithm.
result Uniformly consistent estimates of causal effects.
The paper establishes conditions for Bayesian consistency in supremum metric.
problem Ensuring Bayesian consistency in the supremum metric.
method Using a triangle inequality and weak convergence, the paper establishes conditions for Bayesian consistency.
result Demonstrates supremum consistency with weaker conditions than previously used.
Triangle fees adjust fees based on trade size and price movement, improving price accuracy and revenue.
problem Price staleness and low fee revenue in AMMs.
method Decreasing marginal fees proportional to price movement, creating incentives for price accuracy.
result Triangle fees strictly improve the Pareto frontier of price accuracy versus losses.
Algorithm reconstructs triangle-free networks from data, certifying correctness.
problem Reconstructing triangle-free dynamic networks from observational data.
method Developed an algorithm for triangle-free networks, providing guarantees on correctness.
result Algorithm either certifies correctness or outputs a sparser graph with no false positives.
Road Network Metric Learning improves ETA prediction accuracy by addressing data sparsity.
problem Data sparsity in road network embedding vectors affects ETA prediction accuracy.
method Proposes Road Network Metric Learning (RNML-ETA) framework with an auxiliary metric learning task and triangle loss.
result RNML-ETA outperforms state-of-the-art models and improves prediction accuracy for cold links.
Let (Xn,Xˇn) be a mirror pair of an n-dimensional complex torus Xn and its mirror partner Xˇn. Then, a simple projectively flat bundle E(L,L)→Xn is constructed from each affine Lagrangian submanifold L in Xˇn with a unitary local system $\mathcal{L} \righta…
New neural nets respect triangle inequality, improving graph and reinforcement learning performance.
problem Neural nets lack inductive bias for certain subadditive distances.
method Introduced novel architectures that universally approximate norm-induced metrics.
result Neural nets with triangle inequality inductive bias outperform existing approaches.
Suppose that the initial triangle formed by the three moving masses of the three-body problem is similar to the triangle formed at some later time. We derive a simple integral formula for the overall rotation relating the two triangles. The formula is based on the fact that the space of similarity classes of triangles …
We prove that the cosine law for spherical triangles and spherical tetrahedra defines integrable systems, both in the sense of multidimensional consistency and in the sense of dynamical systems.
Paper addresses unbalanced data in common shock models for loss reserving.
problem Complications in capturing structural dependence with unbalanced data.
method Introduces a common shock Tweedie approach for unbalanced data.
result Better balance of common shock proportions and parsimonious solution.
Let K be a closed polygonal curve in $\RR^3$ consisting of n line segments. Assume that K is unknotted, so that it is the boundary of an embedded disk in $\RR^3$. This paper considers the question: How many triangles are needed to triangulate a Piecewise-Linear (PL) spanning disk of K? The main result exhibits …
Study Steklov eigenvalues on hyperbolic triangle-tiling graphs.
problem Analyzing Steklov eigenvalues on specific hyperbolic graph structures.
method Introduced a graph roughly isometric to hyperbolic plane, used discretization to transfer bounds.
result Steklov eigenvalues tend to zero proportionally to the inverse of the domain size.
In 1976, Dodziuk and Patodi employed Whitney forms to define a combinatorial codifferential operator on cochains, and they raised the question whether it is consistent in the sense that for a smooth enough differential form the combinatorial codifferential of the associated cochain converges to the exterior codifferent…
Chain-ladder reserving is sensitive to outliers, leading to unreliable estimates.
problem Sensitivity of loss reserving techniques to outliers.
method Derivation of impact functions for reserves and mean squared errors of prediction under Mack's Model.
result Impact of outliers varies widely in a loss triangle and depends on other cells.
A Triangle Generative Adversarial Network (Δ-GAN) is developed for semi-supervised cross-domain joint distribution matching, where the training data consists of samples from each domain, and supervision of domain correspondence is provided by only a few paired samples. Δ-GAN consists of four neural networks, two ge…
Napoleonic triangles don't exist in hyperbolic geometry.
problem The existence of Napoleonic triangles in hyperbolic geometry.
method Analyzing the construction of equilateral triangles on hyperbolic triangles.
result Hyperbolic triangles do not form Napoleonic triangles, except equilateral ones.
New bounds on inscribed triangles in arbitrary planar domains.
problem Finding inscribed triangles in arbitrary planar domains with specific angle constraints.
method Proving the existence of uniformly fat triangles and not-too-fat triangles in bounded open sets.
result Existence of a maximal number Θ (between 0 and 60) for inscribed triangles with angles ≥ Θ degrees.
We review some developments on clustering stochastic processes and come with the conclusion that asymptotically consistent clustering algorithms can be obtained when the processes are ergodic and the dissimilarity measure satisfies the triangle inequality. Examples are provided when the processes are distribution ergod…
Paper calculates eigenvalues of a specific triangle on a sphere.
problem Computing eigenvalues of a specific triangle on a sphere.
method Computed first two Dirichlet eigenvalues and eigenfunctions of the equilateral Schwarz triangle (3/2 3/2 3/2) on the sphere.
result Computed the first two Dirichlet eigenvalues and eigenfunctions of the equilateral Schwarz triangle (3/2 3/2 3/2).
Study on Laplacian determinant in isosceles triangles, finding equilateral triangle minimizes determinant.
problem Finding the minimum of the spectral determinant on isosceles triangles.
method Analyzing the determinant of the Laplacian on Euclidean isosceles triangle envelopes of fixed area.
result Equilateral triangle envelope minimizes the determinant of the Laplacian.
New method shows any triangle group generating pair is related to special coverings.
problem Understanding generating pairs of triangle groups.
method Special almost orbifold coverings.
result Any generating pair of a triangle group is represented by a special covering.
Complex hyperbolic triangle groups were first considered by Mostow in building the first nonarithmetic lattices in PU(2, 1). They are a natural generalization of the classical triangle groups acting on the hyperbolic plane. A well-known theorem of Takeuchi is that there are only finitely many Fuchsian triangle groups t…
Defines band maps in unoriented link Floer homology forming a skein exact triangle.
problem Understanding unoriented link Floer homology through band maps.
method Defines and analyzes band maps in unoriented link Floer homology.
result Band maps form an unoriented skein exact triangle.
Proves a new skein exact triangle for real monopole Floer homology.
problem None explicitly stated; focuses on proving a new mathematical structure.
method Introduces a new exact triangle for real monopole Floer homology.
result Proves an unoriented skein exact triangle for real monopole Floer homology.
New surgery exact triangles in Heegaard Floer homology for rational slopes.
problem Constructing new surgery exact triangles in Heegaard Floer homology.
method Combining combinatorial triangle and quadrilateral counting in genus 1 Heegaard diagrams.
result Solving the combinatorial problem for rational slopes, including tricky cases.
Neural network model improves loss reserving accuracy and distribution flexibility.
problem Accurate estimation of claim variability alongside central estimates.
method Mixture Density Neural Network (MDN) with rolling-origin approach.
result MDN consistently outperforms classical models for central estimates and quantiles.
We answer the question "Does the Y-triangle move preserve intrinsic knottedness?" in the negative by giving an example of a graph that is obtained from the intrinsically knotted graph K_7 by triangle-Y and Y-triangle moves but is not intrinsically knotted.
Study calculates eigenvalues and eigenfunctions for spherical triangles and finds fundamental gap behavior.
problem Understanding eigenvalues and gaps in spherical triangles.
method Explicit computation of Dirichlet eigenvalues and eigenfunctions for spherical lunes and triangles.
result Fundamental gap of spherical triangles increases as the angle of the lune decreases.
We show that the triangle with angles Pi/12, Pi/3 and 7*Pi/12 has the lattice property and compute this triangle's Veech group.
Unified surrogate loss framework for multi-label learning with strong consistency guarantees.
problem Improving consistency and accounting for label correlations in multi-label learning.
method Introducing multi-label logistic loss and extending it to comprehensive multi-label comp-sum losses, proving strong consistency guarantees for any multi-label loss.
result Unified surrogate loss framework benefiting from strong consistency guarantees for any multi-label loss.
We study side-lengths of triangles in path metric spaces. We prove that unless such a space X is bounded, or quasi-isometric to line or half-line, every triple of real numbers satisfying the strict triangle inequalities, is realized by the side-lengths of a triangle in X. We construct an example of a complete path metr…
Two triples of triangles having pairwise disjoint outlines in 3-space are called combinatorially isotopic if one triple can be obtained from the other by a continuous motion during which the outlines of the triangles remain pairwise disjoint. We conjecture that it can be algorithmically checked if an (ordered or unorde…
New method proves mateability of triangle groups with Blaschke products.
problem Proving mateability of triangle groups with Blaschke products.
method Associating two piecewise analytic circle maps to the triangle group, mating these with Blaschke products, and constructing a common lift.
result Proves mateability of all cusped triangle groups with suitable Blaschke products.
In this paper we study the area of ideals triangles in a convex domain with its Hilbert geometry. We obtain a characterization of the hyperbolic geometry among all the Hilbert geometry in terms of area of ideals triangles. We also obtain a sharp lower bound on the hilbert area of ideal triangles, independant of the con…
In Lorentzian geometry, limited definition of angles restricts the use of angle bisectors in study of triangles. This paper redefines angle bisectors so that they can be used to study attributes of triangles. Using the new definition, this paper investigates the existence of the incenter and the isogonal conjugate of a…
A formula for Rademacher symbols in triangle groups is provided.
problem No specific problem stated; focuses on a mathematical formula.
method Presentation of an explicit formula for Rademacher symbols.
result Generalizes Ghys' proof of modular knot linking numbers.
Study stabilizers of complex hyperbolic triangle groups, finding generators and signatures.
problem Understanding the stabilizers of complex hyperbolic triangle groups.
method Explicit generators and signatures of stabilizers computed for each group orbit of mirrors.
result Explicit generators and signatures of stabilizers for some triangle groups.
Criterion for stopping conjugacy class enumeration in triangle groups.
problem Enumerating all conjugacy classes in cocompact triangle groups.
method Encoding by P. Dehornoy and T. Pinsky; stopping criterion based on geometric length.
result Stopping criterion for the generation of conjugacy classes in cocompact triangle groups.
New skein exact triangles for link Floer homology.
problem Understanding link Floer homology through skein relations.
method Construction of skein triples for rational tangles.
result Established a framework for potential further skein exact triangles.
Study of loss functions for learning to defer, proving consistency.
problem Learning to defer in machine learning.
method Introduced a family of surrogate losses parameterized by Ψ and proved their consistency. result Proved realizable H-consistency and Bayes-consistency of specific surrogate losses. New theorem disproves Angle Defect for super triangles.
problem Angle Defect Theorem for N=1 super hyperbolic geometry.
method Action of OSp(1|2) on real super Minkowski space and brute-force computation.
result Disproves Angle Defect Theorem and provides novel additive function.
The study examines Lipschitz normally embedded Hölder triangles in 4D space.
problem Comparing ambient and outer Lipschitz geometry of Hölder triangles.
method Analyzes Lipschitz normally embedded Hölder triangles in \(\mathbb{R}^4\).
result Infinitely many equivalence classes of microknots.
Triangle Artin groups split as graphs of free groups under specific conditions.
problem Conditions for triangle Artin groups to split as graphs of free groups.
method Graph of free groups analysis and poly-free property proof.
result Triangle Artin groups split as graphs of free groups if and only if labels are greater than 5 and even.
The paper finds extremum values for mixed Laplacian eigenvalues on triangles and trapezoids.
problem Finding extremum values for mixed eigenvalues of the Laplacian on triangles and trapezoids.
method Characterizations obtained under suitable geometric constraints.
result Characterizations of extremum values for mixed eigenvalues of the Laplacian on triangles and trapezoids.
Study on 3D surfaces and tangles formed by Poncelet triangles.
problem Geometric and topological properties of 3D surfaces and tangles.
method Exploration of Poncelet triangles and associated points.
result Properties of 3D surfaces and tangles formed by Poncelet triangles.
Study of subgroups in complex hyperbolic lattice triangle groups.
problem Characterizing subgroups of finite index in complex hyperbolic lattice triangle groups.
method Explicit construction and analysis of subgroups, examination of their properties.
result Identification of neat subgroups, subgroups with positive first Betti number, and homomorphisms onto non-Abelian free groups.