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

79159238317 · Jun 202019922001200920172026
48 results for articulation points

Motivated by the hinge structure present in protein chains and other molecular conformations, we study the singularities of certain maps associated to body-and-hinge and panel-and-hinge chains. These are sequentially articulated systems where two consecutive rigid pieces are connected by a hinge, that is, a codimension…

2008-12-07abs ↗pdf ↗

Develops a mathematical model for automatic differentiation in machine learning.

problem Current automatic differentiation lacks a simple mathematical model for machine learning.
method Articulates relationships between program differentiation and nonsmooth functions, provides a class of functions and nonsmooth calculus.
result Shows how nonsmooth calculus applies to stochastic approximation methods and evidence of artificial critical points.

HOTCAKE compresses CNNs by decomposing kernels into smaller parts.

problem Compressing deep CNNs without significant accuracy loss.
method Input channel decomposition, guided Tucker rank selection, higher order Tucker decomposition, fine-tuning.
result HOTCAKE produces highly compressed CNN models with good accuracy.

Hidden cost: Smoothing shrinks decision boundaries, affecting class-wise accuracy.

problem The fragility of machine learning models and the need for robustness verification.
method Randomized smoothing approach to achieve statistical robustness.
result Smoothed classifiers' decision boundaries shrink, leading to class-wise accuracy disparity.

A neural network learns efficient parametrizations of product shape spaces.

problem Efficiently parametrize complex shape spaces with high computational costs.
method Developed a neural network architecture that separately learns approximations for low-dimensional factors and combines them.
result Demonstrated the effectiveness of the approach on synthetic and real data.

We formulate a principle for classification with the knowledge of the marginal distribution over the data points (unlabeled data). The principle is cast in terms of Tikhonov style regularization where the regularization penalty articulates the way in which the marginal density should constrain otherwise unrestricted co…

2012-10-19abs ↗pdf ↗

The purpose of this paper is to give a simpler proof to the problem of controllability of a Hilbert snake \cite{PeSa}. Using the action of the Möbius group of the unit sphere on the configuration space, in the context of a separable Hilbert space. We give a generalization of the Theorem of accessibility contained in \c…

2014-12-21abs ↗pdf ↗

The Frame Problem (FP) is a puzzle in philosophy of mind and epistemology, articulated by the Stanford Encyclopedia of Philosophy as follows: "How do we account for our apparent ability to make decisions on the basis only of what is relevant to an ongoing situation without having explicitly to consider all that is not …

2017-01-26abs ↗pdf ↗

PFPN uses particle filtering to improve character control in physics-based simulations.

problem Premature commitment to suboptimal actions in high-dimensional continuous control problems for articulated characters.
method Proposes a particle-based action policy using particle filtering to dynamically explore and discretize the action space.
result Demonstrates better imitation performance and robustness to external perturbations compared to Gaussian policies.

Unified framework designs LK structures using integer twists on non-manifold meshes.

problem Binary twisting limits topological possibilities and structural behaviors.
method Generalizes twist formulation to arbitrary integer labels for non-manifold meshes.
result Integer twists enable full connectivity and dynamic folding/articulation.

Paper tackles shape graph registration using neural networks.

problem Constrained registration of shape graphs with varying nodes and edges.
method Shape-Graph Matching Network (SGM-net) with an elastic shape metric loss function.
result State-of-the-art matching performance and reduced computational cost.

Articulatory distinctive features, as well as phonetic transcription, play important role in speech-related tasks: computer-assisted pronunciation training, text-to-speech conversion (TTS), studying speech production mechanisms, speech recognition for low-resourced languages. End-to-end approaches to speech-related tas…

2019-07-02abs ↗pdf ↗

We introduce an unsupervised approach to efficiently discover the underlying features in a data set via crowdsourcing. Our queries ask crowd members to articulate a feature common to two out of three displayed examples. In addition we also ask the crowd to provide binary labels to the remaining examples based on the di…

2015-03-31abs ↗pdf ↗

