M4L-JMF tackles multi-typed objects learning, improving on M3L.
problem Learning from multi-typed objects with diverse features and labels.
method Joint matrix factorization to encode and factorize multi-typed bags and their instances.
result M4L-JMF outperforms existing methods on benchmark datasets.
Advances neural tri-factorization for clustering and discordance analysis of multi-typed data.
problem Challenges in analyzing heterogeneous, multimodal relational data.
method Deep collective matrix tri-factorization for spectral clustering and cluster association learning.
result Demonstrates efficacy over previous non-neural approaches in clustering and discordance analysis.
The paper develops a method to sparsify magnetic Laplacians using multi-type spanning forests.
problem Sparsifying magnetic Laplacians for large and dense graphs.
method Sampling multi-type spanning forests using a determinantal point process.
result The method provides statistical guarantees for estimating the connection Laplacian.
Framework for joint inference of network topology and interaction types in heterogeneous systems.
problem Joint inference of network topology, multi-type interaction kernels, and latent type assignments in heterogeneous interacting particle systems.
method Three-stage approach: shared structure recovery, discrete interaction type identification, and matrix factorization.
result The method yields accurate reconstruction of underlying dynamics and is robust to noise.
Develops a new model for pricing without arbitrage opportunities.
problem Arbitrage opportunities in standard jump-diffusion models.
method Introduces a multi-type jump-diffusion model with diffusion-dependent jumps.
result Derives no-arbitrage condition linking drift to model parameters.
Research uses deep learning and copulas to predict multivariate survival data.
problem Handling right-censored and correlated multivariate survival data.
method Integrates deep learning, copula functions, and survival analysis. Uses copula-based activation functions to model nonlinear dependencies.
result Enhanced prediction accuracy for multivariate survival responses.
We study the problem of learning Granger causality between event types from asynchronous, interdependent, multi-type event sequences. Existing work suffers from either limited model flexibility or poor model explainability and thus fails to uncover Granger causality across a wide variety of event sequences with diverse…
In this work we target the problem of provably computing the equivalence between two programs represented as dataflow graphs. To this end, we formalize the problem of equivalence between two programs as finding a set of semantics-preserving rewrite rules from one into the other, such that after the rewrite the two prog…
Proposes a method to cluster multi-aspect data using manifold learning with NMF.
problem Clustering multi-aspect data with diverse features and views.
method Includes inter-manifold learning in NMF framework to handle different data types.
result The method improves clustering accuracy and efficiency on various datasets.
Autoencoder improves imputation across various missing data types.
problem Efficiently impute missing data in diverse datasets.
method Developed a deep autoencoder framework for consistent training and imputation.
result Autoencoder outperformed state-of-the-art methods in all experiments.
Representation learning on graphs has emerged as a powerful mechanism to automate feature vector generation for downstream machine learning tasks. The advances in representation on graphs have centered on both homogeneous and heterogeneous graphs, where the latter presenting the challenges associated with multi-typed n…
ISAHP discovers instance-level causal structures in event sequences.
problem Discovering fine-grained causal relationships in asynchronous, interdependent event sequences.
method ISAHP, a novel deep learning framework using self-attention mechanism.
result ISAHP meets Granger causality requirements and discovers complex causal structures.
Algorithm solves two-sided matching markets with unknown preferences and constraints.
problem Two-sided online matching markets with complementary preferences and quota constraints.
method Formulated as a bandit learning problem, proposed MMTS algorithm combining Thompson Sampling and double matching.
result MMTS achieves stability and linear Bayesian regret with respect to quota and time horizon.
MicroRNAs (miRNAs) play crucial roles in multifarious biological processes associated with human diseases. Identifying potential miRNA-disease associations contributes to understanding the molecular mechanisms of miRNA-related diseases. Most of the existing computational methods mainly focus on predicting whether a miR…
RL in MFGs is as hard as solving many single-agent RL problems.
problem Learning Nash Equilibrium in Mean-Field Games (MFGs).
method Introduce P-MBED to measure model complexity, develop a novel exploration strategy, and establish polynomial sample complexity results.
result Learning Nash Equilibrium in MFGs is no more statistically challenging than solving a logarithmic number of single-agent RL problems.
There are many real-world knowledge based networked systems with multi-type interacting entities that can be regarded as heterogeneous networks including human connections and biological evolutions. One of the main issues in such networks is to predict information diffusion such as shape, growth and size of social even…
Paper proposes HIDAM model to improve MSE default risk assessment using heterogeneous information networks.
problem Default risk assessment for MSEs due to lack of credit information and diverse financial activities.
method HIDAM model incorporating heterogeneous information networks with multi-typed nodes and links, extracting interactive information through meta-paths, and using a hierarchical attention mechanism.
result HIDAM model outperforms state-of-the-art competitors on real-world banking data.
IH-GAN models cellular structures accurately and improves structural performance.
problem Optimizing variable-density cellular structures with multiscale design challenges.
method Conditional deep generative model (IH-GAN) for property-to-geometry mapping using implicit function parameterization.
result Generates unit cells with high accuracy and improves structural performance.
We present a novel approach to weakly supervised object detection. Instead of annotated images, our method only requires two short videos to learn to detect a new object: 1) a video of a moving object and 2) one or more "negative" videos of the scene without the object. The key idea of our algorithm is to train the obj…
A new method for optimizing hierarchical multi-objective problems.
problem Symmetry and neglect of objective hierarchy in existing multi-objective methods.
method Priority-Constrained Descent (PCD) framework exploiting hierarchical objective structures.
result Pareto dominance and better per-objective performance with secondary progress guarantees.
LORL learns object-centric representations from vision and language.
problem Learning disentangled, object-centric scene representations from vision and language.
method LORL integrates unsupervised object discovery and segmentation with language input to learn object-centric concepts.
result LORL improves unsupervised object discovery methods and aids downstream tasks.
The paper introduces a new metric to quantify uncertainty's impact on multiple objectives.
problem Quantifying the impact of uncertainty on multiple objectives in complex systems.
method Proposes the mean multi-objective cost of uncertainty (multi-objective MOCU) to quantify uncertainty.
result Demonstrates the effectiveness of the multi-objective MOCU in real-world applications.
A new Adamize method improves multi-objective recommender systems.
problem Improving recommendation systems with multiple conflicting objectives.
method Developed a multi-objective model-agnostic Adamize method that corrects and stabilizes gradients.
result Significant improvements in recommendation systems, measured by hypervolume, coverage, and spacing.
The paper proposes a framework to reason about object dynamics for faster reinforcement learning.
problem Current reinforcement learning approaches lack prior knowledge about the environment, limiting efficiency.
method Integrates object dynamics and behavior into reinforcement learning to improve efficiency.
result Demonstrates the need for reasoning about object behavior and dynamics, leading to faster learning.
ROOTS learns to represent and render 3D scenes with object-centric models.
problem Learning to represent and render 3D scenes with object-centric compositionality.
method Probabilistic generative model for learning object representations and scene rendering from partial observations.
result The model can infer 3D object representations and render scenes from arbitrary viewpoints.
Object-centric learning improves generalization and robustness in multi-object scenes.
problem Improving generalization and robustness in neural networks for scenes with multiple objects.
method Training state-of-the-art unsupervised models on multi-object datasets and evaluating segmentation metrics and downstream tasks.
result Object-centric representations are useful for downstream tasks and generally robust to most distribution shifts affecting objects, but less so for less structured shifts.
ADS explains object differences by quantifying and removing underlying properties.
problem Explaining differences between two object images.
method Align-Deform-Subtract (ADS) framework that uses semantic alignments and iterative quantification/removal of differences.
result ADS provides disentangled error measures explaining object differences in terms of underlying properties.
Proposes class-agnostic object detection to handle all objects without class labels.
problem Difficulty and cost in creating annotated datasets limit conventional object detection models to specific object types.
method Proposes class-agnostic object detection as a new problem and proposes training and evaluation protocols. Uses adversarial learning to exclude class-specific information.
result Adversarial learning improves class-agnostic detection efficacy.
Many objective Bayesian optimization tackles redundant objectives in expensive black-box functions.
problem Efficiently optimizing multiple expensive and noisy black-box functions with redundant objectives.
method Proposes a metric to identify redundant objectives and a Bayesian optimization algorithm to stop evaluating them.
result Reduces computational cost by stopping evaluation of redundant objectives, improving efficiency.
The paper introduces a new method to measure the shape relations between biological objects using r-parallel sets.
problem The influence of neighboring objects on the shape and function of biological objects.
method The authors develop a theory based on spatial point processes to measure the geometrical interaction between objects.
result The proposed measures provide detailed information about the shape of individual objects and their interactions.
We introduce a rich model for multi-objective clustering with lexicographic ordering over objectives and a slack. The slack denotes the allowed multiplicative deviation from the optimal objective value of the higher priority objective to facilitate improvement in lower-priority objectives. We then propose an algorithm …
A new method for faster multi-objective optimization by evaluating objectives separately.
problem Finding the Pareto front of trade-offs between multiple objectives efficiently.
method Knowledge Gradient with decoupled evaluations, accounting for different costs.
result The method significantly outperforms existing approaches in terms of evaluation cost.
Paper presents attacks on real-time object detection systems.
problem Adversarial attacks on real-time object detection systems.
method Three targeted adversarial Objectness Gradient attacks (TOG).
result Adversarial attacks can cause object-vanishing, object-fabrication, and object-mislabeling.
Top 8 robotic vision systems tackled lifelong object recognition challenges.
problem Lifelong learning in robotic vision for varied, dynamic environments.
method Design of a dataset with diverse conditions and rules for evaluation.
result Robotic vision systems improved over time with dynamic object appearances.
Generative models create indistinguishable adversarial objects for object detection.
problem Creating unrestricted adversarial examples for object detection.
method Search over latent space of GAN for adversarial objects.
result Generated adversarial objects are indistinguishable from non-adversarial objects and transferable.
The ability to detect and track objects in the visual world is a crucial skill for any intelligent agent, as it is a necessary precursor to any object-level reasoning process. Moreover, it is important that agents learn to track objects without supervision (i.e. without access to annotated training videos) since this w…
Bayesian methods improve tracking multiple objects through dynamic dependencies.
problem Tracking multiple objects with time-varying cardinality and unordered measurements.
method Employing Bayesian nonparametric models, specifically dependent Dirichlet and Pitman-Yor processes, for state estimation and Monte Carlo sampling for trajectory learning.
result The proposed methods outperform existing algorithms in estimating the time-varying number of objects and identifying object associations.
Scalability in terms of object density in a scene is a primary challenge in unsupervised sequential object-oriented representation learning. Most of the previous models have been shown to work only on scenes with a few objects. In this paper, we propose SCALOR, a probabilistic generative world model for learning SCALab…
Unified information-theoretic objectives for training deep neural networks.
problem Difficulty in computing information-theoretic quantities for large deep neural networks.
method Review and unify competing objectives, develop surrogate objectives.
result Surrogate objectives allow applying information bottleneck to modern neural network architectures.
BFPM improves machine learning accuracy by considering object types and memberships flexibly.
problem Inaccurate learning due to missing important parameters.
method BFPM relaxes fuzzy and possibilistic constraints, allowing arbitrary object memberships and movement analysis.
result BFPM enhances object movement analysis and provides flexible search space.
New framework converts multi-objective to single-objective optimisation.
problem Solving multi-objective optimisation problems.
method Formalises scalarisation into mathematical framework, uses R2 utilities.
result R2 utilities are monotone and submodular, optimised by greedy algorithms.
Generative model separates objects, positions, and appearances in images.
problem Generating complete images with accurate object positions and appearances.
method Structured latent representation that separates objects, positions, and appearances.
result Generative model can infer object decompositions and accurate depth orderings.
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.
Proposes a novel algorithm for multi-objective reinforcement learning.
problem Challenges in setting numerical preferences for objectives in different units and scales.
method Learn action distributions for each objective and use supervised learning to fit a parametric policy.
result Demonstrates effectiveness on robotics tasks, allowing tracing out the space of nondominated solutions.
We consider the problem of learning object arrangements in a 3D scene. The key idea here is to learn how objects relate to human poses based on their affordances, ease of use and reachability. In contrast to modeling object-object relationships, modeling human-object relationships scales linearly in the number of objec…
This paper tackles multilingual speech processing by optimizing conflicting objectives hierarchically.
problem Training models for multilingual, multi-task speech processing is hampered by conflicting objectives.
method Investigates three multi-objective MSP formulations and introduces a lightweight layer-selection mechanism.
result A bi-level recipe outperforms standard flat optimization in state-of-the-art MSP models.
In this paper, we demonstrate a physical adversarial patch attack against object detectors, notably the YOLOv3 detector. Unlike previous work on physical object detection attacks, which required the patch to overlap with the objects being misclassified or avoiding detection, we show that a properly designed patch can s…
Simple greedy algorithms can excel in multi-objective bandits with multiple good arms.
problem Optimizing multiple objectives in bandits is traditionally harder.
method Introduced greedy algorithms that exploit multiple good arms for multiple objectives.
result Simple greedy algorithms achieve strong performance in multi-objective bandits.