Slot Attention extracts object-centric representations from images.
problem Learning distributed representations that don't capture natural scene composition.
method Slot Attention module interfaces with CNN outputs to produce task-dependent abstract slots.
result Slot Attention enables generalization to unseen compositions.
A multi-task learning model for slot tagging in biomedical domains.
problem Limited labeled data, memory constraints, and domain-specific slot types.
method Multi-task learning using deep bidirectional transformers.
result Outperforms previous state-of-the-art systems in efficiency and effectiveness.
A new method learns object representations from motion in slot representations.
problem Unsupervised object extraction from low-level visual data.
method Contrastive learning in slot representations, focusing on moving objects and distinct entities.
result Introduced a new evaluation metric to measure diversity of slot vectors.
New model learns coupled representations for domains, intents, and slots.
problem Representation learning for domains, intents, and slots in spoken language understanding.
method Proposes a model that learns coupled representations by aggregating slot and intent representations based on their hierarchical relationships.
result Improved performance on contextual cross-domain reranking task.
Faster Ethereum slots boost CEX-DEX arbitrage by 535% and 203%.
problem Reducing Ethereum slot time impacts CEX-DEX arbitrage opportunities.
method Developed a trading model to simulate and compare agent behavior under different slot times.
result Faster slot times increase CEX-DEX arbitrage activity and returns.
In this letter, we propose a method for period estimation in light curves from periodic variable stars using correntropy. Light curves are astronomical time series of stellar brightness over time, and are characterized as being noisy and unevenly sampled. We propose to use slotted time lags in order to estimate corrent…
New estimator reduces risk in slate bandits by leveraging Bayes risk criterion.
problem Evaluating slate policies using logged data when policies factorize over slots.
method Developed a new estimator using a control variate approach, showing risk improvement over existing methods.
result The new estimator has lower risk than the pseudoinverse estimator in slate bandit problems.
Improves slot key and value prediction for unseen entities.
problem Dealing with unseen slot keys and values in real-world dialogue systems.
method Leverages external knowledge bases to project slots into an attribute space and generate candidate keys and values.
result Significant improvements in F1 score and accuracy (57.7% and 82.7%, respectively) over a previous approach.
Ranking items to be recommended to users is one of the main problems in large scale social media applications. This problem can be set up as a multi-objective optimization problem to allow for trading off multiple, potentially conflicting objectives (that are driven by those items) against each other. Most previous app…
Improves dialogue state tracking across multiple domains.
problem Incomplete domain ontology limits DST models' adaptability.
method Model DST as Q&A, using evolving knowledge graph.
result 5.80% and 12.21% relative improvement on datasets.
MA-DST improves multi-domain dialog state tracking.
problem Accurate multi-domain dialog state tracking in natural language interfaces.
method Multi-attention based architecture to encode conversation history and slot semantics.
result Improves joint goal accuracy by 5% in full-data setting and up to 2% in zero-shot setting.
GOLOMB improves dialogue state tracking for unseen services.
problem Improving dialogue state tracking for multiple services and APIs.
method GOLOMB uses a BERT-based model that queries dialogue history with slot descriptions and values.
result GOLOMB achieves a joint goal accuracy of 53.97% on the SGD dataset.
Expanding spoken language understanding to handle complex entities and intents.
problem Handling compound entities and intents in spoken language understanding.
method Introducing a domain-agnostic shallow parser that handles linguistic coordination, learning domain-independent and slot-independent features.
result The model learns to segment conjunct boundaries of various phrasal categories and improves generalization across different slot types using adversarial training.
The paper classifies Killing tensor fields on Riemannian symmetric spaces.
problem Understanding Killing tensor fields on Riemannian symmetric spaces.
method Reduced study to compact irreducible spaces, introduced top slot Killing tensor fields, and classified quadratic fields.
result Quadratic Killing tensor fields on Riemannian symmetric spaces of rank one are spanned by top-slot and decomposable fields.
Unified model for sequence labeling and classification.
problem Efficiently perform multiple sequence labeling tasks.
method Generative framework with shared natural language output space.
result Significant improvements in few-shot and low-resource slot labeling.
Existing approaches to online convex optimization (OCO) make sequential one-slot-ahead decisions, which lead to (possibly adversarial) losses that drive subsequent decision iterates. Their performance is evaluated by the so-called regret that measures the difference of losses between the online solution and the best ye…
Paper investigates neural query graph ranking for complex question answering over knowledge graphs.
problem Improving neural models for complex question answering over knowledge graphs.
method Experimented with six ranking models, proposed a self-attention based slot matching model.
result Proposed model outperforms other models on DBpedia QA datasets.
Algorithm minimizes loss and constraint violations in online convex optimization with smooth penalties.
problem Minimizing loss and constraint violations in online convex optimization with smooth penalties.
method Projected gradient descent over a set around the current action.
result Both dynamic regret and constraint violation are bounded by the path-length.
LGAC enhances heat transfer in turbulent boundary layers using slot jets.
problem Enhancing convective heat transfer in turbulent boundary layers.
method Artificial intelligence-based linear genetic algorithms control (LGAC) with slot jets.
result LGAC optimizes heat transfer and flow asymmetry in turbulent boundary layers.
New algorithm reduces age of information in wireless networks with unknown channel reliability.
problem Learning optimal source-channel pairs to minimize age of information in wireless networks.
method Introduces AoI regret, novel learning algorithm with bounded AoI regret.
result Developed a learning algorithm with O(1) AoI regret, improving upon Θ(logT). Framework for optimizing search engine rankings using observational data.
problem Optimizing ranking policies for search engines using limited observational data.
method Formulated expected reward optimization problem, estimated context value distribution, trained ranking policy via Bayesian inference.
result Demonstrated trade-offs in ranking policies trained on empirical reward estimates.
Gamblers lose in long bets despite casino claims, study shows.
problem Gamblers losing in seemingly fair gambling scenarios.
method Theoretical and experimental analysis of two-armed Futurity slot machines.
result Casinos have a win rate greater than 50% in long bets, making them unfair.
The problem of distributed learning and channel access is considered in a cognitive network with multiple secondary users. The availability statistics of the channels are initially unknown to the secondary users and are estimated using sensing decisions. There is no explicit information exchange or prior agreement amon…
Opportunistic spectrum access is one of the emerging techniques for maximizing throughput in congested bands and is enabled by predicting idle slots in spectrum. We propose a kernel-based reinforcement learning approach coupled with a novel budget-constrained sparsification technique that efficiently captures the envir…
Graph-based rehearsal improves continual learning performance.
problem Catastrophic forgetting in continual learning models.
method Augmenting a memory array with a learnable random graph to capture pairwise similarities.
result Our model consistently outperforms baselines on task-free continual learning benchmarks.
New approach uses neural networks for MIMO modulation without black-box optimization.
problem Improving MIMO modulation for non-coherent channels with short coherence windows.
method Simulation-driven optimization using neural networks for modulation and signal detection design.
result Demonstrated that neural networks can be avoided while still achieving comparable performance in MIMO communications.
Quantum circuits represent binary classification trees with binary features.
problem Classifying data using binary classification trees with binary features.
method Quantum circuits and probabilistic approach for traversing decision trees.
result First realization of a decision tree classifier on a quantum device.
Constellation learns group-level visual relationships for abstract reasoning.
problem Learning configurational properties of entire groups of objects.
method Introduces Constellation, a network that learns relational abstractions over static visual scenes.
result Offers a basis for abstract relational reasoning and sensory imagination.
Optimal policy for multi-hypothesis testing with controlled sensing to minimize delay and error.
problem Minimizing delay in multi-hypothesis testing with controlled sensing.
method Designing a policy to control the delay while ensuring error probability constraint.
result Policy achieves information-theoretic lower bound on expected delay asymptotically.
New algorithms reduce slate bandit regret for large slates, outperforming existing methods.
problem Non-separable reward functions in slate bandits with many slates.
method Design of algorithms with sub-linear regret.
result Sub-linear regret with respect to the time horizon for large number of slates.
A new framework describes dissipation using a metriplectic 4-bracket.
problem Describing dissipation in a way that preserves energy and entropy.
method Using a metriplectic 4-bracket, a quantity like the Poisson bracket with symmetries motivated by Riemannian curvature.
result The metriplectic 4-bracket dynamics includes all known previous binary bracket theories for dissipation.
Proper balance between exploitation and exploration is what makes good decisions, which achieve high rewards like payoff or evolutionary fitness. The Infomax principle postulates that maximization of information directs the function of diverse systems, from living systems to artificial neural networks. While specific a…
BAT benchmark for autobidding tasks in RTB auctions.
problem Lack of comprehensive datasets and benchmarks for autobidding.
method Developed a benchmark for two auction formats, implemented robust baselines.
result Provides a framework for developing and refining autobidding algorithms.
APL learns from surprising observations to quickly generalize from few examples.
problem Quickly generalize from limited data for intelligent systems.
method Approximates probability distributions by remembering surprising observations in an external memory module.
result APL performs as well as state-of-the-art baselines on few-shot classification benchmarks.
We consider a variant of the classic multi-armed bandit problem where the expected reward of each arm is a function of an unknown parameter. The arms are divided into different groups, each of which has a common parameter. Therefore, when the player selects an arm at each time slot, information of other arms in the sam…
This work optimizes bid strategies for online auctions using measure-valued optimization.
problem Optimizing bid strategies in first-price auctions to maximize expected surplus.
method Formulates the problem as convex optimization over the joint distribution of shading parameters, adapts the distribution after each auction using a Wasserstein-proximal update.
result The proposed algorithm encourages bids on values with high expected surplus.
Improved set prediction model using multiset-equivariant operations and approximate implicit differentiation.
problem Existing set prediction models struggle with multisets and cannot represent certain functions.
method Introduced multiset-equivariance, improved DSPN with approximate implicit differentiation, and applied to CLEVR object property prediction.
result Significantly improved object property prediction on CLEVR dataset.
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.
We consider the problem of dynamic buying and selling of shares from a collection of N stocks with random price fluctuations. To limit investment risk, we place an upper bound on the total number of shares kept at any time. Assuming that prices evolve according to an ergodic process with a mild decaying memory proper…
This paper deals with bandit online learning problems involving feedback of unknown delay that can emerge in multi-armed bandit (MAB) and bandit convex optimization (BCO) settings. MAB and BCO require only values of the objective function involved that become available through feedback, and are used to estimate the gra…
Deep actor-critic learning optimizes power control in mobile networks.
problem Optimizing power control in large-scale wireless mobile networks.
method Multi-agent deep reinforcement learning with deep deterministic policy gradient.
result The algorithm maximizes a global utility function in a distributed manner.
Optimizes energy efficiency in wireless sensor networks with limited information.
problem Maximizing energy efficiency in energy harvesting wireless sensor networks with limited channel state information.
method Modeling as a Multi-Armed Bandits problem and developing an Upper Confidence Bound algorithm.
result Significant gains in energy efficiency compared to benchmark schemes.
New model predicts optimal control for restless bandit problems.
problem Optimizing control in restless bandit problems with minimal assumptions.
method Model Predictive Control with rolling horizon linear programming.
result Sub-optimality gap of O(1/√N) under general conditions, and exp(-Ω(N)) under local-stability condition.
Proposes DenoiseBid to correct uncertain CTR and CVR estimates for autobidding.
problem Uncertainty in CTR and CVR estimates affects autobidding algorithm performance.
method Bayesian approach to correct noisy estimates with recovered distributions.
result Proposed DenoiseBid method improves efficiency of autobidding in auctions.
DOMKL learns functions from IoT data with minimal regret and consensus constraints.
problem Learning from streaming IoT data while preserving privacy.
method DOMKL combines OADMM and distributed Hedge for online learning with multiple kernels.
result DOMKL achieves optimal sublinear regret and consensus constraints.
RAGuard improves safety in LLMs for offshore wind maintenance.
problem Conventional LLMs fail with specialised or unexpected scenarios in offshore wind maintenance.
method Integrates safety-critical documents alongside technical manuals in RAG framework.
result RAGuard increases safety recall from almost 0% to over 50% while maintaining technical recall above 60%.
A new framework uses directed information to efficiently select context chunks.
problem Efficiently selecting relevant context chunks for query understanding.
method Directed Information γ-covering framework, formulated as a γ-cover problem, with a greedy algorithm for context selection. result The γ-covering algorithm provides clear advantages in hard-decision regimes like context compression and single-slot prompt selection. The multi-armed bandit (MAB) problem is a classic example of the exploration-exploitation dilemma. It is concerned with maximising the total rewards for a gambler by sequentially pulling an arm from a multi-armed slot machine where each arm is associated with a reward distribution. In static MABs, the reward distributi…