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.

168,695 papers · 148 categories

Trend · papers per month

5111621 · May 202619922001200920172026
48 results for preferential ties

Paper extends knowledge gradient for preferential BO, overcoming computational challenges.

problem Extending knowledge gradient to preferential BO with pairwise comparisons.
method Derive exact and analytical knowledge gradient for preferential BO.
result Exact knowledge gradient outperforms existing acquisition functions on benchmark problems.

PABBO optimizes user utility learning from preferential feedback, significantly faster than traditional methods.

problem Computational inefficiency in Preferential Bayesian Optimization (PBO) methods.
method Amortized Bayesian Optimization (PABBO) using transformer neural processes and reinforcement learning.
result Significantly faster performance compared to traditional Gaussian process-based methods.

Study explores how wealth dynamics change with preferential interactions in kinetic exchange models.

problem Investigate how preferential interactions affect wealth dynamics and distributions in kinetic exchange models.
method Conducted Monte Carlo simulations to explore two types of preferential interactions: one with random selection and another with wealth difference constraint.
result Emergence of quasi-oligarchic societies and segregation into economic classes observed in preferential interactions.

A method for eliciting expert beliefs using preferential questions and normalizing flows.

problem Eliciting high-dimensional probability distributions from noisy judgments.
method Normalizing flows based on preferential questions with a novel functional prior.
result The method allows for the inference of arbitrarily flexible densities from preferential judgments.
Tied Linksmath.GT

In this paper we introduce the tied links, i.e. ordinary links provided with some ties between strands. The motivation for introducing such objects originates from a diagrammatical interpretation of the defining generators of the so-called algebra of braids and ties; indeed, one half of such generators can be interpret…

2015-03-02abs ↗pdf ↗

Tied links and the tied braid monoid were introduced recently by the authors and used to define new invariants for classical links. Here, we give a version purely algebraic-combinatoric of tied links. With this new version we prove that the tied braid monoid has a decomposition like a semi--direct group product. By usi…

2018-07-26abs ↗pdf ↗

The power law has been observed in the degree distributions of many biological neural networks. Sparse deep neural networks, which learn an economical representation from the data, resemble biological neural networks in many ways. In this paper, we study if these artificial networks also exhibit properties of the power…

2018-05-04abs ↗pdf ↗

The question is: What does happen to the real-world networks which cause them not to grow permanently? The idea here is that real-world networks have to pay the cost of growth. We investigate the growth and trade-off between value and cost in the networks with cost and preferential attachment together. Since the prefer…

2019-08-29abs ↗pdf ↗

BO algorithms improve binary and preferential optimization by distinguishing between types of uncertainty.

problem Optimizing expensive functions with binary or pairwise comparisons.
method Proposed new acquisition functions distinguishing between epistemic and aleatoric uncertainty.
result New acquisition functions outperform state-of-the-art heuristics in binary and preferential BO.

A new noise model for preferential Bayesian optimization using user anchors.

problem Inadequate assumption of homoscedastic noise in human-in-the-loop settings.
method Proposes a heteroscedastic noise model with anchors and a KDE uncertainty map.
result Risk-adjusted performance improvement and clarified anchor placement effects.

Bayesian optimization is an effective method for finding extrema of a black-box function. We propose a new type of Bayesian optimization for learning user preferences in high-dimensional spaces. The central assumption is that the underlying objective function cannot be evaluated directly, but instead a minimizer along …

2020-02-08abs ↗pdf ↗

New invariant for tied links connects states without resolution dependence.

problem Understanding the Kauffman-like states for tied links.
method Defined Aicardi-Juyumaya states and showed their contribution to the invariant is independent of resolution.
result The double bracket of a tied link diagram can be computed and used to find linked but differently polynomial tied links.

Proposes a TS approach for Bayesian optimization with preferential feedback.

problem Optimizing with preference feedback in complex applications.
method Uses Thompson Sampling with a dueling kernel and anchor invariance.
result Performance matches standard TS for scalar feedback in finite time.

We introduce the concept of tied links in the solid torus, which generalize naturally the concept of tied links in S3S^3 previously introduced by Aicardi and Juyumaya. We also define an invariant of these tied links by using skein relations, and subsequently we recover this invariant by using Jones' method over the bt-…

2019-10-23abs ↗pdf ↗

A new method reduces variance in SGMCMC by preferentially subsampling data.

problem High variance in stochastic gradient estimates impacts sampler performance.
method Use a non-uniform probability distribution to preferentially subsample data points and adaptively adjust subsample size.
result Maintains accuracy while substantially reducing average subsample size.

PGD-trained models have a preferential direction in their gradients, which improves robustness.

