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,051 papers · 148 categories

Trend · papers per month

8.3%16.7%25.0%33.3% · Jul 199219922001200920172026
48 results for lexicographic ordering

A new algorithm Zeus for multi-objective clustering with lexicographic ordering and slack.

problem Improving clustering quality with lexicographic objectives and slack.
method Introduced a slack mechanism and proposed Zeus algorithm to solve multi-objective clustering problems.
result Empirical validation of Zeus on real-world data demonstrates its effectiveness.

The paper tackles lexicographic multiarmed bandit problems with bounded regret.

problem Selecting lexicographic optimal arms in multiobjective bandit problems.
method Defining lexicographic regret, considering prior information, and proposing algorithms for both settings.
result Achieves uniformly bounded regret in time for both prior settings and sublinear gap-free regret in the prior-free case.

We provide foundations for decisions in face of unlikely events by extending the standard framework of Savage to include preferences indexed by a family of events. We derive a subjective lexicographic expected utility representation which allows for infinitely many lexicographically ordered levels of events and for eve…

2016-05-24abs ↗pdf ↗

The paper proposes a method to infer multi-objective rewards from preferences.

problem Modeling preferences based on multiple, often competing objectives.
method Modeling priorities lexicographically and inferring multi-objective rewards from observed preferences.
result Lexicographically-ordered rewards provide a better understanding of preferences and improve policies.

We study the degree of polynomial representations of knots. We obtain the lexicographic degree for two-bridge torus knots and generalized twist knots. The proof uses the braid theoretical method developed by Orevkov to study real plane curves, combined with previous results from [KP10] and [BKP14]. We also give a sharp…

2014-11-21abs ↗pdf ↗

We study the degree of polynomial representations of knots. We give the lexicographic degree of all two-bridge knots with 11 or fewer crossings. First, we estimate the total degree of a lexicographic parametrisation of such a knot. This allows us to transform this problem into a study of real algebraic trigonal plane c…

2015-01-23abs ↗pdf ↗

New theory for nonsmooth systems helps optimize and control complex functions.

problem Optimizing and controlling systems with nonsmooth functions.
method Higher-order averaging theory with nonsmooth near-identity transformation and lexicographic differentiation.
result Closed formula for nonsmooth first and second-order averaging.

The language of maximal lexicographic representatives of elements in the positive braid monoid AnA_n with nn generators is a regular language. We describe with great detail the smallest Finite State Automaton accepting such language, and study the proportion of elements of length kk whose maximal lexicographic repres…

2018-08-08abs ↗pdf ↗

The kth finite subset space of a topological space X is the space exp_k X of non-empty finite subsets of X of size at most k, topologised as a quotient of X^k. The construction is a homotopy functor and may be regarded as a union of configuration spaces of distinct unordered points in X. We show that the finite subset …

2003-11-21abs ↗pdf ↗

New fairness concept extends minimax fairness to lexicographic fairness.

problem Fairness in supervised learning, especially lexicographic fairness.
method Introduced approximate lexifairness, derived algorithms for finding solutions, and proved generalization bounds.
result Proved that approximate lexifairness on training data implies approximate lexifairness on true distribution.

Proof shows imitation of expert's reward and solutions in multi-objective optimization.

problem Multi-objective optimization with reward and solution imitation.
method Wasserstein inverse reinforcement learning.
result Wasserstein inverse reinforcement learning enables imitation of expert's reward and solutions in multi-objective optimization.

We introduce a method for creating a special type of tree, called a tree position, from a weighted graph. Leaves of the tree correspond to vertices of the original graph, and the tree edges contain information which can be used to partition these vertices. By repeatedly applying reducing operations to the tree position…

2014-08-15abs ↗pdf ↗

Let NN and PP be smooth closed manifolds of dimensions nn and pp respectively. Given a Thom-Boardman symbol II, a smooth map f:NPf:N\to P is called an ΩIΩ^{I}-regular map if and only if the Thom-Boardman symbol of each singular point of ff is not greater than II in the lexicographic order. We will represent the gr…

2004-12-13abs ↗pdf ↗

