TOQ-Nets learn to recognize complex temporal events with varying objects and sequences.
problem Recognizing complex relational-temporal events with varying numbers of objects and sequence lengths.
method Neuro-symbolic networks with reasoning layers for finite-domain quantification over objects and time.
result TOQ-Nets can generalize to scenarios with more objects than training data and temporal warpings.
ET-GP-UCB optimizes time-varying functions without knowing change rates.
problem Sequentially optimizing a time-varying objective function with unknown change rates.
method Event-triggered Bayesian optimization with adaptive resets based on probabilistic uniform error bounds.
result ET-GP-UCB outperforms other GP-UCB algorithms in synthetic and real-world data.
this paper has been withdrawn
TALBO optimizes latent spaces for evolving design objectives.
problem Temporal drift in design objectives.
method GP-prior variational autoencoder for time-varying latent space.
result Consistently outperforms LSBO baselines across varying drift speeds and objectives.
Relational Structural Causal Models enable causal reasoning about unseen object combinations.
problem Developing a model that can reason about causal and combinatorial aspects of unseen object combinations.
method Relational Structural Causal Models extend structural causal models to include relational variables and define identification criteria.
result Proposed relational neural causal models outperform non-relational baselines on simulated traffic scenes.
A new approach corrects bias in federated learning due to varying communication links.
problem Bias in federated learning due to non-uniform and time-varying communication links.
method Proposes Federated Postponed Broadcast (FedPBC) to correct bias in Federated Average (FedAvg).
result FedPBC converges to a stationary point of the global objective, overcoming bias caused by varying communication links.
TVBO optimizes time-varying functions with asymptotically vanishing regret.
problem Understanding the asymptotic performance of TVBO for time-varying black-box functions.
method Provided upper and lower bounds for cumulative regret of TVBO algorithms.
result TVBO algorithms can achieve asymptotically vanishing regret under certain conditions.
Study compares optimal vs. naive diversification in crypto markets, finds time-varying moments improve performance.
problem Optimizing portfolio construction in volatile crypto markets.
method Examines time-varying moments and transaction costs, incorporates turnover penalty.
result Time-varying moment estimators outperform conventional estimators in practical portfolio construction.
No-regret optimization for time-varying functions using uncertainty injection.
problem Optimizing time-varying functions with no-regret in bandit feedback.
method W-SparQ-GP-UCB, incorporating uncertainty injection and additional queries.
result Achieves no-regret with a vanishing number of additional queries per iteration.
Generative model handles varying data dimensions using jump diffusion processes.
problem Handling data of varying dimensionality in generative models.
method Formulated as a jump diffusion process, learning to approximate the process with a novel evidence lower bound.
result Effective sampling of data of varying dimensionality, better compatibility with test-time diffusion guidance imputation tasks.
Deep Sets improve reinforcement learning agent's object-centered navigation and generalization.
problem Improving reinforcement learning agents' ability to generalize to unseen objects and goals.
method Combining object-wise permutation invariant networks (Deep Sets) and gated-attention mechanisms.
result Agent demonstrates strong generalization to out-of-distribution goals in a procedurally-generated 2D world.
We consider Bayesian optimization of an expensive-to-evaluate black-box objective function, where we also have access to cheaper approximations of the objective. In general, such approximations arise in applications such as reinforcement learning, engineering, and the natural sciences, and are subject to an inherent, u…
A novel tracking algorithm models dynamic objects as ellipsoids with time-varying orientation.
problem Tracking dynamic objects with time-varying orientation.
method Random matrix framework with variational Bayes for non-linear inference.
result The method outperforms state-of-the-art methods in accuracy and robustness.
Study finds different active learning techniques better for various learning objectives.
problem Matching active learning techniques to specific learning objectives.
method Survey of students' perceptions and ratings of various techniques.
result Different active learning techniques are best suited for different learning objectives.
Object tracking is an ubiquitous problem that appears in many applications such as remote sensing, audio processing, computer vision, human-machine interfaces, human-robot interaction, etc. Although thoroughly investigated in computer vision, tracking a time-varying number of persons remains a challenging open problem.…
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.
We study statistical detection of grayscale objects in noisy images. The object of interest is of unknown shape and has an unknown intensity, that can be varying over the object and can be negative. No boundary shape constraints are imposed on the object, only a weak bulk condition for the object's interior is required…
Proposes QDF to improve multi-step time-series forecasting.
problem Ignoring label autocorrelation and unequal task weights in training objectives.
method Quadratic-form weighted training objective and QDF learning algorithm.
result Improves performance of various forecast models, achieving state-of-the-art results.
A key question in Reinforcement Learning is which representation an agent can learn to efficiently reuse knowledge between different tasks. Recently the Successor Representation was shown to have empirical benefits for transferring knowledge between tasks with shared transition dynamics. This paper presents Model Featu…
The paper shows objective derivatives are covariant derivatives on Riemannian metrics.
problem The definition and interpretation of objective derivatives in continuum mechanics.
method Demonstrates that objective derivatives correspond to covariant derivatives on the manifold of Riemannian metrics.
result Objective derivatives are unified as covariant derivatives on the manifold of Riemannian metrics.
We develop a novel method for detection of signals and reconstruction of images in the presence of random noise. The method uses results from percolation theory. We specifically address the problem of detection of multiple objects of unknown shapes in the case of nonparametric noise. The noise density is unknown and ca…
Downscaled models outperform larger ones on GLUE tasks.
problem Difficulty in attributing performance changes to specific factors in large language models.
method Pre-trained down-scaled versions of Transformer-based architectures on a common corpus, benchmarked on GLUE tasks.
result MLM + NSP (BERT-style) consistently outperforms other objectives.
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.
A tutorial on optimizing complex functions with partial knowledge.
problem Optimizing functions with limited or partial information.
method Grey-box Bayesian optimization, blending black-box and white-box approaches.
result Improves optimization performance by leveraging internal information.
Gradient filters track moving parameters under noisy data and misspecification.
problem Tracking multidimensional time-varying parameters under noisy observations and model misspecification.
method Gradient-based filters update parameters using the gradient of a postulated objective function, evaluated at either the predicted or updated parameters.
result Novel sufficient conditions for exponential stability of the filtered parameter path, and finite-sample and asymptotic mean squared error bounds.
This work focuses on the estimation of multiple change-points in a time-varying Ising model that evolves piece-wise constantly. The aim is to identify both the moments at which significant changes occur in the Ising model, as well as the underlying graph structures. For this purpose, we propose to estimate the neighbor…
This paper proposes a technique for the unsupervised detection and tracking of arbitrary objects in videos. It is intended to reduce the need for detection and localization methods tailored to specific object types and serve as a general framework applicable to videos with varied objects, backgrounds, and image qualiti…
The paper tackles uncertainty in multi-objective decision-making.
problem Learning Pareto-efficient decisions with statistical confidence in uncertain outcomes.
method Adapting Pareto-efficient decisions to uncertainty, using conformal prediction.
result Statistical guarantees for efficient decisions in uncertain contexts.
A new approach optimizes weights in DLP for better risk-adjusted performance.
problem Optimizing time-varying weights in Double Linear Policy (DLP) for better risk-adjusted performance.
method Stochastic Model Predictive Control (SMPC) framework to maximize risk-adjusted returns while enforcing constraints.
result Empirical results show improved risk-adjusted performance and drawdown control.
Generates coherent 3D scenes from monocular videos without supervision.
problem Lack of 3D scene modeling in video generation models.
method Trains a model to generate 3D scenes with moving objects and a background from monocular videos.
result Trained model generates coherent 3D scenes with multiple moving objects and a background.
Improved RL for grasping in cluttered scenes using state representation learning.
problem Poor performance of RL methods in grasping diverse objects from raw images.
method Employed state representation learning (SRL) with disentanglement of raw input images.
result Deep RL can learn grasping skills from varied visual inputs.
We consider the problem of naming objects in complex, natural scenes containing widely varying object appearance and subtly different names. Informed by cognitive research, we propose an approach based on sharing context based object hypotheses between visual and lexical spaces. To this end, we present the Visual Seman…
Novel algorithm for decentralized optimization in time-varying networks with delays.
problem Decentralized optimization in networks with communication delays.
method DT-GO algorithm, applicable to general directed graphs, converges to same complexity as centralized SGD.
result Algorithm DT-GO achieves convergence rates for convex and non-convex objectives, similar to centralized SGD.
A popular approach of achieving fairness in optimization problems is by constraining the solution space to "fair" solutions, which unfortunately typically reduces solution quality. In practice, the ultimate goal is often an aggregate of sub-goals without a unique or best way of combining them or which is otherwise only…
Local surrogate explainers vary in objectives, leading to incomparable explanations.
problem Variability in objectives among local surrogate explainers.
method Review of multiple local surrogate explainers, focusing on extracted information.
result Diverse explanations from similar methods due to differing objectives.
A fundamental object in a hyperbolic 3-manifold M is its convex core C(M), defined as the smallest closed non-empty convex subset of M. We investigate the way the geometry of the boundary S of C(M) varies as we vary the hyperbolic metric of M. Thurston observed that the intrinsic metric of S is hyperbolic, and that its…
Recent research in economic theory attempts to study optimal economic growth and spatial location of economic activity in a unified framework. So far, the key result of this literature - asymptotic convergence, even in the absence of decreasing returns to capital - relies on specific assumptions about the objective of …
iMOCA optimizes multiple objectives with continuous approximations for resource efficiency.
problem Optimizing multiple objectives with continuous function approximations that balance accuracy and evaluation cost.
method Information-Theoretic Multi-Objective Bayesian Optimization with Continuous Approximations (iMOCA) selects input and function approximations to maximize information gain per unit cost.
result iMOCA significantly improves over existing single-fidelity methods in approximating the optimal Pareto set.
We design non-singular cloaks enabling objects to scatter waves like objects with smaller size and very different shapes. We consider the Schrodinger equation which is valid e.g. in the contexts of geometrical and quantum optics. More precisely, we introduce a generalized non-singular transformation for star domains, a…
Unified algorithm for stochastic optimization with time-varying momentum converges under general conditions.
problem Optimizing functions with time-varying gradients and biases.
method Unified algorithm using a time-varying momentum term.
result Convergence of the unified algorithm under general conditions.
Paper efficiently infers differential parameters in time-varying models using time score matching.
problem Efficiently inferring differential parameters in time-varying probabilistic models.
method Directly estimates the differential parameter using time score matching and proves consistency of the method.
result Consistent estimation of parameter derivatives in high-dimensional settings.
Stochastic algorithm achieves sublinear convergence for bi-objective optimization.
problem Optimizing two conflicting functions using gradient or subgradient descent.
method Stochastic alternating algorithm with varying steps for each objective.
result Achieves sublinear convergence rate of O(1/T) under strong convexity.
Cost-aware BO minimizes function evaluations with varying costs.
problem Optimization with varying evaluation costs in expensive functions.
method Cost Apportioned Bayesian Optimization (CArBO) combining initial and cost-cooled phases.
result CArBO finds better hyperparameter configurations with the same cost budget.
PiVoT improves real-time multi-object detection and tracking in clutter.
problem Challenges in multi-object detection and tracking from noisy point clouds.
method Variational inference for fast, clutter-resilient multi-object tracking.
result Substantial performance improvement over existing Bayesian trackers.
We investigate whether a robot arm can learn to pick and throw arbitrary objects into selected boxes quickly and accurately. Throwing has the potential to increase the physical reachability and picking speed of a robot arm. However, precisely throwing arbitrary objects in unstructured settings presents many challenges:…
We study the problem of object detection over scanned images of scientific documents. We consider images that contain objects of varying aspect ratios and sizes and range from coarse elements such as tables and figures to fine elements such as equations and section headers. We find that current object detectors fail to…
Proposes a new method for continual learning in neural networks.
problem Challenges in applying sequential Bayesian inference to neural networks.
method Sequential function-space variational inference.
result Neural networks trained with the proposed method achieve better predictive accuracy.
Photometric stereo is a method for estimating the normal vectors of an object from images of the object under varying lighting conditions. Motivated by several recent works that extend photometric stereo to more general objects and lighting conditions, we study a new robust approach to photometric stereo that utilizes …