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

Trend · papers per month

0.7%1.4%2.1%2.8% · Aug 200219922001200920182026
48 results for soft interfaces

OrbTouch uses deep learning to interpret touch gestures on stretchable surfaces.

problem Efficiently extracting information from soft, deformable interfaces.
method Convolutional neural networks applied to stretchable capacitor signals.
result Successfully mapped human touch gestures to categorical labels and touch location.

Extends diffuse interface methods to graphs and hypergraphs with non-smooth potentials.

problem Semi-supervised learning on graphs and hypergraphs.
method Generalizes diffuse interface methods using non-smooth potential functions and hypergraph Laplacians.
result The diffuse interface method can be applied to both graph and hypergraph data.

Paper introduces probabilistic module interface for complex models and inference.

problem Handling complex probabilistic models with latent variables and custom inference methods.
method Develops a platform-agnostic interface for encapsulating models and inference programs, allowing sound approximate inference algorithms for networks of modules.
result Sound approximate inference algorithms can be constructed for networks of probabilistic modules.

A new method for RL with continuous actions improves stability and scalability.

problem Stability and scalability issues in existing RL methods.
method Soft policy gradient with entropy regularization, combined with double sampling for soft Bellman equation.
result Outperforms off-policy prior methods in continuous action RL tasks.

New interface explains contextual bandits to non-experts.

problem Interpreting and managing contextual bandits for non-expert operators.
method Developed a metric 'value gain' for off-policy evaluation and designed an interface to explain bandit behavior.
result Empowered non-experts to manage complex machine learning systems through accessible presentation.

APINNs improve physics-informed neural networks through flexible domain decomposition.

problem Improving physics-informed neural networks (PINNs) for solving partial differential equations (PDEs).
method Introduces a trainable gate network for soft domain decomposition, allowing flexible parameter sharing and improved generalization.
result APINNs significantly improve PINNs and XPINNs, demonstrating better performance on various types of PDEs.

We consider the regularity of an interface between two incompressible and inviscid fluids flows in the presence of surface tension. We obtain local in time estimates on the interface in H32k+1H^{\frac32k +1} and the velocity fields in H32kH^{\frac32k}. These estimates are obtained using geometric considerations which show th…

2006-09-20abs ↗pdf ↗

Study boundary behavior of limit interfaces in Riemannian manifolds without convexity assumptions.

problem Boundary behavior of limit interfaces in Riemannian manifolds.
method Proves limit-interface is a free boundary varifold, integer rectifiable up to boundary.
result No convexity assumption required; valid even when limit-interface clusters near boundary.

Deep learning predicts curvature of 2D interfaces in level-set method.

problem Estimating curvature in level-set method for complex interfaces.
method Deep learning using feed-forward neural networks trained on synthetic data.
result Deep learning models approximate curvature with comparable precision to traditional methods.

Paper proposes a new loss function for conditional models using soft targets.

problem Improving generalization performance of deep neural networks on supervised classification tasks.
method Introduces a new loss function compatible with soft targets, based on noise contrastive estimation.
result Soft target InfoNCE loss performs on par with cross-entropy baselines and outperforms other losses.

Interactive interface for specifying complex tasks through demonstrations.

problem Challenges in specifying high-dimensional reward functions for complex tasks.
method Interactive interface with a set of increasingly complex policies trained on demonstrations.
result Successfully learned a complex task (Lunar Lander) with interactive demonstrations.

Deep model learns from labeled and unlabeled data for industrial soft sensing.

problem Lack of data limits soft sensor development in industrial processes.
method Hierarchical, generative deep latent variable model for semi-supervised multi-unit soft sensing.
result Model outperforms current methods for soft sensing in industrial processes.

Proposes new feature transformation methods for brain interface models.

problem Sub-optimality of feature ranking and selection in brain interface models.
method Introduces maximum mutual information linear and nonlinear transformations.
result Significantly better performance in binary and multi-class decoding analyses.

