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

35810 · Feb 202019922001200920172026
48 results for affordances

HAL learns hierarchical affordances to prune impossible subtasks, improving reinforcement learning efficiency.

problem Reinforcement learning struggles with complex hierarchical dependency structures.
method HAL learns a model of hierarchical affordances to prune impossible subtasks.
result HAL agents are better at learning complex tasks, navigating stochastic environments, and acquiring diverse skills.

The paper introduces affordances for reinforcement learning, improving planning and learning efficiency.

problem Reinforcement learning assumes all actions are available, but real-world agents face limited action spaces.
method Developed a theory of affordances for Markov Decision Processes, proposing methods to learn and use affordances.
result Affordances improve planning speed and learning efficiency, leading to simpler and better generalizing transition models.

One of the open challenges in designing robots that operate successfully in the unpredictable human environment is how to make them able to predict what actions they can perform on objects, and what their effects will be, i.e., the ability to perceive object affordances. Since modeling all the possible world interactio…

2018-04-09abs ↗pdf ↗

In this paper we explore the richness of information captured by the latent space of a vision-based generative model. The model combines unsupervised generative learning with a task-based performance predictor to learn and to exploit task-relevant object affordances given visual observations from a reaching task, invol…

2019-09-30abs ↗pdf ↗

New PCGML approach generates novel game content across multiple platformer domains.

problem Generating novel game content in new domains.
method Using a new affordance and path vocabulary, variational autoencoders trained on data from six platformer games produce new content with varying proportions of different domains.
result Captures latent level space spanning multiple domains and generates new content with varying proportions of different domains.

Propagates adversarial robustness in federated learning.

problem Heterogeneous federated users with non-iid data and limited resources.
method Adversarial robustness propagation through batch-normalization.
result Federated models achieve remarkable robustness even with limited adversarial training.

The study uses machine learning to analyze office floor plans and predict function based on geometry.

problem Lack of formalisms to describe spatial affordance in automated floor-plan generation tools.
method Supervised and unsupervised data mining techniques, including J48 algorithm, were used to analyze office floor plans.
result J48 algorithm can predict class performance on unseen examples up to 79.5% for office dataset.

In this paper we introduce score embedding, a neural network based model to learn interpretable vector representations for words. Score embedding is a supervised method that takes advantage of the labeled training data and the neural network architecture to learn interpretable representations for words. Health care has…

2019-08-19abs ↗pdf ↗

We define a finite-dimensional cubic quotient of the group algebra of the braid group, endowed with a (essentially unique) Markov trace which affords the Links-Grould invariant of knots and links. We investigate several of its properties, and state several conjectures about its structure.

2012-03-27abs ↗pdf ↗

We present a survey of the calibrated geometries arising in the study of the local singularity structure of supersymmetric fivebranes in M-theory. We pay particular attention to the geometries of 4-planes in eight dimensions, for which we present some new results as well as many details of the computations. We also ana…

1998-06-04abs ↗pdf ↗

Data analytics using machine learning (ML) has become ubiquitous in science, business intelligence, journalism and many other domains. While a lot of work focuses on reducing the training cost, inference runtime and storage cost of ML models, little work studies how to reduce the cost of data acquisition, which potenti…

2018-05-26abs ↗pdf ↗

We consider composite loss functions for multiclass prediction comprising a proper (i.e., Fisher-consistent) loss over probability distributions and an inverse link function. We establish conditions for their (strong) convexity and explore the implications. We also show how the separation of concerns afforded by using …

2012-06-18abs ↗pdf ↗

AdvImmune improves certifiable robustness of GNNs against adversarial attacks.

problem Vulnerability of graph neural networks to adversarial attacks.
method Proposes AdvImmune, an algorithm that optimizes with meta-gradient to improve certifiable robustness.
result Remarkably improves the ratio of robust nodes by 12%, 42%, 65% with an affordable immune budget of only 5% edges.

Graph-based methods pervade the inference toolkits of numerous disciplines including sociology, biology, neuroscience, physics, chemistry, and engineering. A challenging problem encountered in this context pertains to determining the attributes of a set of vertices given those of another subset at possibly different ti…

2016-12-12abs ↗pdf ↗

This paper considers options pricing when the assumption of normality is replaced with that of the symmetry of the underlying distribution. Such a market affords many equivalent martingale measures (EMM). However we argue (as in the discrete-time setting of Klebaner and Landsman, 2007) that an EMM that keeps distributi…