In the following text we compute possible heights of A\mathbb A (Alexandroff square), O\mathbb O (unit square [0,1]×[0,1][0,1]\times[0,1] with lexicographic order topology) and U\mathbb U (unit square [0,1]×[0,1][0,1]\times[0,1] with induced topology of Euclidean plane). We prove Ph(A)={n:n5}{+}P_h(\mathbb{A})=\{n:n\geq5\}\cup\{+\infty\}, $P_h(\m…

2018-10-02abs ↗pdf ↗

New connection found between shape reconstruction methods and persistent homology.

problem Connecting shape reconstruction methods with persistent homology.
method Wrap complexes and lexicographic optimal homologous cycles.
result Lexicographically optimal homologous cycles are supported on Wrap complexes.

Study how regularization and optimization affect margin in deep models.

problem Understanding margin maximization in deep learning models.
method Analyze the limit of loss minimization with diverging norm constraints and margin paths.
result Discovers lexicographic max-margin solutions for homogeneous models and shows convergence under certain conditions.

Groups with specific curvature have a regular language of geodesics.

problem Understanding the language of geodesics in non-positively curved triangle groups.
method Proving finitely many cone types and regularity of geodesic languages.
result The language of lexicographically first geodesics is regular and satisfies the fellow traveller property.

DFL framework improves action and outcome fairness in policy learning.

problem Fairness in policy learning, especially action and outcome fairness.
method Integrates action and outcome fairness into a multi-objective optimization problem using a lexicographic weighted Tchebyshev method.
result DFL framework improves both action and outcome fairness with minimal value reduction.

The paper finds formulas for word lengths and conjugacy classes in surface groups.

problem Finding formulas for word lengths and conjugacy classes in surface groups.
method Investigating symmetric presentations and normal forms of conjugacy classes.
result Derives three formulae for word lengths and provides efficient algorithms for conjugacy problems.

The study explores properties and mutations in oriented matroids, proving new results on Euclidean and non-Euclidean structures.

problem Investigating the Euclidean and non-Euclidean properties of oriented matroids.
method Analyzing the minimum number of mutations, using lexicographic extensions, and mutation-flips to prove properties.
result For rank 4 uniform oriented matroids, the minimum number of mutations adjacent to an element is at most 3.

Study a specific line arrangement and compute its fundamental group via braid monodromy.

problem Compute the fundamental group of a specific line arrangement's complement.
method Use braid monodromy to compute the fundamental group.
result The resulting presentation of the fundamental group coincides with the modified Artin presentation.

Deep learning agent improves pedestrian navigation in urban environments.

problem Autonomous driving among pedestrians in urban areas.
method Multi-objective deep reinforcement learning using a deep Q-learning variant.
result The multi-objective DQN agent outperforms single-objective DQN in various environments.

Given a compact geodesic space XX we apply the fundamental group and alternatively the first homology group functor to the corresponding Rips or Čech filtration of XX to obtain what we call a persistence. This paper contains the theory describing such persistence: properties of the set of critical points, their preci…

2017-09-15abs ↗pdf ↗

This work tackles asymmetric community estimation in multi-layer directed networks.

problem Estimating different numbers of sender and receiver communities in multi-layer directed networks.
method Proposes a goodness-of-fit test based on the largest singular value of an aggregated normalized residual matrix.
result Develops sequential and ratio-based testing procedures to consistently determine true sender and receiver community numbers.

Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic l1l_1-metric is thus inherited from the product of the two finite dendrons via an isometric embedding. The rectangular cell complexe…

2010-05-11abs ↗pdf ↗

Motivated by analogies with basic density theorems in analytic number theory, we introduce a notion (and variations) of the homological density of one space in another. We use Weil's number field/ function field analogy to predict coincidences for limiting homological densities of various sequences $\mathcal{Z}^{(d_1,\…

2016-11-14abs ↗pdf ↗

We present a new procedure to determine the growth function of a homogeneous Garside monoid, with respect to the finite generating set formed by the atoms. In particular, we present a formula for the growth function of each Artin--Tits monoid of spherical type (hence of each braid monoid) with respect to the standard g…

2018-08-09abs ↗pdf ↗

Proves HNN extensions of nilpotent groups are left-orderable, constructs non-left-orderable examples.

problem Characterizing left-orderability in HNN extensions of groups.
method Analyzes HNN extensions of torsion-free nilpotent groups and left-orderable groups.
result Constructs examples of non-left-orderable HNN extensions of left-orderable groups.

The paper characterizes L-space 3-manifolds using quandle orderability.

problem Characterizing L-space 3-manifolds using quandle orderability.
method Using quandles and their extensions, the paper investigates orderability and circular orderability conditions.
result The nn-quandle Qn(L)Q_n(L) of a link quandle is not right circularly orderable.

Optimal stock trading strategy with market orders and limit orders in a risky market.

problem Finding the best time and amount to place market and limit orders to minimize costs.
method Analyzes single and multi-period models with limit and market orders, considering liquidity risk.
result Optimal placement of market and limit orders can be determined under different market conditions.

Study analyzes order transitions in high, medium, and low market cap stocks using Markov chains.

problem Understanding order transitions in stocks of different market caps.
method First-order discrete-time Markov chain model applied to NASDAQ100 stocks.
result Limit orders exhibit higher inertia during opening hours but decrease in subsequent hours, while market orders increase.

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.

Bi-orderable groups from left-orderable ones, showing non-profinite properties.

problem Non-profinite properties in bi-orderability and generalized torsion elements.
method Using fiber products to construct bi-orderable groups, showing non-profinite properties.
result Bi-orderability and generalized torsion elements are not profinite properties.

In financial markets, the order flow, defined as the process assuming value one for buy market orders and minus one for sell market orders, displays a very slowly decaying autocorrelation function. Since orders impact prices, reconciling the persistence of the order flow with market efficiency is a subtle issue. A poss…

2014-03-04abs ↗pdf ↗

It is well known that a countable group admits a left-invariant total order if and only if it acts faithfully on R by orientation preserving homeomorphisms. Such group actions are special cases of group actions on simply connected 1-manifolds, or equivalently, actions on oriented order trees. We characterize a class of…

2005-03-21abs ↗pdf ↗

Paper introduces techniques to learn higher-order programs, improving predictive accuracy and reducing learning times.

problem Expressing and learning complex programs in ILP.
method Extending meta-interpretive learning to support higher-order definitions as background knowledge.
result Learning higher-order programs reduces hypothesis space and sample complexity, improving predictive accuracy and reducing learning times.

New conditions for circular orderability of direct products, linking to left-orderability of groups.

problem Conditions for circular orderability of direct products GimesZ/nZG imes \mathbb{Z}/n\mathbb{Z}.
method Cohomological conditions and characterizations for left-orderability.
result New characterization for left-orderability of fundamental groups of rational homology 3-spheres.