Improves deep neural networks using soft labels through alternating minimization.

problem Improving deep neural networks training with soft labels.
method Co-Learns DNNs and soft labels via Alternating Minimization of two objectives.
result COLAM achieves improved performance on many tasks with better testing classification accuracy.

The paper develops a multi-unit soft sensing model for virtual flow meters that improves few-shot learning.

problem Improving soft sensor performance for new wells with limited data.
method Formulates a probabilistic, hierarchical model using a deep neural network for multi-unit soft sensing.
result Multi-unit models trained on many wells can perform well on new wells with just a few data points.

Analytic patch trees reveal new geometric structures and dimension fields.

problem Understanding the geometric and analytical properties of surface patch trees.
method Developed analytic surface patch trees and introduced interface curves to transmit state.
result Surface patch trees have natural foliations with one-dimensional curve trees and dimension fields.

In this article supervised learning problems are solved using soft rule ensembles. We first review the importance sampling learning ensembles (ISLE) approach that is useful for generating hard rules. The soft rules are then obtained with logistic regression from the corresponding hard rules. In order to deal with the p…

2012-05-21abs ↗pdf ↗

MSOL learns hierarchical policies for multitask tasks with soft options.

problem Training hierarchical policies for multiple tasks with stability and flexibility.
method MSOL uses separate variational posteriors for each task, regularized by a shared prior, to avoid instabilities and fine-tune options for new tasks.
result MSOL significantly outperforms hierarchical and flat transfer-learning baselines.

Bayesian neural networks update beliefs with soft evidence, improving accuracy and calibration.

problem Updating neural network weights with uncertain or soft evidence.
method Developed two algorithms to approximate Jeffrey's rule for updating neural network weights.
result Jeffrey-based methods outperform traditional approaches in accuracy and calibration, especially in noisy data.

A method for selecting pseudo-labeled data in semi-supervised learning using generalized Bayes and soft revision.

problem Selecting pseudo-labeled data for semi-supervised learning with robustness to uncertainty.
method Using credal sets and the Gamma-Maximin method with soft revision to update priors and select pseudo-labeled data.
result The Gamma-Maximin method with soft revision can achieve promising results, especially in scenarios with low labeled data proportions.

Agents learn user preferences with less explicit feedback via spatial interface valuing.

problem Learning user preferences with high cognitive load feedback.
method Spatial Interface Valuing for reduced explicit feedback.
result Agents learn faster with spatial interface valuing compared to explicit feedback.

Common models for two-phase lipid bilayer membranes are based on an energy that consists of an elastic term for each lipid phase and a line energy at interfaces. Although such an energy controls only the length of interfaces, the membrane surface is usually assumed to be at least C1C^1 across phase boundaries. We consi…

2016-03-01abs ↗pdf ↗

Generative adversarial networks improve brain-computer interface performance with limited data.

problem Limited training samples in brain-computer interfaces.
method Conditional Deep Convolutional Generative Adversarial Networks (cDCGAN) for data augmentation.
result Generated artificial EEG data improves classification accuracy in brain-computer interface tasks.

Improved node classification in signed social networks using diffuse interface methods.

problem Classifying nodes in signed social networks (positive and negative interactions).
method Diffuse interface methods based on Ginzburg-Landau functional and extended graph Laplacian.
result Performance improvement in real signed social networks, outperforming state of the art.

Study evaluates features and classifiers for brain-computer interface tasks.

problem Improving accuracy in brain-computer interface communication.
method Examined six classical features and twelve classifiers across nine datasets.
result Energy in α and η bands, and Bayesian classifier with Gaussian assumption, outperform other methods.

This paper uses bandit algorithms to reduce the cost of user interface experimentation in online retail.

problem Reducing the cost of user interface experimentation in online retail.
method Modeling user interface experimentation as an opportunistic bandit problem, reducing the cost of exploration.
result Significant regret reduction and improved contextual information for testing.