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

Trend · papers per month

141282423564 · Jun 202019922001200920172026
48 results for observability domain

Method maps imperfect simulations to observed stellar spectra using unsupervised domain adaptation.

problem Mapping from large sets of imperfect simulations and observational data.
method Adversarial autoencoders, cycle-consistency constraint, and generative surrogate physics emulator network.
result Reconstructed spectra quality and discovery of new spectral features.

Agents learning to act autonomously in real-world domains must acquire a model of the dynamics of the domain in which they operate. Learning domain dynamics can be challenging, especially where an agent only has partial access to the world state, and/or noisy external sensors. Even in standard STRIPS domains, existing …

2012-10-16abs ↗pdf ↗

Generates counterfactuals in target domain from source domain observations.

problem Cross-domain learning with domain shifts and lack of parallel datasets.
method Unsupervised, Neural Causal Models, Joint Causal Graphs, Effect-Intrinsic vs Domain-Intrinsic Variables.
result Framework generates counterfactuals that closely match ground truth.

HIP-GP improves GP inference for inter-domain observations with millions of inducing points.

problem Inference for Gaussian Processes across different domains.
method Hierarchical inducing point Gaussian process with grid structure and stationary kernel assumption.
result Improved approximation accuracy through increased number of inducing points.

Hybrid framework merges data and domain knowledge for better spatial interpolation.

problem Spatial interpolation overlooks domain knowledge and limits to spatial coordinates.
method Integrates data-driven features with rule-assisted spatial dependency function mapping.
result Superior performance in two application scenarios, capturing localized features.

New method improves domain generalization by matching object representations.

problem Existing domain generalization methods fail to generalize to unseen domains.
method Proposes matching-based algorithms to match object representations across domains.
result MatchDG algorithm matches ground-truth object representations and improves out-of-domain accuracy.

In Prognostics and Health Management (PHM) sufficient prior observed degradation data is usually critical for Remaining Useful Lifetime (RUL) prediction. Most previous data-driven prediction methods assume that training (source) and testing (target) condition monitoring data have similar distributions. However, due to …

2019-07-17abs ↗pdf ↗

The paper explains how data augmentation can improve domain generalization by weakening spurious correlations.

problem Machine learning models trained with observational data fail to generalize to unseen domains due to spurious correlations.
method Developed a causal perspective to explain the success of data augmentation and derived an algorithm to select effective augmentation techniques.
result Data augmentation can be used to simulate interventional data, leading to better domain generalization.

Choosing optimal (or at least better) policies is an important problem in domains from medicine to education to finance and many others. One approach to this problem is through controlled experiments/trials - but controlled experiments are expensive. Hence it is important to choose the best policies on the basis of obs…

2018-02-23abs ↗pdf ↗

The paper analyzes the stability of an observer error in a vibrating string system.

problem Stability analysis of observer error in a vibrating string system.
method Abstract Cauchy problem reformulation and application of LaSalle's invariance principle for infinite-dimensional systems.
result The observer error is asymptotically stable.

Unpaired multi-domain causal representation learning is possible with sufficient conditions.

problem Learning shared causal representation from unpaired data across domains.
method Identify sufficient conditions for joint distribution and shared causal graph recovery.
result Practical method to recover shared latent causal graph from marginal distributions.

Paper establishes baselines for offline RL from visual observations.

problem Challenges in offline reinforcement learning from visual observations with continuous action spaces.
method Simple baselines and benchmarking tasks for offline RL from visual observations.
result Simple modifications to existing online RL algorithms outperform existing offline RL methods.

Network alignment is a critical task to a wide variety of fields. Many existing works leverage on representation learning to accomplish this task without eliminating domain representation bias induced by domain-dependent features, which yield inferior alignment performance. This paper proposes a unified deep architectu…

2019-08-15abs ↗pdf ↗

Paper introduces Influence Function to assess OOD generalization stability.

problem Assessing OOD generalization accuracy when target domains are unknown.
method Introduced Influence Function from robust statistics to monitor model stability.
result Accuracy on test domains and Influence Function variance can distinguish OOD algorithms and generalization quality.

Deep Reinforcement Learning (RL) recently emerged as one of the most competitive approaches for learning in sequential decision making problems with fully observable environments, e.g., computer Go. However, very little work has been done in deep RL to handle partially observable environments. We propose a new architec…

2018-04-17abs ↗pdf ↗

