New model predicts which search snippets will be clicked.
problem Predicting user behavior in search results.
method Proposes a micro-browsing model for analyzing snippet texts.
result Micro-browsing model predicts higher CTR than traditional models.
Predicts programming languages from Stack Overflow questions and snippets.
problem Incorrectly tagging programming languages in Stack Overflow questions.
method Combines NLP features from titles, bodies, and code snippets for prediction.
result Combined features classifier achieves 91.1% accuracy.
Descriptive titles provide crucial context for interpreting tables that are extracted from web pages and are a key component of table-based web applications. Prior approaches have attempted to produce titles by selecting existing text snippets associated with the table. These approaches, however, are limited by their d…
SCC identifies 21 programming languages with 75% accuracy.
problem Classifying code snippets among 21 programming languages.
method Multinomial Naive Bayes classifier trained on Stack Overflow posts.
result SCC achieves 75% accuracy, significantly higher than PLI.
Models extract relevant EHR snippets to aid radiologists in diagnosis.
problem Difficulty in identifying relevant patient record information for diagnosis.
method Distantly supervised transformer-based neural model for extractive summarization.
result Models yield better extractive summaries than unsupervised approaches.
CoNCRA uses CNN to find code snippets matching developer intent.
problem Finding relevant code snippets using general search engines.
method Convolutional Neural Network approach to code retrieval.
result Improved code retrieval by 5% on average, top 3 positions 80% of the time.
This paper uses machine learning to assist automation engineers in decision making.
problem Imperfect decision making by automation engineers leads to multiple iterations and increased time for software development.
method Defined challenges and proposed solutions using machine learning for automation engineering, including code classification, finding similar code snippets, and hardware selection.
result Paragraph embedding techniques achieved an F1-score of 72% for classifying automation using code snippets, and autoencoder models for hardware recommendation achieved p@3 and p@5 of 0.79 and 0.95, respectively.
Deep neural network predicts semantic labels for source code.
problem Difficulty in labeling and understanding new programming languages and functionalities.
method Language-agnostic deep convolutional neural network trained on Stack Overflow code snippets.
result Mean area under ROC of 0.957 and top-1 accuracy of 86.6% on Github code documents.
Multi-modal data collections, such as corpora of paired images and text snippets, require analysis methods beyond single-view component and topic models. For continuous observations the current dominant approach is based on extensions of canonical correlation analysis, factorizing the variation into components shared b…
Music SketchNet generates missing measures in incomplete music pieces, guided by user input.
problem Generating missing measures in incomplete monophonic musical pieces.
method Introducing SketchVAE for factorized representation of rhythm and pitch, and two discriminative architectures for guided music completion.
result Our approach outperforms state-of-the-art models in both objective and subjective evaluations.
Deep networks are able to learn highly predictive models of video data. Due to video length, a common strategy is to train them on small video snippets. We apply the deep Taylor / LRP technique to understand the deep network's classification decisions, and identify a "border effect": a tendency of the classifier to loo…
AWARE-FX uses AI to audit foreign-exchange risk disclosures in corporate reports.
problem Weakly structured foreign-exchange risk disclosures in corporate reports.
method Combines lexicon, logic, encoders, and aggregation methods to convert text into traceable measures.
result FinBERT outperforms in most comparisons, improving F1 scores by up to 0.077.
We present a neural model for representing snippets of code as continuous distributed vectors ("code embeddings"). The main idea is to represent a code snippet as a single fixed-length code vector, which can be used to predict semantic properties of the snippet. This is performed by decomposing code to a col…
A new approach to rationalization identifies true rationales by considering causal relationships.
problem Existing rationalization methods struggle with spuriousness, where snippets with similar contributions are hard to distinguish.
method The method leverages causal inference to identify non-spurious rationales, defining probabilities of causation based on a structural causal model.
result The proposed causal rationalization outperforms existing methods on real-world datasets.
The ability to generate natural language sequences from source code snippets has a variety of applications such as code summarization, documentation, and retrieval. Sequence-to-sequence (seq2seq) models, adopted from neural machine translation (NMT), have achieved state-of-the-art performance on these tasks by treating…
Requirements elicitation requires extensive knowledge and deep understanding of the problem domain where the final system will be situated. However, in many software development projects, analysts are required to elicit the requirements from an unfamiliar domain, which often causes communication barriers between analys…
GAS models have been recently proposed in time-series econometrics as valuable tools for signal extraction and prediction. This paper details how financial risk managers can use GAS models for Value-at-Risk (VaR) prediction using the novel GAS package for R. Details and code snippets for prediction, comparison and back…
Music highlights are valuable contents for music services. Most methods focused on low-level signal features. We propose a method for extracting highlights using high-level features from convolutional recurrent attention networks (CRAN). CRAN utilizes convolution and recurrent layers for sequential learning with an att…
We consider the task of detecting regulatory elements in the human genome directly from raw DNA. Past work has focused on small snippets of DNA, making it difficult to model long-distance dependencies that arise from DNA's 3-dimensional conformation. In order to study long-distance dependencies, we develop and release …
If a document is about travel, we may expect that short snippets of the document should also be about travel. We introduce a general framework for incorporating these types of invariances into a discriminative classifier. The framework imagines data as being drawn from a slice of a Levy process. If we slice the Levy pr…
SVM with local features improves human action recognition.
problem Improving human action recognition in videos.
method Local appearance and motion features extracted using CNNs, concatenated, and used with SVM for classification.
result SVM with local features outperforms previous methods on benchmark datasets.
Automates translating natural language to Verilog for digital design.
problem Manual translation of natural language specifications to Verilog is time-consuming and error-prone.
method Fine-tuned GPT-2 to derive Verilog from English, using a dataset of design tasks.
result GPT-2 achieved 94.8% correct translation across simple and abstract design tasks.
Unified platform for optimal stopping problems in R.
problem Optimal stopping problems in machine learning.
method Unified implementation of Regression Monte Carlo algorithms.
result Unified and reproducible platform for RMC algorithms.
SAPS synthesizes code from natural language specifications.
problem Efficiently translating complex NL specifications into executable code.
method Structure-aware neural network using abstract syntax trees and LSTM.
result SAPS produces correct programs in over 92% of cases.
SLM models code syntax as trees to generate any programming language code.
problem Generating any piece of code in a given language without restrictions.
method Structural language modeling (SLM) decomposes code into ASTs and estimates probabilities over nodes.
result SLM model generates arbitrary code in any language, outperforming previous methods.
Scene text magnifier enhances readability for visually impaired.
problem Helps visually impaired read natural scene text.
method Four CNN-based networks: character erasing, extraction, magnify, synthesis.
result Effective text magnification without background alteration.
The study learns neural update rules by remembering past experiences.
problem Developing efficient online learning rules for neural networks.
method Representing neurons with vectors, using meta-neural networks for updates, and training for remembering past experiences.
result The approach reveals insights into learning rules and could be used for complex tasks like episodic memory.
The paper classifies actions of a specific group on certain manifolds.
problem Classifying analytic actions of a specific semi-orthogonal group on manifolds.
method Adapting Uchida's construction, the paper explicitly constructs actions on specific manifolds and demonstrates that any action is covered by these.
result Any analytic action of the semi-orthogonal group on a closed, connected manifold is covered by the constructed actions.
W-RNN improves text classification by extracting serialized text semantics.
problem Semantic constraint in sparse representation classification methods.
method Weighted RNN using word vectors and recurrent neural networks.
result W-RNN outperforms other methods in precision, recall, F1, and loss values.
The paper solves the Nielsen realization problem for high degree del Pezzo surfaces.
problem Which finite subgroups of the mapping class group of a del Pezzo surface lift to the diffeomorphism group?
method Classification and partial answers for d≥7, equivariant connected sum for d=6. result Complete classification for d≥7, partial answer for d=6. We establish a gluing construction for Higgs bundles over a connected sum of Riemann surfaces in terms of solutions to the Sp(4,R)-Hitchin equations using the linearization of a relevant elliptic operator. The construction can be used to provide model Higgs bundles in all the 2g−3 exce…
This paper tackles text infilling, a task of filling missing text portions, and presents a self-attention model that outperforms other methods.
problem The task of filling missing text portions, especially when the number and length of missing portions are unknown.
method A self-attention model with segment-aware position encoding and bidirectional context modeling, trained on extensive supervised data.
result The self-attention model significantly outperforms other approaches, setting a strong baseline for future research.
A new text representation model combines CNN and VAE for better semantic extraction.
problem Difficult to effectively extract semantic features and distinguish polysemy in text data.
method Integrates CNN for feature extraction and VAE for consistent Gaussian distribution.
result The model outperforms traditional classification algorithms in text classification tasks.
We propose two algorithms that can find local minima faster than the state-of-the-art algorithms in both finite-sum and general stochastic nonconvex optimization. At the core of the proposed algorithms is One-epoch-SNVRG+ using stochastic nested variance reduction (Zhou et al., 2018a), which outperforms the s…
New families of Lie groups with special foliations discovered.
problem Characterizing left-invariant foliations on semi-Riemannian Lie groups.
method Classifying foliations generated by specific subgroups.
result Constructing new families of Lie groups with conformal minimal foliations.
Improved text summarization using belief propagation on weighted bipartite graphs.
problem Text summarization from a graph theory perspective.
method Generalized belief propagation algorithm for weighted bipartite graphs.
result Our algorithm outperforms greedy methods in text summarization tasks.
New TC variant dTC better fits motion planning for some systems.
problem Improving motion planning for autonomous systems.
method Defined and computed new homotopy invariant dTC.
result dTC and dcat provide better motion planning solutions.
StoryGen uses images to generate coherent text from multiple images.
problem Generating coherent text from multiple images.
method Designing a Relational Text Data Generator algorithm to relate features from plural images.
result The model can generate meaningful paragraphs containing extracted features from input images.
Projective naturality proved for Heegaard Floer homology.
problem Proving naturality of Heegaard Floer invariants under diffeomorphisms.
method Showed Heegaard Floer invariants yield functors to transitive systems in a projectivized category of Z[U]-modules. result Established Heegaard Floer invariants as functors to transitive systems in a projectivized category.
Paper generates diverse, readable adversarial texts from scratch.
problem Text classification models are easily fooled by adversarial examples.
method Trained a conditional variational autoencoder (VAE) with adversarial loss and utilized GANs to generate consistent adversarial texts.
result Successfully generates adversarial texts with higher success rate and acceptable quality.
Unified framework improves NLP tasks by converting diverse problems into text-to-text format.
problem Improving natural language processing tasks through transfer learning.
method Unified text-to-text transformer framework, comparing various pre-training objectives and architectures.
result Achieved state-of-the-art results on multiple NLP benchmarks.
SCROLLS benchmarks long text NLP tasks, improving existing models.
problem Short NLP benchmarks ignore long texts; SCROLLS addresses this.
method Handpicked long-text datasets for summarization, QA, and inference tasks.
result Improvement potential on SCROLLS tasks, as indicated by initial baselines.
New method detects text changes under dependencies, outperforming baselines.
problem Detecting structural changes in m-dependent text data. method Kernel change-point detection under m-dependence. result Consistent and weakly consistent detection of change points in m-dependent text. Contextual bandits study how reward variance affects regret bounds.
problem Investigating how small reward variance impacts regret bounds in contextual bandits.
method Analyzing two types of adversaries and function approximation complexities.
result Regret bounds are influenced by the eluder dimension and reward variance.
Automates text mining by learning effective representations from raw text.
problem Limited automation in text mining for non-experts.
method Meta-learning approach to automatically obtain text representations.
result Proposed methodology yields highly effective text classification pipelines.
Improves text-to-image generation with bidirectional capabilities.
problem Generating realistic images from text descriptions.
method Integrates text and image modalities using MMVR architecture with n-gram cost function and multiple sentences.
result Significant improvement in image quality over existing methods (over 20%).
The paper studies symplectic structures on character varieties of Sasakian threefolds.
problem Character varieties of Sasakian threefolds and their symplectic structures.
method Constructing a natural algebraic 2-form and showing its properties.
result The restriction of the 2-form to the space of irreducible SU(r) homomorphisms is symplectic.
Proposes spherical text embedding for better directional similarity.
problem Directional similarity is more effective but unsupervised text embeddings are typically learned in Euclidean space.
method Develops a spherical generative model and an efficient optimization algorithm for unsupervised word and paragraph embeddings.
result Achieves state-of-the-art performances on various text embedding tasks.