2014-02-07abs ↗pdf ↗

Machine Learning and Artificial Intelligence are considered an integral part of the Fourth Industrial Revolution. Their impact, and far-reaching consequences, while acknowledged, are yet to be comprehended. These technologies are very specialized, and few organizations and select highly trained professionals have the w…

2020-01-01abs ↗pdf ↗

We model the quantities appearing in Internal Revenue Service (IRS) tax guidance for calculating the health insurance premium tax credit created by the Patient Protection and Affordable Care Act, also called Obamacare. We ask the question of whether there is a procedure, computable by hand, which can calculate the appr…

2018-10-31abs ↗pdf ↗

We derive a closed form portfolio optimization rule for an investor who is diffident about mean return and volatility estimates, and has a CRRA utility. The novelty is that confidence is here represented using ellipsoidal uncertainty sets for the drift, given a volatility realization. This specification affords a simpl…

2015-02-10abs ↗pdf ↗

In this work we afford the statistical characterization of a linear Stochastic Volatility Model featuring Inverse Gamma stationary distribution for the instantaneous volatility. We detail the derivation of the moments of the return distribution, revealing the role of the Inverse Gamma law in the emergence of fat tails,…

2010-11-27abs ↗pdf ↗

An instanton (E,D)(E, D) on a (pseudo-)hyperkähler manifold MM is a vector bundle EE associated to a principal GG-bundle with a connection DD whose curvature is pointwise invariant under the quaternionic structures of TxM, xMT_x M, \ x\in M, and thus satisfies the Yang-Mills equations. Revisiting a construction of solution…

2018-12-16abs ↗pdf ↗

This paper aims to determine the images of the braid group under representations afforded by the Yang Baxter equation when the solution is a nontrivial 4×44 \times 4 matrix. Making the assumption that all the eigenvalues of the Yang Baxter solution are roots of unity, leads to the conclusion that all the images are fini…

2008-07-25abs ↗pdf ↗

In this paper we present a novel quasi-Newton algorithm for use in stochastic optimisation. Quasi-Newton methods have had an enormous impact on deterministic optimisation problems because they afford rapid convergence and computationally attractive algorithms. In essence, this is achieved by learning the second-order (…

2019-09-03abs ↗pdf ↗

Matrix completion and extrapolation (MCEX) are dealt with here over reproducing kernel Hilbert spaces (RKHSs) in order to account for prior information present in the available data. Aiming at a faster and low-complexity solver, the task is formulated as a kernel ridge regression. The resultant MCEX algorithm can also …

2018-08-01abs ↗pdf ↗

A new measure PC allows fair comparison of AIWP and NWP models.

problem Fair comparison of AIWP and NWP model outputs.
method Postprocessing deterministic model outputs with isotonic distributional regression (IDR) and calculating PC as mean CRPS of postprocessed forecasts.
result The GraphCast model outperforms the ECMWF HRES model in WeatherBench 2 data.

The problem of accelerating drug discovery relies heavily on automatic tools to optimize precursor molecules to afford them with better biochemical properties. Our work in this paper substantially extends prior state-of-the-art on graph-to-graph translation methods for molecular optimization. In particular, we realize …

2019-06-11abs ↗pdf ↗

The paper characterizes mapping class groups related to abelian differentials.

problem Understanding the relationship between strata of abelian differentials and mapping class groups.
method Using the topological monodromy representation, the authors show that the fundamental group of a stratum surjects onto a specific subgroup of the mapping class group.
result The framed mapping class groups are finitely generated and explicitly characterized.

In this paper we study 1/k-geodesics, those closed geodesics that minimize on any subinterval of length l(γ)/kl(γ)/k. We employ energy methods to provide a relationship between the 1/k-geodesics and what we define as the balanced points of the uniform energy. We show that classes of balanced points of the uniform energy pe…

2014-06-02abs ↗pdf ↗

Study how depth affects inference in deep Bayesian neural networks.

problem Understanding how depth impacts inference in overparameterized linear Bayesian neural networks.
method Interpreting finite deep linear Bayesian neural networks as scale mixtures of Gaussian process predictors.
result Advances analytical understanding of how depth affects inference in a simple class of Bayesian neural networks.

Customer scoring models are the core of scalable direct marketing. Uplift models provide an estimate of the incremental benefit from a treatment that is used for operational decision-making. Training and monitoring of uplift models require experimental data. However, the collection of data under randomized treatment as…

2019-10-01abs ↗pdf ↗