Graph Pointer Networks and hierarchical reinforcement learning solve combinatorial optimization problems like TSP.
problem Traveling Salesman Problem (TSP) with constraints.
method Graph Pointer Networks (GPNs) and hierarchical reinforcement learning.
result GPNs and hierarchical RL find optimal solutions for TSP and TSP with time windows.
PGNs dynamically infer and use graph structures to improve model generalization.
problem Static graph structures inferred by machine learning practitioners are often suboptimal for tasks.
method PGNs augment graphs with dynamically inferred pointers for improved model generalization.
result PGNs outperform unrestricted GNNs and Deep Sets on dynamic graph connectivity tasks.
Paper addresses shortcomings in pointer generator networks for summarization.
problem Extractive summaries and factual inaccuracies in generated text.
method Appends traditional linguistic information to teach networks on text structure.
result Feasibility and potential of additional cues for improved generation.
This study improves text summarization and fake news detection using neural models.
problem Improving text summarization and detecting fake news.
method Exploring and comparing different neural models for text summarization, including LSTM-encoder-decoder, pointer-generator networks, and transformers. Applying these models as a feature extractor for fake news detection.
result The proposed neural models enhance text summarization and improve fake news detection accuracy.
New benchmark PVR tests neural network reasoning about indirection.
problem Understanding neural network generalization limits.
method Introducing Pointer Value Retrieval (PVR) benchmark.
result Large variations in performance across different conditions.
A new method uses machine learning to optimize user pairing and association in multicell NOMA networks.
problem Optimizing user pairing and association in multicell non-orthogonal multiple access (NOMA) systems.
method Formulated as a combinatorial optimization problem, solved using a Pointer Network (PtrNet) trained with deep reinforcement learning.
result Achieves near-optimal performance in terms of aggregate data rate, outperforming random heuristics by up to 30%.
Jointly learning to localize and repair variable-misuse bugs improves program repair.
problem Variable-misuse bugs in programs.
method Multi-headed pointer networks for joint localization and repair.
result Joint model significantly outperforms an enumerative solution.
We introduce a new neural architecture to learn the conditional probability of an output sequence with elements that are discrete tokens corresponding to positions in an input sequence. Such problems cannot be trivially addressed by existent approaches such as sequence-to-sequence and Neural Turing Machines, because th…
ADRL improves participant selection in MCS systems.
problem Designing a participant selection algorithm for different MCS systems with multiple goals.
method Auxiliary-task based deep reinforcement learning (ADRL) using transformers and pointer networks.
result ADRL outperforms other baselines in various MCS settings.
Travel providers such as airlines and on-line travel agents are becoming more and more interested in understanding how passengers choose among alternative itineraries when searching for flights. This knowledge helps them better display and adapt their offer, taking into account market conditions and customer needs. Som…
This paper explores using neural networks to improve Airbnb search performance.
problem Plateaued gains from gradient boosted decision tree model in search ranking.
method Applied neural networks to improve search performance.
result Shows elements useful in applying neural networks to a real-life product.
RNNs are crucial for text and speech tasks, explained in this overview.
problem Understanding RNNs for advanced AI tasks.
method Overview of RNN concepts and recent advances.
result Fundamentals and recent techniques in RNNs.
Paper proposes continuous residual layers for graph neural networks.
problem Low-pass filtering effect in GCN-based models.
method Integrates Ordinary Differential Equations (ODE) to produce outputs of continuous residual layers.
result Continuous residual layers achieve better results than non-residual modules in multiple layers.
Explains differences between WL and folklore-WL formulations in graph neural networks.
problem Understanding the differences between WL and folklore-WL formulations in graph neural networks.
method Visual explanation of differences between WL and folklore-WL formulations.
result Clarifies the differences between WL and folklore-WL formulations.
Felix Klein's so-called Erlangen Program was published in 1872 as professoral dissertation. It proposed a new solution to the problem how to classify and characterize geometries on the basis of projective geometry and group theory. The given translation was made in 1892 by Dr. M. W. Haskell and transcribed by N. C. Rug…
Graph2Diff neural network predicts precise code changes for build errors.
problem Fixing build errors in software development.
method Represented code and errors as graphs, used Graph Neural Network to predict precise diffs.
result Graph2Diff achieves over double the accuracy of DeepDelta in predicting precise code changes.
This paper presents an introduction to the stochastic concepts of \emph{coupling} and \emph{copula}. Coupling means the construction of a joint distribution of two or more random variables that need not be defined on one and the same probability space, whereas a copula is a function that joins a multivariate distributi…
Neural networks model code edits from source code changes.
problem Modeling dynamic changes in source code.
method Developed neural networks to learn and predict code edits.
result Attentional and pointer network components provide best performance.
Deep learning solves EV routing with time windows for EV fleets.
problem Electric vehicle routing with time windows for logistics.
method End-to-end deep reinforcement learning with attention model and graph embedding.
result Proposed model efficiently solves large EVRPTW instances.
The recently presented idea to learn heuristics for combinatorial optimization problems is promising as it can save costly development. However, to push this idea towards practical implementation, we need better models and better ways of training. We contribute in both directions: we propose a model based on attention …
The paper explores how neural networks learn logical functions and their generalization error.
problem Learning logical functions with neural networks and understanding generalization error.
method Gradient descent on neural networks, analyzing noise-stability and Boolean influence.
result Gradient descent on certain neural architectures tends to favor low-degree representations, impacting generalization error.
This paper improves keyword recommendation for sponsored search using deep reinforcement learning.
problem Selecting keywords from given candidates considering internal and external competitions.
method Solves the combinatorial optimization problem of keyword recommendations with a modified pointer network structure trained in a deep reinforcement learning framework.
result Remarkable improvements in performance observed both offline and online.
Unsupervised summarization generates novel reviews reflecting consensus opinions.
problem Creating summaries that reflect subjective information in multiple documents.
method Generative model with hierarchical variational autoencoder, pointer-generator mechanism.
result Model produces fluent and coherent summaries reflecting common opinions.
This monograph aims at providing an introduction to key concepts, algorithms, and theoretical results in machine learning. The treatment concentrates on probabilistic models for supervised and unsupervised learning problems. It introduces fundamental concepts and algorithms by building on first principles, while also e…
Article examines NFT market microstructure and trading risks.
problem Difficulty in distinguishing genuine NFTs from fads and scams.
method Analyzes price formation, market structure, and transparency.
result Provides due-diligence pointers to mitigate NFT trading risk.
Proves exponential sample complexity separations in local differential privacy.
problem Sample complexity in locally private protocols.
method Connection between communication complexity and sample complexity, using specific lower bounds for two problems.
result Exponential separations between differentially private protocols.
Data analysis and data mining are concerned with unsupervised pattern finding and structure determination in data sets. "Structure" can be understood as symmetry and a range of symmetries are expressed by hierarchy. Such symmetries directly point to invariants, that pinpoint intrinsic properties of the data and of the …
A 3D flexible bin packing problem (3D-FBPP) arises from the process of warehouse packing in e-commerce. An online customer's order usually contains several items and needs to be packed as a whole before shipping. In particular, 5% of tens of millions of packages are using plastic wrapping as outer packaging every day, …
Deep learning has improved performance on many natural language processing (NLP) tasks individually. However, general NLP models cannot emerge within a paradigm that focuses on the particularities of a single metric, dataset, and task. We introduce the Natural Language Decathlon (decaNLP), a challenge that spans ten ta…
Deep learning improves MRI analysis, promising future in medical imaging.
problem Improving accuracy and efficiency in MRI analysis.
method Application of deep artificial neural networks to MRI processing.
result Deep learning outperforms traditional methods in MRI analysis.
VR methods improve SGD for faster machine learning.
problem Efficiency in stochastic optimization for machine learning.
method Variance reduction techniques for stochastic optimization.
result VR methods achieve faster convergence than SGD.
In recent times, sequence-to-sequence (seq2seq) models have gained a lot of popularity and provide state-of-the-art performance in a wide variety of tasks such as machine translation, headline generation, text summarization, speech to text conversion, and image caption generation. The underlying framework for all these…
This paper reviews state-of-the-art mixed data clustering algorithms.
problem Clustering mixed data is challenging due to the difficulty in applying mathematical operations to feature values.
method Taxonomy and state-of-the-art review of mixed data clustering algorithms.
result Identification of five major research themes and analysis of strengths and weaknesses of methods.
This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends, assume the role played in finite graphs by paths and cycles. This approach has made …
Blockchain protocol improves traditional mutual funds with performance fees and investor protection.
problem Operational issues and performance fees in traditional mutual funds.
method Developed a blockchain protocol that integrates features of mutual funds and hedge funds.
result Blockchain can simplify performance fee calculations and protect investors.
New models improve morpheme segmentation in low-resource languages.
problem Improving morpheme segmentation in low-resource languages.
method Two new models: LSTM pointer-generator and sequence-to-sequence with hard monotonic attention.
result Novel models outperform existing ones by up to 11.4% accuracy in low-resource settings.
Unified framework for set-valued classification tackles ambiguous multi-class datasets.
problem Ambiguous multi-class datasets in modern statistics.
method Unified statistical framework encompassing various set-valued classification formulations.
result Infinite sample optimal strategies and plug-in principle for data-driven algorithms.
The Frank-Wolfe (FW) optimization algorithm has lately re-gained popularity thanks in particular to its ability to nicely handle the structured constraints appearing in machine learning applications. However, its convergence rate is known to be slow (sublinear) when the solution lies at the boundary. A simple less-know…
Digital risk scores predict depression and anxiety over 10 years.
problem Identifying individuals at risk of depression and anxiety.
method Developed a 10-year predictive algorithm using UKB cohort, selecting predictors via Cox proportional hazards model and DeepSurv.
result Highly discriminating models for depression and anxiety were developed.
Tangles improve clustering in various datasets.
problem Clustering diverse datasets efficiently and accurately.
method Tangles aggregate cuts to identify dense structures, leading to soft cluster characterization.
result Tangle framework generates hierarchical soft dendrograms for cluster exploration.
Abstract: A comprehensive list of trading strategies and market insights.
problem Understanding trading strategies and market insights for implementation.
method Broad categorization into Delta-One and Derivative strategies based on trading expertise.
result Demonstrates how to cater to diverse market participants' preferences.
Quantum learning complexity reviewed using information theory.
problem Learning properties of quantum systems or processing data via quantum computing.
method Information-theoretic techniques focusing on data, copy, and model complexity.
result Copy complexity due to irreversible quantum measurements limits information extraction.
The area of online machine learning in big data streams covers algorithms that are (1) distributed and (2) work from data streams with only a limited possibility to store past data. The first requirement mostly concerns software architectures and efficient algorithms. The second one also imposes nontrivial theoretical …
A large number of statistical models are "doubly-intractable": the likelihood normalising term, which is a function of the model parameters, is intractable, as well as the marginal likelihood (model evidence). This means that standard inference techniques to sample from the posterior, such as Markov chain Monte Carlo (…
Safe-House secures DeFi by limiting losses and enhancing security.
problem Ongoing hacks and security concerns in DeFi.
method Safe-House uses blockchain principles to secure asset movements.
result Safe-House limits maximum one-time loss to specified limits.
Survey on deep learning for social network analysis.
problem Encoding social network data into useful low-dimensional representations.
method Review of neural network models for node and subgraph embeddings in various network types.
result Advancements in deep learning for complex network analysis.
RFN improves GCNs for road networks, outperforming state-of-the-art by 21%-40%.
problem Leveraging the structure of road networks effectively in machine learning tasks.
method Introducing RFN, a novel GCN specifically designed for road networks.
result RFN outperforms state-of-the-art GCNs by 21%-40% on road network tasks.
Algorithm reconstructs conserved networks from flow data.
problem Network reconstruction from flow data.
method Polynomial time algorithm exploiting graph theoretic properties and learning techniques.
result Exact network reconstruction possible for arborescence networks.