Prototype sentences edited for better language models and quality.
problem Improving sentence generation quality and efficiency.
method Samples a prototype sentence, edits it, and uses a latent edit vector.
result Improves perplexity and generates higher quality sentences.
Metric learning improves tree edit distance for better classification.
problem Improving tree edit distance for better classification accuracy.
method Adaptive symbol embeddings to learn tree edit distance indirectly.
result Embedding edit distance learning (BEDL) improves upon state-of-the-art on multiple tree data sets.
A new method embeds tree nodes to vectors for better tree edit distance learning.
problem Learning tree edit distances directly often violates metric axioms and is hard to interpret.
method Adaptive symbol embeddings to learn tree edit distances indirectly.
result Improves tree edit distance learning on multiple datasets.
Bounds on VC dimension for 1NN classifiers with fixed prototype sets.
problem No theoretical results for VC dimension of 1NN classifiers with fixed size prototype sets.
method Collected and used relevant theoretical results to provide explicit lower and upper bounds.
result Explicit lower and upper bounds for VC dimension of 1NN classifiers with fixed prototype set size.
Prototype selection improves DS techniques' accuracy and reduces computational cost.
problem Improving the performance of dynamic selection techniques.
method Prototype selection techniques that edit validation data to remove noise and redundant instances.
result Improves DS techniques' classification accuracy and reduces computational cost.
Localized Multidirectional Correction improves non-refusal target-response behavior in foundation models.
problem Controlled post-training refusal suppression in routed MoE and hybrid-MoE foundation models.
method Introduce Localized Multidirectional Correction (LoMC), a support-gated intervention framework.
result Substantially improves non-refusal target-response behavior while maintaining general capability under a compact intervention footprint.
Prototype selection improved using topological data analysis.
problem Improving prototype selection methods for data compression.
method Introducing two topological prototype selector variants: TPS and BoundaryTPS.
result BoundaryTPS achieves the lowest mean Friedman rank on H1 persistence-diagram preservation. New method for finding function correspondences in binary programs.
problem Finding a correspondence between functions of two binary programs.
method Formulated as a network alignment problem and solved using belief propagation.
result QBinDiff prototype outperforms state-of-the-art diffing tools.
Models learn to represent edits from natural language and code.
problem Learning distributed representations of edits.
method Combining a neural editor with an edit encoder.
result Models can capture the structure and semantics of edits.
ED-NeRF efficiently edits 3D scenes using latent space NeRF and improved loss functions.
problem Slow training speeds and inadequate editing loss functions in existing NeRF editing techniques.
method Embedding real-world scenes into latent space of LDM, using a unique refinement layer and an improved loss function.
result ED-NeRF achieves faster editing speed and improved output quality compared to state-of-the-art models.
Predicts edit survival in peer-production systems.
problem Predicting the survival of edits in large-scale peer-production systems.
method Modeling edit survival as a game between editor skill, component difficulty, and user-component interaction.
result Model significantly outperforms user reputation-based methods and specialized predictors.
We present a new, efficient method for automatically detecting severe conflicts `edit wars' in Wikipedia and evaluate this method on six different language WPs. We discuss how the number of edits, reverts, the length of discussions, the burstiness of edits and reverts deviate in such pages from those following the gene…
A new smooth edit distance for easier optimization in machine learning.
problem Hard optimization of edit distance for variable-length sequences.
method Soft edit distance (SED) as a differentiable approximation.
result SED can be optimized with gradient methods and used for clustering.
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.
Ground-A-Video edits videos without training, preserving intended changes.
problem Complex multi-attribute video editing with omitted or wrong changes.
method Grounding-guided video-to-video translation with Cross-Frame Gated Attention.
result Zero-shot multi-attribute video editing with improved accuracy and frame consistency.
A framework that edits existing examples to generate structured outputs.
problem Generating complex outputs like code is hard.
method Retrieve a training example, edit it, and use a computationally efficient retrieval model.
result Retrieve-and-edit framework significantly boosts performance on code and card tasks.
Paper fine-tunes LLMs using user edits, unifying preference, supervision, and reward feedback.
problem Adapting LLMs to user preferences and feedback types.
method Derives bounds for learning algorithms from user edits, proposes an ensembling procedure.
result Ensembling procedure outperforms individual feedback methods and robustly adapts to different user-edit distributions.
MEGAN models chemical reactions as graph edits, improving synthesis planning.
problem Generating and predicting chemical reactions under constraints.
method End-to-end encoder-decoder neural model inspired by arrow pushing formalism.
result State-of-the-art accuracy in standard benchmarks for retrosynthesis prediction.
AttGAN edits facial attributes by changing only what you want, preserving details.
problem Facial attribute editing with preservation of details.
method Encoder-decoder architecture with attribute classification and reconstruction learning.
result Outperforms state-of-the-arts on realistic attribute editing with preserved details.
New method uses coupled SDEs to edit images with high fidelity and consistency.
problem Challenges in editing image content with text-to-image models.
method Using coupled stochastic differential equations to guide generative model sampling.
result Achieves high prompt fidelity and near-pixel-level consistency.
RS-Del provides robustness for sequence classifiers against edit distance attacks.
problem Certifying robustness of discrete sequence classifiers against edit distance attacks.
method Randomized deletion (RS-Del) for discrete sequence classifiers, focusing on edit distance-bounded adversaries.
result Achieved a certified accuracy of 91% at an edit distance radius of 128 bytes on malware detection.
Paper proposes efficient image inversion and editing using rectified stochastic differential equations.
problem Inversion and editing of real images using generative models.
method Proposes RF inversion using dynamic optimal control and a linear quadratic regulator, extending to stochastic sampler for Flux.
result Allows state-of-the-art performance in zero-shot inversion and editing, outperforming prior works.
New method detects watermarks in LLM-generated text with human edits.
problem Dilution of watermark signals by human edits on LLM-generated text.
method Truncated goodness-of-fit test (Tr-GoF) for robust detection.
result Tr-GoF achieves optimality in robust detection of Gumbel-max watermark.
Adversarial edit attacks improve machine learning model security for tree data.
problem Improving security of machine learning models for tree-structured data.
method Extends adversarial attacks to tree-structured data using tree edit distance and black-box queries.
result Many tree classifiers can be effectively attacked, demonstrating the vulnerability of these models.
A technique to quickly fix mistakes in neural networks.
problem Fixing model errors in neural networks quickly and without affecting other samples.
method Editable Training, a model-agnostic training technique.
result Effectiveness demonstrated on large-scale image classification and machine translation tasks.
A new stable edit distance for Reeb graphs is shown to be universal.
problem Stability and comparability of Reeb graphs under function similarity.
method Defined and proved stability and universality of Reeb graph edit distance.
result Reeb graph edit distance is the most stable and universal among distances.
Machine learning experiments show IID assumption is flawed for bathymetry editing.
problem Flawed IID assumption in machine learning for bathymetry editing.
method Real-world computer-assisted labeling task, IID assumption analysis.
result Common random split leads to poor performance in machine learning.
GMED edits stored examples to improve continual learning.
problem Catastrophic forgetting in task-free continual learning.
method Gradient-based memory editing of stored examples.
result GMED-edited examples help prevent forgetting.
New seq2seq model can copy entire spans, outperforming simpler models in editing tasks.
problem Editing documents or source code using seq2seq models with explicit token copying.
method Extended seq2seq model capable of copying entire input spans to output in one step, new training and inference methods.
result New model consistently outperforms simpler baselines in editing tasks of natural language and source code.
Professional-grade software applications are powerful but complicated−expert users can achieve impressive results, but novices often struggle to complete even basic tasks. Photo editing is a prime example: after loading a photo, the user is confronted with an array of cryptic sliders like "clarity", "temp", and "high…
New metric learning approach for tree data reduces computation cost.
problem Efficiently computing distances between ordered labeled trees.
method Introduced pq-grams and a differentiable weighted pq-gram distance, combined with LMNN for optimization.
result Significantly reduces computation time for tree classification problems.
XL-Editor improves sentence post-editing using XLNet's variable-length insertion probability.
problem Post-editing sentences to refine generated text.
method XL-Editor trains XLNet to estimate variable-length insertion probabilities and apply post-editing operations.
result XL-Editor outperforms XLNet on text insertion and deletion tasks, and achieves significant style transfer improvements.
ARED introduces a new dataset for Argentina's real estate market.
problem Lack of mixed modality datasets for Argentina's real estate market.
method Developed a comprehensive real estate price prediction dataset series for Argentina.
result Dataset captures time-dependent phenomena on a market level.
ProtoryNet interprets text sequences using prototype trajectories for better understanding.
problem Improving text classification interpretability and accuracy.
method ProtoryNet uses prototype trajectories to interpret text sequences, with prototype pruning for better interpretability.
result ProtoryNet outperforms baseline models and reduces performance gap compared to black-box models.
Prototype networks on hyperspheres improve classification and regression.
problem Improving classification and regression performance.
method Using hyperspherical prototypes for classification and regression, optimizing prototypes through data-independent margin separation.
result Hyperspherical prototype networks outperform other methods in classification, regression, and their combination.
Prototypal analysis is introduced to overcome two shortcomings of archetypal analysis: its sensitivity to outliers and its non-locality, which reduces its applicability as a learning tool. Same as archetypal analysis, prototypal analysis finds prototypes through convex combination of the data points and approximates th…
Infinite mixture prototypes adapt to complex data for few-shot learning.
problem Few-shot learning with complex data distributions.
method Adaptive representation of classes by clusters, inferring cluster number.
result 25% absolute accuracy improvement on alphabets, state-of-the-art semi-supervised clustering.
Model removes objects from general scenes using weak supervision.
problem Automatic object removal from general scene images with weak supervision.
method Two-stage editor architecture with mask generator and image in-painter; novel GAN prior for mask generator.
result Effectively removes a wide variety of objects from general scenes using weak supervision.
Optimal prototypes found for challenging pathological geometries.
problem Finding optimal prototypes for pathological geometries is challenging.
method Analytical and heuristic algorithms for finding nearly-optimal prototypes.
result Optimal prototypes can be found analytically for challenging geometries.
The Wikimedia Foundation has recently observed that newly joining editors on Wikipedia are increasingly failing to integrate into the Wikipedia editors' community, i.e. the community is becoming increasingly harder to penetrate. To sustain healthy growth of the community, the Wikimedia Foundation aims to quantitatively…
Method generates prototypes from small datasets for efficient learning.
problem Efficiently learning from small datasets with soft labels.
method Modular method for generating soft-label prototypical lines and Hierarchical Soft-Label Prototype k-Nearest Neighbor algorithm.
result High classification accuracy with significantly fewer prototypes than classes.
The paper introduces COAR to estimate component attributions and enable model editing.
problem Understanding how ML models transform inputs into predictions.
method Component modeling and COAR algorithm for estimating component attributions.
result COAR enables model editing across various tasks.
The study examines Euclid's Book I, focusing on area applications and construction methods.
problem Exploring Euclid's geometric constructions and proofs, particularly those involving area calculations.
method Summarizing medieval editions and ancient commentaries, comparing constructions and proofs.
result Medieval editions often avoid Euclid's use of superposition in area proofs, offering alternative constructions.
Agents use object-oriented reasoning to solve problems more quickly.
problem Finding solutions to problems more efficiently.
method Hierarchical controller directs low-level agent to simulate alternate states of the world.
result Achieves similar reward levels as non-hierarchical agents but with better data efficiency.
Paper optimizes hyperspherical prototypes for better class separation.
problem Previous HPL approaches either lack principled optimisation or are limited to one latent dimension.
method Develops a principled optimisation procedure and uses linear block codes to create well-separated prototypes in various dimensions.
result Optimal prototype placement is characterized with achievable and converse bounds, showing near-optimality.
Prototype model improves model auditing and understanding.
problem Auditing and understanding modern language models is expensive and approximate.
method Introduced a sparse, non-negative mixture of learned prototypes trained with clustering objectives.
result Prototype models either surpass or remain within 2.5 percentage points of dense baselines on downstream tasks.
Ensembles of decision trees perform well on many problems, but are not interpretable. In contrast to existing approaches in interpretability that focus on explaining relationships between features and predictions, we propose an alternative approach to interpret tree ensemble classifiers by surfacing representative poin…
Causal KL improves on existing metrics for evaluating causal models.
problem Insufficient discrimination between causal models using edit-distance and KL divergence.
method Introducing Causal KL, an augmented KL divergence that considers causal relationships.
result Causal KL variants effectively distinguish between observationally equivalent models.