problem Mathematical lack of clarity in the direction of preferential gradient alignment after adversarial training.
method Proposed a novel definition of preferential direction and evaluated it using a metric based on GANs.
result PGD-trained models have higher alignment with the proposed preferential direction than baseline models.

Let MM be a closed symplectic manifold of dimension 2n2n with non-ellipticity. We can define an almost Kähler structure on MM by using the given symplectic form. Hence, we have a $\G=π_1(M)$-invariant almost Kähler structure on the universal covering, $\ti M$, of MM. Using Darboux coordinate charts, we globally defo…

2018-07-01abs ↗pdf ↗

qEUBO optimizes decision-making with noisy feedback.

problem Optimizing decision-making with noisy preference feedback.
method Introduces qEUBO as a novel acquisition function for preferential Bayesian optimization.
result qEUBO is one-step Bayes optimal and enjoys an approximation guarantee under noise.

We define two new invariants for tied links. One of them can be thought as an extension of the Kauffman polynomial and the other one as an extension of the Jones polynomial which is constructed via a bracket polynomial for tied links. These invariants are more powerful than both the Kauffman and the bracket polynomials…

2016-07-17abs ↗pdf ↗

We analyze the information-theoretic limits for the recovery of node labels in several network models. This includes the Stochastic Block Model, the Exponential Random Graph Model, the Latent Space Model, the Directed Preferential Attachment Model, and the Directed Small-world Model. For the Stochastic Block Model, the…

2018-02-16abs ↗pdf ↗

Paper improves PBO using Skew Gaussian Processes for better optimization.

problem Optimizing with preference judgments, especially in A/B tests and recommender systems.
method Uses Skew Gaussian Processes to model preference function and exact posterior inference.
result Exact SkewGP posterior leads to better optimization results than Laplace approximation.

Suppose SS is a surface of genus 2\ge 2 , f:SSf: S \to S is a surface homeomorphism isotopic to a pseudo-Anosov map αα and suppose $\ti S$ is the universal cover of SS and FF and AA are lifts of ff and αα respectively. We show there is a semiconjugacy $Θ: \ti S \to \bar Ł^s \times \bar Ł^u$ from FF to Aˉ\bar A, …

2007-12-18abs ↗pdf ↗

Storytelling algorithms aim to 'connect the dots' between disparate documents by linking starting and ending documents through a series of intermediate documents. Existing storytelling algorithms are based on notions of coherence and connectivity, and thus the primary way by which users can steer the story construction…

2016-02-21abs ↗pdf ↗

Paper predicts international trade flows using machine learning and factorization models.

problem Predicting international bilateral trade flows with PTAs.
method Two-stage approach combining SHAP Explainer and Factorization Machine models.
result Enhanced predictive accuracy and deeper insights into trade dynamics.

A variation of the preferential attachment random graph model of Barabási and Albert is defined that incorporates planted communities. The graph is built progressively, with new vertices attaching to the existing ones one-by-one. At every step, the incoming vertex is randomly assigned a label, which represents a commun…

2018-01-21abs ↗pdf ↗

Active learning framework for optimizing human preferences in reinforcement learning.

problem Selecting most informative feedback for training models of human preferences.
method Proposes an active learning framework to collect preferential feedback online or offline.
result Errors in DPO logit estimates diminish with more feedback.

TPM improves medical image segmentation by separating foreground and background.

problem Few-shot medical image segmentation challenges due to background variability.
method Tied Prototype Model (TPM) focusing on foreground, adapting thresholds, and using class priors.
result TPM leads to improved segmentation accuracy compared to ADNet.

A novel model-selection method for dynamic networks using synthetic data.

problem Classifying and understanding the growth mechanisms of dynamic networks.
method Training a classifier on synthetic network data generated by nine random graph models, using dynamic features that count new links.
result Achieves near-perfect classification of synthetic networks, outperforming state-of-the-art methods.

We present a preferential attachment growth model to obtain the distribution P(K)P(K) of number of units KK in the classes which may represent business firms or other socio-economic entities. We found that P(K)P(K) is described in its central part by a power law with an exponent φ=2+b/(1b)φ=2+b/(1-b) which depends on the probabil…

2006-09-04abs ↗pdf ↗

We prove that the so-called t algebra of braids and ties supports a Markov trace. Further, by using this trace in the Jones' recipe, we define invariant polynomials for classical knots and singular knots. Our invariants have three parameters. The invariant of classical knots is an extension of the Homflypt polynomial a…

2014-08-25abs ↗pdf ↗

Enhances BO with expert preferences about abstract properties.

problem Lack of expert knowledge in BO for black-box experimental design.
method Human-AI collaboration to incorporate expert preferences into surrogate modeling.
result Superior performance compared to baselines in synthetic and real-world datasets.