New invariants show stronger virtual knot sets.
problem Classifying virtual knots using invariants.
method Defining -order invariants using forbidden moves.
result Set of -order invariants is strictly stronger.
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,657 papers · 148 categories
Trend · papers per month
48 results for “ordered sets”
The main goal of this paper is to develop a concept of approximate differentiability of higher order for subsets of the Euclidean space that allows to characterize higher order rectifiable sets, extending somehow well known facts for functions. We emphasize that for every subset of the Euclidean space and for eve…
Extends first-order flexes of surfaces to second-order flexes.
problem Extending flexes of surfaces to higher order.
method Analyzes first-order flexes of smooth surfaces tangent to nonrigid surfaces.
result First-order flexes can be extended to second-order flexes.
Paper discusses optimal CP for second-order predictions.
problem How to incorporate second-order predictions into conformal prediction.
method Introduces Bernoulli prediction sets (BPS) for second-order predictions and applies conformal risk control for compromised validity.
result BPS provides the smallest prediction sets with conditional coverage.
A novel transformer model improves classification of partially ordered sequences.
problem Classification of partially ordered sequences with uncertainty in timestamps.
method Developed a transformer-based model for partially ordered sequences, benchmarked against set models.
result Transformer-based model outperforms set models on three datasets.
Ribbon cobordisms form a partial order on 3-manifolds.
problem Understanding the partial order structure of 3-manifolds.
method Building on Agol's proof for knots, we extend the partial order to 3-manifolds.
result Ribbon rational homology cobordism forms a partial order.
Given a linearly ordered set I, every surjective map p: A --> I endows the set A with a structure of set of preferences by "replacing" the elements of I with their inverse images via p considered as "balloons" (sets endowed with an equivalence relation), lifting the linear order on A, and "agglutinating" this structure…
This paper deals with multivariate regression chain graphs (MVR CGs), which were introduced by Cox and Wermuth [3,4] to represent linear causal models with correlated errors. We consider the PC-like algorithm for structure learning of MVR CGs, which is a constraint-based method proposed by Sonntag and Peña in [18]. We …
Algorithm learns causal structures from low-order conditional independencies.
problem Estimating high-order conditional independencies from data is challenging.
method Proposes an algorithm to compute a faithful graphical representation from low-order conditional independencies.
result Algorithm successfully learns causal structures from zero- and first-order conditional independencies.
Nilpotent Lie algebras obtained from ordered sets and quivers are algebraic Ricci solitons.
problem Constructing nilpotent Lie algebras as algebraic Ricci solitons
method Using transitively and antisymmetrically ordered sets (TAOSs) and incidence algebras
result Nilpotent Lie algebras with arbitrarily high degrees of nilpotency are algebraic Ricci solitons
In this paper we determine a number of meaningful compositions of higher order of a set of functions, which is considered in Malesevic (1998), in implicit and explicit form. Results which are obtained are applied to the vector analysis in order to determine the number of meaningful differential operations of higher ord…
The present paper develops two concepts of pointwise differentiability of higher order for arbitrary subsets of Euclidean space defined by comparing their distance functions to those of smooth submanifolds. Results include that differentials are Borel functions, higher order rectifiability of the set of differentiabili…
Second-order guarantees for federated learning algorithms.
problem Non-convex optimization in federated learning with saddle-points as bottlenecks.
method Drawing on recent results on second-order optimality in centralized and decentralized settings, establish second-order guarantees for federated learning algorithms.
result Established second-order guarantees for federated learning algorithms.
We consider constraint-based methods for causal structure learning, such as the PC-, FCI-, RFCI- and CCD- algorithms (Spirtes et al. (2000, 1993), Richardson (1996), Colombo et al. (2012), Claassen et al. (2013)). The first step of all these algorithms consists of the PC-algorithm. This algorithm is known to be order-d…
Let be a number field and be a central simple algebra over of dimension where is prime. In the case that we assume that is not totally definite. In this paper we study sets of pairwise nonisomorphic maximal orders of with the property that a -order of rank embeds i…
We find the complete set of fundamental invariants for systems of ordinary differential equations of order under the group of point transformations generalizing similar results for contact invariants of a single ODE and point invariants of systems of the second and the third order. It turns out that starting fr…
Defining the -th stratum of a closed subset of an dimensional Euclidean space to consist of those points, where it can be touched by a ball from at least linearly independent directions, we establish that the -th stratum is second-order rectifiable of dimension and a Borel set. This was known for co…
Two algorithms solve nonconvex minimax problems with linear constraints, achieving complexity guarantees.
problem Nonconvex minimax problems with coupled linear constraints.
method Zeroth-order primal-dual alternating projected gradient (ZO-PDAPG) and zeroth-order regularized momentum primal-dual projected gradient (ZO-RMPDPG) algorithms.
result Iteration complexity guarantees for solving nonconvex-(strongly) concave minimax problems with coupled linear constraints.
Groups acting on bifoliated planes are left-orderable.
problem Characterizing groups acting on bifoliated planes.
method Construction of a linear order on leaf space ends and identification with boundary circle subsets.
result Groups acting on bifoliated planes are left-orderable.
New method for zeroth-order stochastic gradient algorithms provides confidence intervals.
problem Lack of inferential capabilities for zeroth-order stochastic gradient algorithms.
method Established central limit theorem and provided online estimators for asymptotic covariance matrix.
result Asymptotically valid confidence sets for parameter estimation and prediction.
The paper defines circular orderability for quandles and explores their properties.
problem Understanding the structure of quandles through circular orderings.
method Introduced circular orderability for quandles, showed embedding properties, and provided examples.
result Spaces of circular orderings embed in the space of all orderings, and examples of non-circularly orderable quandles are given.
We give a survey of some recent papers by the authors and Masaaki Wada relating the twisted Alexander polynomial with a partial order on the set of prime knots. We also give examples and pose open problems.
New set class preserves Fourier series terms for planar ovals, leading to isoperimetric inequalities.
problem Investigate geometric properties of th Order Preserving Sets and ovals.
method Introduce and analyze th Order Preserving Sets and Midpoint Sets; study geometric properties and isoperimetric inequalities.
result Established an isoperimetric-type inequality relating perimeter and area of ovals and their associated sets.
Bandit algorithms have been predominantly analyzed in the convex setting with function-value based stationary regret as the performance measure. In this paper, motivated by online reinforcement learning problems, we propose and analyze bandit algorithms for both general and structured nonconvex problems with nonstation…
Ordering examples in modular arithmetic training affects model performance.
problem Training efficiency and model performance in modular arithmetic.
method Varying example ordering while keeping other conditions constant.
result Adversarially structured ordering suppresses learning, while fixed-ordering strategies achieve high accuracy.
This paper presents a geometric-variational approach to continuous and discrete {\it second-order} field theories following the methodology of \cite{MPS}. Staying entirely in the Lagrangian framework and letting denote the configuration fiber bundle, we show that both the multisymplectic structure on as well…
The paper proves tight fibered knots are minimal in a specific knot order.
problem Understanding the minimality of tight fibered knots.
method Proved ribbon concordance forms a partial order and used it to show tight fibered knots are minimal.
result All tight fibered knots are minimal in the ribbon concordance order.
We study the multiplicity sets of first order symbols associated with differential operators on two dimensional surfaces. This work is inspired by the phenomenon of conical refraction explained by the existence of singularities in the Fresnel hyper-surface for Maxwell's equations on an anisotropic crystal.
Proves a quasi-order on fibre surfaces of positive braid links.
problem Ordering fibre surfaces of positive braid links.
method Analyzes quasipositive surfaces and their inclusions.
result Induced order on fibre surfaces is a well-quasi-order under certain conditions.
Motivated by well known results in low-dimensional topology, we introduce and study a topology on the set CO(G) of all left-invariant circular orders on a fixed countable and discrete group G. CO(G) contains as a closed subspace LO(G), the space of all left-invariant linear orders of G, as first topologized by Sikora. …
New depth function for partial orders helps compare machine learning algorithms.
problem Comparing machine learning algorithms using non-standard data types.
method Adapted simplicial depth to partial orders, using ufg depth for comparison.
result Demonstrates promising variety of analysis approaches based on ufg methods.
New method for identifying best designs in vector optimization with uncertain feedback.
problem Optimizing vector-valued outcomes with uncertain preferences.
method Stochastic bandit feedback, polyhedral ordering cone, ()-PAC Pareto set identification.
result Sample complexity characterized and matched by the naïve elimination algorithm.
Study convex embeddability in linear and circular orders, applying to knots.
problem Understanding the quasi-order of convex embeddability in linear and circular orders.
method Combinatorial and descriptive set-theoretic methods applied to arcs and knots.
result Established combinatorial properties and lower bounds for knot complexity.
In this paper we use continued fractions to study a partial order on the set of 2-bridge knots derived from the work of Ohtsuki, Riley, and Sakuma. We establish necessary and sufficient conditions for any set of 2-bridge knots to have an upper bound with respect to the partial order. Moreover, given any 2-bridge knot K…
New algorithms optimize constrained problems faster, avoiding full set optimization.
problem Optimizing constrained problems efficiently and quickly.
method Designing accelerated first-order algorithms that avoid full set optimization.
result Proved convergence to stationary points in nonconvex settings and accelerated rates in convex settings.
Predicting Sequences of Traversed Nodes in Graphs using Network Models with Multiple Higher Orderscs.LG
Predicts node sequences in graphs using multi-order network models.
problem Predicting sequences of node traversals in graphs.
method Combines multiple higher-order network models into a multi-order model, fitting and selecting the optimal maximum order.
result Outperforms state-of-the-art algorithms for next-element and full sequence prediction.
New algorithms optimize convex functions with high-order derivatives.
problem Optimizing convex functions with high-order derivatives under various norms.
method Developed a non-Euclidean inexact accelerated proximal point method using an inexact uniformly convex regularizer.
result Showed nearly optimal algorithms for high dimensions in the black-box oracle model for -settings and all .
We describe the algebra of finite order invariants on the set of all -torus knots.
Curriculum learning shows marginal benefits over random ordering on standard datasets.
problem Investigating the benefits of curriculum learning over random ordering in training neural networks.
method Experiments with curriculum, anti-curriculum, and random-curriculum orderings on various datasets and conditions.
result Curriculum learning only marginally improves performance on standard datasets and is outperformed by random ordering.
In this paper we provide a characterization of second order fully nonlinear CR invariant equations on the Heisenberg group, which is the analogue in the CR setting of the result proved in the Euclidean setting by A. Li and the first author (2003). We also prove a comparison principle for solutions of second order fully…
Given a solution to a linear homogeneous second order elliptic equation with Lipschitz coefficients, we introduce techniques for giving improved estimates of the critical set $\Cr(u)\equiv \{x:|\nabla u|(x)=0\}$. The results are new even for harmonic functions on $\dR^n$. Given such a , the standard {\it first o…
In this paper, we propose and analyze zeroth-order stochastic approximation algorithms for nonconvex and convex optimization, with a focus on addressing constrained optimization, high-dimensional setting and saddle-point avoiding. To handle constrained optimization, we first propose generalizations of the conditional g…
Bayesian theory explains market impact of large trades.
problem Reduction of price impact from large trades.
method Bayesian approach incorporating all trade information.
result Recovery of market impact laws including square-root and linear regimes.
A left order on a magma (e.g., semigroup) is a total order of its elements that is left invariant under the magma operation. A natural topology can be introduced on the set of all left orders of an arbitrary magma. We prove that this topological space is compact. Interesting examples of nonassociative magmas, whose spa…
New method reduces ensemble size for linear bandits, achieving near optimal regret.
problem Achieving near optimal regret in linear bandits with limited ensemble size.
method Ensemble sampling with a size of order for a -dimensional stochastic linear bandit.
result Regret is at most , improving over linear scaling with .
Rational homology ribbon cobordism defines a partial order on 3-manifolds.
problem Classifying 3-manifolds based on their homology
method Proving a partial order on homeomorphism classes of 3-manifolds
result Closed, connected, oriented 3-manifolds are partially ordered by rational homology ribbon cobordism.
In this article we introduce order preserving representations of fundamental groups of surfaces into Lie groups with bi-invariant orders. By relating order preserving representations to weakly maximal representations, introduced in arXiv:1305.2620, we show that order preserving representations into Lie groups of Hermit…
Reconstruct spacetime from order and number of points.
problem Reconstruct spacetime from chronological relations and i.i.d. samples.
method Relaxing hypotheses of Gromov reconstruction theorem, using random adjacency matrices and chronological relations.
result Spacetime can be recovered by only knowing 'order' and 'number' of its points.