An expanding literature articulates the view that Taylor rules are helpful in predicting exchange rates. In a changing world however, Taylor rule parameters may be subject to structural instabilities, for example during the Global Financial Crisis. This paper forecasts exchange rates using such Taylor rules with Time V…

2014-03-03abs ↗pdf ↗

We introduce blockchains and distributed ledgers and describe their potential applications to money and banking. The analysis compares public and private ledgers and outlines the suitability of various types of ledgers for different purposes. Furthermore, a few historical prototypes of blockchains and distributed ledge…

2017-03-04abs ↗pdf ↗

We study a natural intrinsic definition of geometric simplices in Riemannian manifolds of arbitrary dimension nn, and exploit these simplices to obtain criteria for triangulating compact Riemannian manifolds. These geometric simplices are defined using Karcher means. Given a finite set of vertices in a convex set on t…

2014-06-14abs ↗pdf ↗

Examines parallels between human subjects and texts for causal inference.

problem Ambiguity and fallacies in causal inference using textual data.
method Two strategies: shifting from traits to perceptions and from concepts to parts.
result Highlights the importance of clarifying fundamental concepts.

This paper provides a taxonomy for the licensing of data in the fields of artificial intelligence and machine learning. The paper's goal is to build towards a common framework for data licensing akin to the licensing of open source software. Increased transparency and resolving conceptual ambiguities in existing licens…

2019-03-21abs ↗pdf ↗

Many complex natural and cultural phenomena are well modelled by systems of simple interactions between particles. A number of architectures have been developed to articulate this kind of structure, both implicitly and explicitly. We consider an unsupervised explicit model, the NRI model, and make a series of represent…

2019-05-21abs ↗pdf ↗

BCDP enhances privacy by protecting sensitive features more precisely.

problem Uniform privacy protection in LDP degrades performance for sensitive features.
method Bayesian Coordinate Differential Privacy (BCDP) adjusts privacy protection per feature sensitivity.
result BCDP improves accuracy in downstream tasks without sacrificing privacy.

We show that conically smooth stratified spaces embed fully faithfully into \infty-categories. This articulates a stratified generalization of the homotopy hypothesis proposed by Grothendieck. As such, each \infty-category defines a stack on conically smooth stratified spaces, and we identify the descent conditions…

2015-02-05abs ↗pdf ↗

Recent work on fairness in machine learning has focused on various statistical discrimination criteria and how they trade off. Most of these criteria are observational: They depend only on the joint distribution of predictor, protected attribute, features, and outcome. While convenient to work with, observational crite…

2017-06-08abs ↗pdf ↗

A Bayesian framework models adversarial uncertainty for robust machine learning.

problem Vulnerability of machine learning models to adversarial attacks.
method Formal Bayesian framework that models adversarial uncertainty through a stochastic channel, articulating probabilistic assumptions.
result Explicitly modeling adversarial uncertainty leads to improved robustification strategies.

Paper examines LLM capability benchmarks through construct validity, favoring nomological account.

problem Linking theoretical capabilities to empirical measurements in LLMs.
method Contrasts three frameworks: nomological, inferential, and causal.
result Nomological account provides best foundation for LLM research.

We consider the problem of inverse kinematics (IK), where one wants to find the parameters of a given kinematic skeleton that best explain a set of observed 3D joint locations. The kinematic skeleton has a tree structure, where each node is a joint that has an associated geometric transformation that is propagated to a…

2019-10-24abs ↗pdf ↗

In accessibility tests for digital preservation, over time we experience drifts of localized and labelled content in statistical models of evolving semantics represented as a vector field. This articulates the need to detect, measure, interpret and model outcomes of knowledge dynamics. To this end we employ a high-perf…

2016-08-03abs ↗pdf ↗

Develops methods for causal inference in compositional data using instrumental variables.

problem Interpreting summary statistics like diversity indices as causal effects in compositional data.
method Statistical data transformations and regression techniques tailored for compositional data.
result Advantages and limitations of the proposed methods demonstrated on synthetic and real microbiome data.