New method identifies stable latent variables across different domains using weak distributional invariances.

problem Learning causal representations for multi-domain datasets.
method Autoencoders incorporating weak distributional invariances.
result Autoencoders can identify stable latent variables across different domains.

Many interesting real world domains involve reinforcement learning (RL) in partially observable environments. Efficient learning in such domains is important, but existing sample complexity bounds for partially observable RL are at least exponential in the episode length. We give, to our knowledge, the first partially …

2016-05-25abs ↗pdf ↗

Paper tackles sim-to-real transfer in continuous domains with partial observations.

problem Lack of theoretical foundation for sim-to-real transfer in continuous domains with partial observations.
method Developed a new algorithm for infinite-horizon average-cost LQGs and established a regret bound.
result A popular robust adversarial training algorithm can learn competitive policies from simulation to real-world environments.

ContraBAR uses contrastive learning to learn Bayes-optimal policies in RL.

problem Learning optimal policies for unknown tasks sampled from a known distribution.
method Proposes ContraBAR, a meta RL algorithm using contrastive predictive coding (CPC) for belief inference.
result ContraBAR achieves comparable performance to state-of-the-art methods and is computationally efficient.

Proposes MR-SNE for multimodal data visualization.

problem Visualizing data from multiple domains with relations across them.
method Extends t-SNE to compute augmented relations and jointly embed them in a low-dimensional space.
result Demonstrates promising performance in visualizing Flickr and Animal with Attributes 2 datasets.

Proposes a new approach for domain adaptation using latent representations.

problem Handling distribution shifts between source and target domains in high-dimensional data.
method Learn compact latent representations based on the label's Markov blanket, partitioning into parents, children, and spouses.
result General domain adaptation can be achieved by learning representations of the label's parents, children, and spouses.

Unsupervised domain adaptation studies the problem of utilizing a relevant source domain with abundant labels to build predictive modeling for an unannotated target domain. Recent work observe that the popular adversarial approach of learning domain-invariant features is insufficient to achieve desirable target domain …

2020-01-03abs ↗pdf ↗

Framework integrates mental disorder measurements for personalized treatment.

problem Optimizing treatment for mental disorders with latent mental states and heterogeneity.
method Measurement theory and multi-layer neural network for complex treatment effects.
result Learned treatment policies outperform alternatives on heterogeneous treatment effects.

Medical imaging systems are commonly assessed by use of objective image quality measures. Supervised deep learning methods have been investigated to implement numerical observers for task-based image quality assessment. However, labeling large amounts of experimental data to train deep neural networks is tedious, expen…

2020-02-03abs ↗pdf ↗

We consider a Laplace eigenfunction φλ\varphi_λ on a smooth closed Riemannian manifold, that is, satisfying Δφλ=λφλ-Δ\varphi_λ= λ\varphi_λ. We introduce several observations about the geometry of its vanishing (nodal) set and corresponding nodal domains. First, we give asymptotic upper and lower bounds on the volume of a tu…

2016-08-18abs ↗pdf ↗

UDA improves ABI robustness but fails under certain prior misspecifications.

problem Robustness of ABI in noisy real-world data.
method Systematic evaluation of UDA across various misspecification scenarios.
result UDA aligns summary spaces but can fail under prior misspecifications.

Proposes DFDG for robust domain generalization without source domain labels.

problem Robustness of deep learning models in real-world applications where train and test distributions differ.
method Model-agnostic, class-aware alignment of class relationships through saliency maps.
result Competitive performance on time series sensor and image classification datasets.

New method improves domain generalization by aligning causal mechanisms across domains.

problem Improving model's ability to generalize across different distributions.
method Introduces invariance of average causal effect of features to labels, regularizing training approach.
result Demonstrates superior performance on benchmark datasets compared to state-of-the-art methods.

Domain adaptation has become a prominent problem setting in machine learning and related fields. This review asks the question: how can a classifier learn from a source domain and generalize to a target domain? We present a categorization of approaches, divided into, what we refer to as, sample-based, feature-based and…

2019-01-16abs ↗pdf ↗

In this paper, we consider domain-invariant deep learning by explicitly modeling domain shifts with only a small amount of domain-specific parameters in a Convolutional Neural Network (CNN). By exploiting the observation that a convolutional filter can be well approximated as a linear combination of a small set of dict…

2019-09-25abs ↗pdf ↗